Abstract
In the 80’s Matsumoto and Imai [8] proposed public key cryptosystems based on the difficulty of solving systems of polynomials in several variables. Although these first schemes were broken, many others followed, leading to a very active field known as Multivariate cryptography. In this paper, we show how to break one of these schemes, the Double-Round Quadratic cryptosystem from [12]. We stress that this cryptosystem has, in practice, already been cryptanalysed in [5]. However their attack uses several “non-standard” heuristics, they provide experimental evidence, but no proof is given, as opposed to this present article. Our attack uses a very general technique introduced in [9] to break the cryptosystem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Nessie project (2003), https://www.cosic.esat.kuleuven.be/nessie/
Biham, E.: Cryptanalysis of Patarin 2-Round Public Key System with S Boxes (2R). In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, Springer, Heidelberg (2000)
Courtois, N., Goubin, L., Patarin, J.: SFLASH, a fast asymmetric signature scheme (2003), available at http://eprint.iacr.org/2003/211/
Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient Algorithms for solving Overdefined Systems of Multivariate Polynomial Equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, Springer, Heidelberg (2000)
Din-Feng, Y., K-Yan, L., Zong-Duo, D.: Cryptanalysis of 2R Schemes. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, Springer, Heidelberg (1999)
Dubois, V., Fouque, P., Shamir, A., Stern, J.: Practical Cryptanalysis of SFLASH. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, Springer, Heidelberg (2007)
Goubin, L., Patarin, J.: Asymmetric Cryptography with S-Boxes. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol. 1334, Springer, Heidelberg (1997)
Imai, H., Matsumoto, T.: Algebraic Methods for Constructing Asymmetric Cryptosystems. In: Calmet, J. (ed.) Algebraic Algorithms and Error-Correcting Codes. LNCS, vol. 229, Springer, Heidelberg (1986)
Kipnis, A., Shamir, A.: Cyptanalysis of the HFE Public Key Cryptosystem. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, Springer, Heidelberg (1999)
Koeblitz, N.: Algebraic Aspects of Cryptography. Springer, Heidelberg (1998)
Moh, T.: The Method of Relinearization of Kipnis and Shamir and its Applications to TTM (1999), available at http://citeseer.ist.psu.edu/371723.html
Patarin, J., Goubin, L.: Trapdoor One-Way Permutations and Multivariate Polynomials. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol. 1334, Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scemama, A. (2007). A Cryptanalysis of the Double-Round Quadratic Cryptosystem. In: Nam, KH., Rhee, G. (eds) Information Security and Cryptology - ICISC 2007. ICISC 2007. Lecture Notes in Computer Science, vol 4817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76788-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-76788-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76787-9
Online ISBN: 978-3-540-76788-6
eBook Packages: Computer ScienceComputer Science (R0)