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

DOI10.14495/jsiaml.14.135OpenAlexW4312456012MaRDI QIDQ5876137

Yuta Hoshi, Shigenori Uchiyama, Takuma Ito, Naoyuki Shinohara

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 basesmultivariate polynomialsmultivariate public key cryptosystemsMQ problems

Mathematics Subject Classification ID

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

Related Items (1)

A technique to reduce memory usage of M4GB algorithm

Uses Software

• M4GB
• GeMSS

Cites Work

• Unnamed Item
• Unnamed Item
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Hybrid approach for solving multivariate systems over finite fields
• Rainbow, a New Multivariable Polynomial Signature Scheme
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Polynomial selection for computing Gröbner bases
• M4GB

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