Cryptanalysis of polly cracker

IEEE Transactions on Information Theory

Volumn 48, Issue 11, 2002, Pages 2990-2991

  Steinwandt, Rainer ^a   Geiselmann, Willi ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Cryptanalysis; Multivariate polynomials; Public key cryptography

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; SECURITY OF DATA; SET THEORY; SORTING;

CIPHERTEXTS; CRYPTANALYSIS; POLLY CRACKER;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0036846501     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.804112     Document Type: Letter

References (4)

1. M. Fellows and N. Koblitz, "Combinatorial cryptosystems galore!," in Finite Fields: Theory, Applications, and Algorithms, G. L. Mullen and P. J.-S. Shiue, Eds. Providence, RI: Amer. Math. Soc., 1994, vol. 168, Comtemporary Mathematics, pp. 51-61.
2. N. Koblitz, "Algebraic aspects of cryptography," in Algorithms and Computation in Mathematics. With an appendix on hyperelliptic curves by A. J. Menezes, Y.-H. Wu, and R. J. Zuccherato. Berlin, Heidelberg, Germany: Springer-Verlag, 1998, vol. 3.
3. R. Steinwandt, W. Geiselmann, and R. Endsuleit, "Attacking a polynomial-based cryptosystem: Polly Cracker," Int. J. Inform. Security, to be published.
4. D. Hofheinz and R. Steinwandt, "A 'Differential' attack on Polly Cracker," in Proc. IEEE Int. Symp. Information Theory (ISIT 2002), Lausanne, Switzerland, 2002, p. 211.