High Order Linearization Equation (HOLE) attack on multivariate public key cryptosystems

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

Volumn 4450 LNCS, Issue , 2007, Pages 233-248

  Ding, Jintai ^a   Hu, Lei ^b   Nie, Xuyun ^b   Li, Jianyu ^b   Wagner, John ^a  

^a UNIVERSITY OF CINCINNATI   (United States)

^b GRADUATE SCHOOL   (China)

Author keywords

Algebraic cryptanalysis; High order linearization equation; Multivariate public key cryptosystem; Quadratic polynomial

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; LINEARIZATION; MATHEMATICAL OPERATORS;

ALGEBRAIC CRYPTANALYSIS; HIGH ORDER LINEARIZATION EQUATIONS; MEDIUM FIELD EQUATIONS; MULTIVARIATE PUBLIC KEY CRYPTOSYSTEMS; QUADRATIC POLYNOMIALS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 38049027287     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71677-8_16     Document Type: Conference Paper

References (33)

1. Mehdi-Laurent Akkar, Nicolas T. Courtois, Romain Duteuil, and Louis Goubin. A fast and secure implementation of Sflash. In PKC-2003, LNCS, volume 2567, pages 267-278. Springer, 2003.
2. Gwénolé Ars and Jean-Charles Faugère and Hideki Imai and Mitsuru Kawazoe and Makoto Sugita Comparison between XL and Gröbner Basis Algorithms, Asiacrypt 2004, LNCS, V. 3329.
3. M. Bardet, J-C. Fauge, B. Salvy and B-Y. Yang Asymptotic Behaviour of the Degree of Regularity of Semi-Regular Polynomial Systems MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry, Porto Conte, Alghero, Sardinia (Italy), May 27th - June 1st, 2005, 15 pages.
4. Nicolas T. Courtois The security of hidden field equations (HFE) In C. Naccache, editor, Progress in cryptology, CT-RSA, LNCS, volume 2020, pages 266-281. Springer, 2001
5. Nicolas Courtois, Alexander Klimov, Jacques Patarin, and Adi Shamir. Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In B. Preenel, editor, Advances in cryptology, Eurocrypt 2000, LNCS, volume 1807, pages 392-407. Springer, 2000.
6. Nicolas Courtois, Josef Pieprzyk: Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. ASIACRYPT 2002, LNCS 2501, 267-287, Springer 2002.
7. J. Chen and T. Moh. On the Goubin-Courtois attack on TTM. Cryptology ePrint Archive, 72, 2001. http://eprint.iacr.org/2001/072.
8. Whitfield Diffie and Martin Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6):644-654, 1976.
9. Jintai Ding. A new variant of the Matsumoto-Imai cryptosystem through perturbation. In F. Bao, R. Deng, and J. Zhou, editors, the 7th International Workshop on Practice and Theory in Public key Cryptography, Singapore, (PKC'04), LNCS, volume 2947, pages 305-318. Springer, 2004.
10. Jintai Ding and Jason Gower Inoculating Multivariate Schemes Against Differential Attacks. Accepted for PKC-2006, IACR eprint 2005/255.
11. J. Ding and D. S. Schmidt. A common defect of the TTM cryptosystem. In Proceedings of the technical track of the ACNS'03, ICISA Press, pages 68-78, 2003. http://eprint.iacr.org.
12. J. Ding and D. S. Schmidt. The new TTM implementation is not secure. In H. Niederreiter K.Q. Feng and C.P. Xing, editors, Proceedings of International Workshop on Coding, Cryptography and Combinatorics (CCC 2003), pages 106-121, 2003.
13. Jintai Ding, and D. S. Schmidt Cryptanalysis of HFEV and the internal perturbation of HFE. The 8th International Workshop on Practice and Theory in Public key Cryptography, Jan. 2005, Switzerland (PKC'05), Lecture Notes in Computer Sciences, volume 3386, pages 288301 Springer, 2005.
14. Jintai Ding, and D. S. Schmidt Rainbow, a new multivariate public key signature scheme. The Third International Conference of Applied Cryptography and Network Security (ACNS 2005), New York, June 7-10, 2005, Lecture Notes in Computer Science 3531, Page 164-175, Springer, 2005.
15. 4), Journal of Pure and Applied Algebra, V. 139, P. 61-88, June 199.
16. P.-A. Fouque, L. Granboulan, and J. Stern. Differential Cryptanalysis for Multivariate Schemes Advances in Cryptology - EUROCRYPT 2005, Lecture Notes in Computer Science 3494 Springer 2005, Page 341-353.
17. L. Goubin and N. Courtois. Cryptanalysis of the TTM cryptosystem. LNCS, Springer Verlag, 1976:44-57, 2000.
18. Aviad Kipnis and Adi Shamir. Cryptanalysis of the HFE public key cryptosystem by relinearization. In M. Wiener, editor, Advances in crytology - Crypto '99, LNCS, volume 1666, pages 19-30. Springer, 1999.
19. T. Matsumoto and H. Imai. Public quadratic polynomial-tuples for efficient signature verification and message encryption. In C. G. Guenther, editor, Advances in cryptology - EUROCRYPT'88, LNCS, volume 330, pages 419-453. Springer, 1988.
20. T. T. Moh. A fast public key system with signature and master key functions. Lecture Notes at EE department of Stanford University., May 1999. http://www.usdsi.com/ttm.html.
21. T.Moh and J.M.Chen and Boyin Yang Building Instances of TTM Immune to the Goubin-Courtois Attack and the Ding-Schmidt Attack. IACR eprint 2004/168, http://eprint.iacr.org.
22. NESSIE. European project IST-1999-12324 on New European Schemes for Signature, Integrity and Encryption, http://www.cryptonessie.org.
23. J. Patarin. Cryptanalysis of the Matsumoto and Imai public key scheme of Eurocrypt'88. In D. Coppersmith, editor, Advances in Cryptology -Crypto '95, LNCS, volume 963, pages 248-261, 1995.
24. J. Patarin. Hidden field equations (HFE) and isomorphism of polynomials (IP): Two new families of asymmetric algorithms. In U. Maurer, editor, Eurocrypt'96, LNCS, volume 1070, pages 33-48. Springer, 1996.
25. J. Patarin. The oil and vinegar signature scheme. Dagstuhl Workshop on Cryptography, September 1997, 1997.
26. Jacques Patarin, Nicolas Courtois, and Louis Goubin. Flash, a fast multivariate signature algorithm. In LNCS, volume 2020, pages 298-307. Springer, 2001.
27. -+ and HM: variations around two schemes of T. Matsumoto and H. Imai. In K. Ohta and D. Pei, editors, ASIA CRYPT'98, LNCS, volume 1514, pages 35-50. Springer, 1998.
28. PQCrypto 2006: International Workshop on Post-Quantum Cryptography http://postquantum.cr.yp.to/
29. Ronald Rivest, Adi Shamir, and Leonard M. Adleman. A method for obtaining digital signatures and public key cryptosystems. ACM, 21(2):120-126, 1978.
30. Peter Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev., 41(2):303-332, 1999.
31. Lih-Chung Wang and Yuh-Hua Hu and Feipei Lai and Chun-Yen Chou and Bo-Yin Yang, Tractable Rational Map Signature, Public Key Cryptosystems 2005, LNCS 3386, Springer, P. 244-257.
32. Lih-Chung Wang, Bo-yin Yang, Yuh-Hua Hu and Feipei Lai, A MediumField Multivariate Public key Encryption Scheme, CT-RSA 2006: The Cryptographers' Track at the RSA Conference 2006, LNCS 3860, 132-149, Springer, 2006.
33. B. Yang and J. Chen. Building Secure Tame-like Multivariate Public key Cryptosystems-The New TTS. Information Security and Privacy: 10th Australasian Conference-ACISP 2005, LNCS 3574, 2005, Springer, P. 518-531.