Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures

DOI10.1007/S00200-020-00428-WMaRDI QIDQ780363zbMATH OpenOpenAlexFDO

Authors Michela Ceria, Andrea Visconti, Moss Sweedler, Ferdinando Mora

Publication date 15 July 2020

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2434/742753

zbMATH Keywords

Barkee's cryptosystemBuchberger theoryPolly CrackerStickel's protocol

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Gröbner basis cryptosystems
• Gröbner bases for public key cryptography
• A survey on Polly Cracker systems
• Weyl Gröbner basis cryptosystems
• Lattice polly cracker cryptosystems

Cites work

• A new efficient algorithm for computing Gröbner bases (F₄)
• A survey on Polly Cracker systems
• Advances in Cryptology - CRYPTO 2003
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Buchberger-Zacharias theory of multivariate Ore extensions
• Cryptanalysis of Polly Cracker
• Cryptanalysis of Stickel’s Key Exchange Scheme
• De nugis Groebnerialium. II: Applying Macaulay's trick in order to easily write a Gröbner basis
• Effective Buchberger-Zacharias-Weispfenning theory of skew polynomial extensions of subbilateral coherent rings
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Gröbner bases and generalized sylvester matrices
• Gröbner bases computation by triangularizing Macaulay matrices
• Gröbner bases for public key cryptography
• Gröbner basis cryptosystems
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• scientific article; zbMATH DE number 2127871 (Why is no real title available?)
• scientific article; zbMATH DE number 3649988 (Why is no real title available?)
• scientific article; zbMATH DE number 3910294 (Why is no real title available?)
• scientific article; zbMATH DE number 1241624 (Why is no real title available?)
• scientific article; zbMATH DE number 1263328 (Why is no real title available?)
• scientific article; zbMATH DE number 1273640 (Why is no real title available?)
• scientific article; zbMATH DE number 687687 (Why is no real title available?)
• scientific article; zbMATH DE number 691465 (Why is no real title available?)
• scientific article; zbMATH DE number 708819 (Why is no real title available?)
• scientific article; zbMATH DE number 1952043 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• scientific article; zbMATH DE number 1925556 (Why is no real title available?)
• Involutive bases of polynomial ideals
• Lattice polly cracker cryptosystems
• Minimal involutive bases
• Non-commutative Gröbner bases in algebras of solvable type
• On an installation of Buchberger's algorithm
• On the construction of Gröbner bases using syzygies
• On the security of Stickel's key exchange scheme
• Polly cracker, revisited
• Polly cracker, revisited
• Public key cryptography based on semigroup actions
• The ideal membership problem in non-commutative polynomial rings
• The membership problem for unmixed polynomial ideals is solvable in single exponential time
• Theory of non-commutative polynomials
• Thompson’s Group and Public Key Cryptography
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Why you cannot even hope to use Gröbner bases in public key cryptography: An open letter to a scientist who failed and a challenge to those who have not yet failed

Cited in

(5)

• Why you cannot even hope to use Ore algebras in cryptography
• Weyl Gröbner basis cryptosystems
• Cryptanalysis of cryptosystems based on non-commutative skew polynomials
• Gröbner bases for public key cryptography
• Oracle-supported drawing of the Gröbner \textit{escalier}

Describes a project that uses

Uses Software

• BERGMAN

This page was built for publication: Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures

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