Polly Two: a new algebraic polynomial-based public-key scheme

DOI10.1007/s00200-006-0010-0zbMath1104.94039OpenAlexW2076620897MaRDI QIDQ2432555

Le Van Ly

Publication date: 25 October 2006

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

Full work available at URL: https://doi.org/10.1007/s00200-006-0010-0

zbMATH Keywords

system of algebraic equationssparse polynomialsPolly Crackercombinatorially algebraic public-key cryptoschemeselimination idealsEnRootlinear-algebra attacks

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (4)

Lattice polly cracker cryptosystems ⋮ Gröbner basis cryptosystems ⋮ A ciphertext-only attack on Polly Two ⋮ Algebraic cryptography: new constructions and their security against provable break

Cites Work

• 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
• A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
• Cryptanalysis of Polly Cracker
• Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polly Two: a new algebraic polynomial-based public-key scheme