Advertisement

Implicit Polynomial Recovery and Cryptanalysis of a Combinatorial Key Cryptosystem

  • Jun Xu
  • Lei Hu
  • Siwei Sun
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7618)

Abstract

A public key cryptosystem based on factoring and a combinatorial problem of matrices over ℤ N proposed in 2010 is analyzed in this paper. We propose an efficient partial private key recovery attack on it by solving a problem of recovering implicit polynomials with small coefficients given their large roots and deriving the large roots from the public key. From the partial information of private key, we can decrypt any ciphertext of the cryptosystem by a simple computation. Our implicit polynomial recovery is an application of lattice basis reduction.

Keywords

Public Key Cryptography Combinatorial Cryptosystem Implicit Polynomial Recovery Lattice LLL Algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average-case equivalence. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 284–293 (1997)Google Scholar
  2. 2.
    Bosma, W., Cannon, J., Playoust, C.: The Magma Algebra System I: The user language. Journal of Symbolic Computation 24, 235–265 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Coppersmith, D.: Finding a Small Root of a Univariate Modular Equation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 155–165. Springer, Heidelberg (1996)Google Scholar
  4. 4.
    Coppersmith, D., Franklin, M., Patarin, J., Reiter, M.: Low-Exponent RSA with Related Messages. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 1–9. Springer, Heidelberg (1996)Google Scholar
  5. 5.
    Goldreich, O., Goldwasser, S., Halvei, S.: Public-Key Cryptosystems from Lattice Reduction Problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 112–131. Springer, Heidelberg (1997)Google Scholar
  6. 6.
    Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A Ring-Based Public Key Cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267–288. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  7. 7.
    Lenstra, A.K., Lenstra Jr., H.W., Lovász, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515–534 (1982)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Merkle, R.C., Hellman, M.E.: Hiding Information and Signatures in Trapdoor Knapsack. IEEE Transaction on Information Theory 24, 525–530 (1978)CrossRefGoogle Scholar
  9. 9.
    Nguyen, P.Q., Stern, J.: Cryptanalysis of the Ajtai-Dwork Cryptosystem. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 223–242. Springer, Heidelberg (1998)Google Scholar
  10. 10.
    Odlyzko, A.M.: The rise and fall of knapsack cryptosystems. Cryptology and Computational Number Theory 42, 75–88 (1990)MathSciNetGoogle Scholar
  11. 11.
    Shoup, V.: A library for doing number theory, http://www.shoup.net/ntl
  12. 12.
    Wang, B., Hu, Y.: Diophantine Approximation Attack on a Fast Public Key Cryptosystem. In: Chen, K., Deng, R., Lai, X., Zhou, J. (eds.) ISPEC 2006. LNCS, vol. 3903, pp. 25–32. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  13. 13.
    Wang, B., Hu, Y.: A Novel Combinatorial Public Key Cryptosystem. Informatica 21(4), 611–626 (2010)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Zwillinger, D.(editor in chief): CRC Standard Mathematical Tables and Formulae, 30th edn. CRC Press, Boca Raton (1996)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jun Xu
    • 1
    • 2
  • Lei Hu
    • 1
  • Siwei Sun
    • 1
  1. 1.State Key Laboratory of Information Security, Institute of Information EngineeringChinese Academy of SciencesBeijingChina
  2. 2.Graduate University of Chinese Academy of SciencesBeijingChina

Personalised recommendations