Polly Two: a new algebraic polynomial-based public-key scheme
From MaRDI portal
Publication:2432555
DOI10.1007/s00200-006-0010-0zbMath1104.94039MaRDI QIDQ2432555
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
system of algebraic equations; sparse polynomials; Polly Cracker; combinatorially algebraic public-key cryptoschemes; elimination ideals; EnRoot; linear-algebra attacks
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
Related Items
Lattice polly cracker cryptosystems, A ciphertext-only attack on Polly Two, Gröbner basis cryptosystems, 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