Lattice polly cracker cryptosystems

DOI10.1016/j.jsc.2010.10.004zbMath1213.94088OpenAlexW1989422471MaRDI QIDQ633081

Carlo Traverso, Fabrizio Caruso, Massimo Caboara

Publication date: 31 March 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2010.10.004

zbMATH Keywords

latticeGröbner basisHermite normal formbinomial idealsLattice Polly CrackerPolly Cracker

Mathematics Subject Classification ID

Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Lattices and convex bodies (number-theoretic aspects) (11H06)

Related Items

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

Uses Software

• CoCoA
• NTL
• McEliece
• 4ti2
• NTRU

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hilbert functions and the Buchberger algorithm
• On Lovász' lattice reduction and the nearest lattice point problem
• Computing toric ideals
• 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
• Polly Two: a new algebraic polynomial-based public-key scheme
• Gröbner basis cryptosystems
• A Survey on Polly Cracker Systems
• Block Ciphers: Algebraic Cryptanalysis and Gröbner Bases
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Advances in Cryptology - CRYPTO 2003
• Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato