Polynomial selection of <i>F</i>₄ for solving the MQ problem

DOI10.14495/JSIAML.14.135MaRDI QIDQ5876137zbMATH OpenOpenAlexFDO

Authors Takuma Ito, Yuta Hoshi, Naoyuki Shinohara, Shigenori Uchiyama

Publication date 31 January 2023

Published in JSIAM Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14495/jsiaml.14.135

zbMATH Keywords

Gröbner basesMQ problemsmultivariate polynomialsmultivariate public key cryptosystems

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites work

• A new efficient algorithm for computing Gröbner bases (F₄)
• scientific article; zbMATH DE number 3649988 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• Hybrid approach for solving multivariate systems over finite fields
• M4GB. An efficient Gröbner-basis algorithm
• Polynomial selection for computing Gröbner bases
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Rainbow, a New Multivariable Polynomial Signature Scheme

Cited in

(1)

• A technique to reduce memory usage of M4GB algorithm

Describes a project that uses

Uses Software

• GeMSS
• M4GB

This page was built for publication: Polynomial selection of <i>F</i>₄ for solving the MQ problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5876137)