Cryptanalysis of 2R- schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4117 LNCS, Issue , 2006, Pages 357-372

  Faugère, Jean Charles ^a   Perret, Ludovic ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Cryptanalysis; F5 algorithm; Functional Decomposition Problem (FDP); Gr bner bases

Indexed keywords

ALGORITHMS; POLYNOMIALS; SECURITY OF DATA; SECURITY SYSTEMS;

CRYPTANALYSIS; F5 ALGORITHM; FUNCTIONAL DECOMPOSITION PROBLEM (FDP); GRÖBNER BASES;

CRYPTOGRAPHY;

EID: 33749567193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_21     Document Type: Conference Paper

References (26)

1. A.W. Adams and P. Loustaunau. An Introduction to Gröbner Bases. Graduate Studies in Mathematics, Vol. 3, AMS, 1994.
2. G. Ars, J.-C. Faugère, H. Imai, M. Kawazoe, and M. Sugita. Comparison Between XL and Gröbner Basis Algorithms. Advances in Cryptology - ASIACRYPT 2004, Lecture Notes in Computer Science, vol. 3329, pp. 338-353, 2004.
3. G. Ars, and J.-C. Faugère. Algebraic Immunities of functions over finite fields. Proceedings of BFCA'05, Rouen, 2005. Also available at http://eprint.iacr.org/2004/188.ps.
4. M. Bardet, J-C. Faugère, B. Salvy and B-Y. Yang. Asymptotic Behaviour of the Degree of Regularity of Semi-Regular Polynomial Systems. In MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry, 15 pages, 2005.
5. M. Bardet, J-C. Faugère, and B. Salvy. On the Complexity of Gröbner Basis Computation of Semi-Regular Overdetermined Algebraic Equations. In Proc. of International Conference on Polynomial System Solving (ICPSS), pp. 71-75, 2004.
6. E. Biham. Cryptanalysis of Patarin's 2-Round Public Key System with S Boxes (2R). Advances in Cryptology - CRYPTO 2000, Lecture Notes in Computer Science, vol. 1807, Springer-Verlag, pp. 408-416, 2000.
7. B. Buchberger. Gröbner Bases : an Algorithmic Method in Polynomial Ideal Theory. Recent trends in multidimensional systems theory. Reider ed. Bose, 1985.
8. B. Buchberger, G.-E. Collins, and R. Loos. Computer Algebra Symbolic and Algebraic Computation. Springer-Verlag, second edition, 1982.
9. V. Carlier, H. Chabanne, and E. Dottax Grey Box Implementation of Block Ciphers Preserving the Confidentiality of their Design. Proceedings of BFCA'05, Rouen, 2005. Also available at http://eprint.iacr.org/2004/188.ps.
10. N. Courtois, L. Goubin, and J. Patarin. SPLASH, a Fast Asymmetric Signature Scheme for low-cost Smartcards - Primitive Specification and Supporting Documentation. Available at http://www.minrank.org/sflash-b-v2.pdf.
11. D. A. Cox, J.B. Little, and D. O'Shea. Ideals, Varieties, and Algorithms: an Introduction to Computational Algebraic Geometry and Commutative Algebra. Undergraduate Texts in Mathematics. Springer-Verlag. New York, 1992.
12. M. Dickerson. The functional Decomposition of Polynomials. Ph.D Thesis, TR 89-1023, Departement of Computer Science, Cornell University, Ithaca, NY, July 1989.
13. 5. Proceedings of ISSAC, pp. 75-83. ACM press, July 2002.
14. J. C. Faugère, P. Gianni, D. Lazard, and T. Mora. Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering. Journal of Symbolic Computation, 16(4), pp. 329-344, 1993.
15. D. Kozen, and S. Landau. Polynomial decomposition algorithms. J. Symb. Comput. (7), pp 445-456, 1989.
16. L. Goubin, and J. Patarin. Trapdoor One-way Permutations and Multivariate Polynomials. Information and Communication Security, First International Conference (ICICS'97), Lecture Notes in Computer Science vol. 1334, Springer-Verlag, pp. 356-368, 1997.
17. L. Goubin, and J. Patarin. Asymmetric Cryptography with S-Boxes. Information and Communication Security, First International Conference (ICICS'97), Lecture Notes in Computer Science vol. 1334, Springer-Verlag, pp. 369-380, 1997.
18. L. Goubin, and J. Patarin. Asymmetric Cryptography with S-Boxes - Extended Version. Available at http://citeseer.ist.psu.edu/patarin97asymmetric. html.
19. J. Gutierrez, R. Rubio, J. von zur Gathen. Multivariate Polynomial Decomposition. Algebra in Engineering, Communication and Computing, 14 (1), pp. 11-31.
20. T. Matsumoto, and H. Imai. Algebraic Methods for Constructing Asymmetric Cryptosystems. Algebraic and Error-Correct ing Codes. Prod. Third Intern. Conf., Grenoble, France, Springer-Verlag, pp. 108-119, 1985.
21. T. Matsumoto, and H. Imai. Public Quadratic Polynomial-tuples for efficient signature-verification and message-encryption. Advances in Cryptology - EU-ROCRYPT 1988, Lecture Notes in Computer Science, vol. 330, Springer-Verlag, pp. 419-453, 1988.
22. J. Patarin. Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88. Advances in Cryptology - CRYPTO 1995, Lecture Notes in Computer Science, Springer-Verlag, vol. 963, pp. 248-261, 1995.
23. J. von zur Gathen. Functional decomposition of polynomials: the tame case. J. Symb. Comput. (9), pp. 281-299, 1990.
24. J. von zur Gathen. Functional decomposition of polynomials: the wild case. J. Symb. Comput. (10), pp. 437-452, 1990.
25. D.F. Ye, K.Y. Lam, Z.D. Dai. Cryptanalysis of "2R" Schemes, Advances in Cryptology - CRYPTO 1999, Lecture Notes in Computer Science, vol. 1666, Springer-Verlag, pp. 315-325, 1999.
26. D.F. Ye, Z.D. Dai and K.Y. Lam. Decomposing Attacks on Asymmetric Cryptography Based on Mapping Compositions, Journal of Cryptology (14), pp. 137-150, 2001.