Polly two : A new algebraic polynomial-based public-key scheme

Applicable Algebra in Engineering, Communications and Computing

Volumn 17, Issue 3-4, 2006, Pages 267-283

  Ly, Le Van ^a  

^a Federal Office for Information Security   (Germany)

Author keywords

Combinatorially algebraic public key cryptoschemes; Elimination ideals; EnRoot; Linear Algebra attacks; Polly Cracker; Sparse polynomials; System of algebraic equations

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER CRIME; DATA PRIVACY; LINEAR ALGEBRA; POLYNOMIALS;

COMBINATORIALLY ALGEBRAIC PUBLIC-KEY CRYPTOSCHEMES; ELIMINATION IDEALS; ENROOT; LINEAR-ALGEBRA ATTACKS; POLLY CRACKER; SPARSE POLYNOMIALS; SYSTEM OF ALGEBRAIC EQUATIONS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33746341181     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-006-0010-0     Document Type: Article

References (12)

1. Bao, F., Deng, R., Geiselmann, W., Schnorr, C., Steinwandt, R., Wu, H.: Cryptanalysis of two sparse polynomial based public key cryptosystems. In: Public key cryptography 2000. Lecture Notes in Comput Sci pp. 153-164, 1992. Springer, Berlin Heidelberg New York (2001)
2. Becker, T., Weispfenning, V.: Gröbner bases. A computational approach to commutative algebra. In cooperation with Heinz Kredel. Graduate Texts in Mathematics, 141. Springer, Berlin Heidelberg New York (1993)
3. Barkee, B., Can, D.C., Ecks, J., Moriarty, T., Ree, R.F.: Why you cannot even hope to use Gröbner bases in public key cryptography: an open letter to a scientiest who failed and a challenge to those who have not yet failed. In: J Symbol Comput (18), 497-501 (1994)
4. Eisenbud, D.: Commutative algebra. With a view toward algebraic geometry. Graduate Texts in Mathematics, 150. Springer, Berlin Heidelberg New York (1995)
5. Endsuleit, R., Geiselmann, W., Steinwandt, R.: Attacking a polynomial based cryptosystem: Polly Cracker. Int J Inform Secu 1(3), 143-148 (2002)
6. Fellows, M., Koblitz, N.: Combinatorial cryptosystems galore! Finite fields: theory, applications, and algorithms (Las Vegas, NV, 1993). Contemp Math 168, 51-61 (1992)
7. Geiselmann, W., Steinwandt, R.: Cryptanalysis of Polly Cracker. IEEE Trans Inform Theory 48(11), 2990-2991 (2002)
8. Grant, D., Krastev, K., Lieman, D., Shparlinski, I.: A public key cryptosystem based on sparse polynomials. In: Proceedings of International Conference on coding theory, cryptography, and related areas, Guanajuato, pp. 114-121. Springer, Berlin Heidelberg New York (2000)
9. Grassl, M., Steinwandt, R.: Breaking a Polly-Two challenge. Private communication, (2004)
10. Huỳnh, D.: A superexpoential lower bound for Gröner bases and Church-Rosser commutative Thue systems. Inform Control 68(1-3), 196-206 (1986)
11. Koblitz, N.: Algebraic aspects of cryptography. Algorithms and Comput Mathe, 3. Springer, Berlin Heidelberg New York (1998)
12. Ly, L.: Polly Two - a public-key cryptosytem based on Polly Cracker. Dissertation, Ruhr-Universität Bochum (2002). http://www-brs.ub.ruhr-uni- bochum.de/netahtml/HSS/Diss/ LyLeVan/