Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures
From MaRDI portal
Publication:780363
DOI10.1007/S00200-020-00428-WzbMath1457.94096OpenAlexW3016731865MaRDI QIDQ780363
Andrea Visconti, Michela Ceria, Moss Eisenberg 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
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (2)
Why you cannot even hope to use Ore algebras in cryptography ⋮ Oracle-supported drawing of the Gröbner \textit{escalier}
Uses Software
Cites Work
- Polly cracker, revisited
- Lattice polly cracker cryptosystems
- The ideal membership problem in non-commutative polynomial rings
- Non-commutative Gröbner bases in algebras of solvable type
- On the construction of Gröbner bases using syzygies
- On an installation of Buchberger's algorithm
- The membership problem for unmixed polynomial ideals is solvable in single exponential time
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- De nugis Groebnerialium. II: Applying Macaulay's trick in order to easily write a Gröbner basis
- Involutive bases of polynomial ideals
- Minimal involutive bases
- Theory of non-commutative polynomials
- 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
- Buchberger-Zacharias theory of multivariate Ore extensions
- Effective Buchberger-Zacharias-Weispfenning theory of skew polynomial extensions of subbilateral coherent rings
- Gröbner basis cryptosystems
- Public key cryptography based on semigroup actions
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Polly Cracker, Revisited
- Cryptanalysis of Stickel’s Key Exchange Scheme
- Thompson’s Group and Public Key Cryptography
- A Survey on Polly Cracker Systems
- Cryptanalysis of Polly Cracker
- Gröbner bases and generalized sylvester matrices
- Advances in Cryptology - CRYPTO 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures
