Concrete hardness estimates of the MQ problem
280 views
Skip to first unread message
javier verbel
Aug 3, 2022, 5:16:24 AM8/3/22
to pqc-forum
Hello everyone,
We are happy to share with you the MQ-estimator (https://github.com/Crypto-TII/multivariate_quadratic_estimator). This is a sage package to estimate the hardness of solving Multivariate Quadratic (MQ) problem, which is related to the security of multivariate-public key cryptosystems (MPKC). A preprint accompanying sage package is available at https://eprint.iacr.org/2022/708.pdf.
We are happy to share with you the MQ-estimator (https://github.com/Crypto-TII/multivariate_quadratic_estimator). This is a sage package to estimate the hardness of solving Multivariate Quadratic (MQ) problem, which is related to the security of multivariate-public key cryptosystems (MPKC). A preprint accompanying sage package is available at https://eprint.iacr.org/2022/708.pdf.
In addition to the complexity estimator, our sage package also provides modules to construct toy instances of several MPKC schemes such as UOV, Rainbow, and GeMSS. These modules will be useful for experimental and educational purposes.
The project's vision is to provide to the cryptographic community a common tool to precisely estimate the security of Multivariate-based cryptosystems.
The project's vision is to provide to the cryptographic community a common tool to precisely estimate the security of Multivariate-based cryptosystems.
We are open to contributions and future discussions.
Best Regards,
Emanuele Bellini, Rusydi H. Makarim, Carlo Sanna, Javier Verbel
Emanuele Bellini, Rusydi H. Makarim, Carlo Sanna, Javier Verbel
Reply all
Reply to author
Forward
0 new messages