论文信息 - A "differential" attack on Polly Cracker

A "differential" attack on Polly Cracker

We describe an attack on the cryptosystem Polly Cracker for which it is not necessary to know a superset of the monomials used during encryption. The attack is demonstrated with Koblitz's "graph perfect code instance" of Polly Cracker.

Dennis Hofheinz | Rainer Steinwandt

[1] Igor E. Shparlinski,et al. A Public Key Cryptosystem Based on Sparse Polynomials , 2000 .

[2] Rainer Steinwandt,et al. Attacking a polynomial-based cryptosystem: Polly Cracker , 2002, International Journal of Information Security.

[3] Neal Koblitz,et al. Algebraic aspects of cryptography , 1998, Algorithms and computation in mathematics.

[4] David A. Cox,et al. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics) , 2007 .

[5] Igor E. Shparlinski,et al. Cryptographic Applications of Sparse Polynomials over Finite Rings , 2000, ICISC.

[6] M. Fellows. Combinatorial Cryptosystems Galore! , 2022 .

[7] Robert H. Deng,et al. Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems , 2001, Public Key Cryptography.