Cryptanalysis of a public key cryptosystem based on two cryptographic assumptions

Cryptanalysis of a public key cryptosystem based on two cryptographic assumptions

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IEE Proceedings - Information Security — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Baocang and Yupu proposed a relatively fast public key cryptosystem. The authors claim that the security of their system is based on two number-theoretic hard problems, namely the simultaneous Diophantine approximation problem and the integer factorisation problem. In this article we present a polynomial time heuristic attack that enables us to recover the private key from the public key. In particular, we show that breaking the system can be reduced to finding a short vector in a lattice which can be achieved using the L3-lattice reduction algorithm.


    1. 1)
      • A.J. Menezes , P.C. van Oorschot , S.A. Vanstone . (1996) Handbook of applied cryptographic research.
    2. 2)
      • W. Baocang , H. Yupu . Public key cryptosystem based on two cryptographic assumptions. IEE Proc. Commun. , 6 , 861 - 865
    3. 3)
      • A.K. Lenstra , H.W. Lenstra , L. Lovász . Factoring polynomials with rational coefficients. Math. Ann. , 515 - 534
    4. 4)
      • I. Niven , H.S. Zuckerman . (1966) An introduction to the theory of numbers.
    5. 5)
      • Nguyen, P., Stern, J.: `Cryptanalysis of the Ajtai-Dwork Cryptosystem', Advances in Cryptology, Proc. CRYPTO' 98, Aug. 1998, Santa Barbara, CA, USA, p. 223–242, Lect. Notes Comput. Sci., 1462.
    6. 6)
      • Nguyen, P., Stern, J.: `Cryptanalysis of a fast public key cryptosystem presented at SAC '97', Proc. Workshop on Selected Areas in Cryptography, Aug. 1998, Kingston, Canada, p. 213–218, Lect. Notes Comput. Sci., 1556.
    7. 7)
      • Youssef, A.M., Gong, G.: `Cryptanalysis of a public key cryptosystem proposed at ACISP 2000', Proc. ACISP01, July 2001, Sydney, Australia, p. 15–20, Lect. Notes Comput. Sci., 2119.
    8. 8)
      • Nguyen, P., Stern, J.: `Lattice reduction in cryptology: An update Algorithmic Number Theory', Proc. of ANTS-IV, July 2000, p. 85–112, Lect. Notes Comput. Sci., 1838.
    9. 9)
      • Boneh, D., Venkatesan, R.: `Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes', Proc. of CRYPTO '96, Aug. 1996, Santa Barbara, CA, USA, p. 129–142, Lect. Notes Comput. Sci., 1109.

Related content

This is a required field
Please enter a valid email address