Okumura proposed a candidate of post-quantum cryptosystem based on Diophantine equations of degree increasing type (DEC). Sizes of public keys in DEC are small, e.g., 1,200 bits for 128 bit security, and it is a strongly desired property in post-quantum erea. In this paper, we propose a polynomial time attack against DEC. We show that the one-wayness of DEC is reduced to finding special (relatively) short vectors in some lattices. The usual LLL algorithm does not work well for finding the most important target vector in our attack. The most technical point of our method is to heuristically find a special norm called a weighted norm to find the most important target vector. We call this method "weighted LLL algorithm" in this paper. Our experimental results suggest that our attack can break the one-wayness of DEC for 128 bit security with sufficiently high probability.
CITATION STYLE
Ding, J., Kudo, M., Okumura, S., Takagi, T., & Tao, C. (2016). Cryptanalysis of a public key cryptosystem based on diophantine equations via weighted LLL reduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9836 LNCS, pp. 305–315). Springer Verlag. https://doi.org/10.1007/978-3-319-44524-3_18
Mendeley helps you to discover research relevant for your work.