In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the "tractable rational map" cryptosystem. We show combinatorial weaknesses of the cryptosystem, and introduce a variant of the XL resolution algorithm, the Linear Method, which is able to leverage these weaknesses to invert in short time the trapdoor one-way function defined by the cipher using only the public key, and even rebuild a private key. We also interpret the behavior of the Linear Method on random instances of the scheme, and show that various generalizations of the cipher, as well as an increase of the security parameter, cannot lead to a secure scheme. © International Association for Cryptologic Research 2005.
CITATION STYLE
Joux, A., Kunz-Jacques, S., Muller, F., & Ricordel, P. M. (2005). Cryptanalysis of the tractable rational map cryptosystem. In Lecture Notes in Computer Science (Vol. 3386, pp. 258–274). Springer Verlag. https://doi.org/10.1007/978-3-540-30580-4_18
Mendeley helps you to discover research relevant for your work.