M4GB

DOI10.1145/3087604.3087638zbMath1457.68329OpenAlexW2739302581MaRDI QIDQ5119953

Rusydi H. Makarim, Marc Stevens

Publication date: 9 September 2020

Published in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3087604.3087638

zbMATH Keywords

Gröbner basis algorithmmultivariate polynomial systemsquantum-safe public-key cryptosystem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (8)

Polynomial selection for computing Gröbner bases ⋮ An estimator for the hardness of the MQ problem ⋮ A technique to reduce memory usage of M4GB algorithm ⋮ The Number of Gröbner Bases in Finite Fields (Research) ⋮ Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\) ⋮ Multivariate public key cryptosystem from Sidon spaces ⋮ M4GB ⋮ Polynomial selection of <i>F</i>₄ for solving the MQ problem

Uses Software

• FGb
• Magma
• openf4

This page was built for publication: M4GB