Polynomial selection for computing Gröbner bases

DOI10.14495/JSIAML.13.72MaRDI QIDQ5047101zbMATH OpenOpenAlexFDO

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

Publication date 9 November 2022

Published in JSIAM Letters (Search for Journal in Brave)

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

zbMATH Keywords

Gröbner basisMQ 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₄)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• scientific article; zbMATH DE number 3639144 (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
• M4GB. An efficient Gröbner-basis algorithm
• Multivariate public key cryptosystems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Rainbow, a New Multivariable Polynomial Signature Scheme

Cited in

(4)

• Computation of involutive and Gröbner bases using the tableau representation of polynomials
• Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
• Polynomial selection of <i>F</i>₄ for solving the MQ problem
• A technique to reduce memory usage of M4GB algorithm

Describes a project that uses

Uses Software

• M4GB
• GeMSS
• MQ Challenge

This page was built for publication: Polynomial selection for computing Gröbner bases

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