Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014 (2014), Article ID 475678, 18 pages
http://dx.doi.org/10.1155/2014/475678
Research Article

Preimage Selective Trapdoor Function: How to Repair an Easy Problem

The State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China

Received 23 August 2013; Accepted 9 March 2014; Published 27 April 2014

Academic Editor: Yi-Kuei Lin

Copyright © 2014 Baocang Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. Bellare, S. Halevi, A. Sahai, and S. Vadhan, “Many-to-one trapdoor functions and their relation to public-key cryptosystems,” in Advances in Cryptology—Crypto 1998, vol. 1462 of Lecture Notes in Computer Science, pp. 283–298, Springer, Santa Barbara, Calif, USA, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, vol. 31, no. 4, pp. 469–472, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. T. Q. Khoat, “Relation between the hardness of a problem and the number of its solutions,” Acta Mathematica Vietnamica, vol. 36, no. 1, pp. 55–60, 2011. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. A. M. Youssef, “Cryptanalysis of a knapsack-based probabilistic encryption scheme,” Information Sciences, vol. 179, no. 18, pp. 3116–3121, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. E. F. Brickell and A. M. Odlyzko, “Cryptanalysis: a survey of recent results,” in Contemporary Cryptology, The Science of Information Integrity, pp. 501–540, IEEE Press, New York, NY, USA, 1992. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. J. C. Lagarias, “The computational complexity of simultaneous Diophantine approximation problems,” SIAM Journal on Computing, vol. 14, no. 1, pp. 196–209, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. J. C. Lagarias, “Knapsack public key cryptosystems and diophantine approximation,” in Advances in Cryptology—Crypto 1983, pp. 3–23, Plenum, New York, NY, USA, 1984. View at Google Scholar
  8. P. Nguyen and J. Stern, “Merkle-Hellman revisited: a cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations,” in Advances in cryptology—CRYPTO 1997, vol. 1294 of Lecture Notes in Computer Science, pp. 198–212, Springer, Santa Barbara, Calif, USA, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. P. Nguyen and J. Stern, “Cryptanalysis of a fast public key cryptosystem presented at SAC ’97,” in Selected Areas in Cryptography, vol. 1556 of Lecture Notes in Computer Science, pp. 213–218, Springer, Ontario, Canada, 1998. View at Google Scholar
  10. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the Association for Computing Machinery, vol. 21, no. 2, pp. 120–126, 1978. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. B. Chor and R. L. Rivest, “A knapsack-type public key cryptosystem based on arithmetic in finite fields,” IEEE Transactions on Information Theory, vol. 34, no. 5, part 1, pp. 901–909, 1988. View at Publisher · View at Google Scholar · View at MathSciNet
  12. T. Okamoto, K. Tanaka, and S. Uchiyama, “Quantum public-key cryptosystems,” in Advances in Cryptology—CRYPTO 2000, vol. 1880 of Lecture Notes in Computer Science, pp. 147–165, Springer, Santa Barbara, Calif, USA, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. T. M. Cover, “Enumerative source encoding,” IEEE Transactions on Information Theory, vol. 19, no. 1, pp. 73–77, 1973. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. P. Q. Nguyen and J. Stern, “Adapting density attacks to low-weight knapsacks,” in Advances in cryptology—ASIACRYPT 2005, vol. 3788 of Lecture Notes in Computer Science, pp. 41–58, Springer, Chennai, India, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  15. S. Vaudenay, “Cryptanalysis of the Chor-Rivest cryptosystem,” Journal of Cryptology, vol. 14, no. 2, pp. 87–100, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. L. H. Encinas, J. M. Masqué, and A. Q. Dios, “Safer parameters for the Chor-Rivest cryptosystem,” Computers & Mathematics with Applications, vol. 56, no. 11, pp. 2883–2886, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. L. H. Encinas, J. M. Masqué, and A. Q. Dios, “Analysis of the efficiency of the Chor-Rivest cryptosystem implementation in a safe-parameter range,” Information Sciences, vol. 179, no. 24, pp. 4219–4226, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  18. A. Kate and I. Goldberg, “Generalizing cryptosystems based on the subset sum problem,” International Journal of Information Security, vol. 10, no. 3, pp. 189–199, 2011. View at Publisher · View at Google Scholar · View at Scopus
  19. K. Omura and K. Tanaka, “Density attack to the Knapsack cryptosystems with enumerative source encoding,” IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, vol. 84, no. 1, pp. 1564–1569, 2001. View at Google Scholar · View at Scopus
  20. T. Izu, J. Kogure, T. Koshiba, and T. Shimoyama, “Low-density attack revisited,” Designs, Codes and Cryptography, vol. 43, no. 1, pp. 47–59, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. N. Kunihiro, “New definition of density on knapsack cryptosystems,” in Progress in Cryptology—AFRICACRYPT 2008, vol. 5023, pp. 156–173, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. M. Rabin, “Digital signatures and public-key encryptions as intractable as factorization,” MIT Technical Report 212, 1979. View at Google Scholar
  23. M. J. Coster, B. A. LaMacchia, A. M. Odlyzko, and C.-P. Schnorr, “An improved low-density subset sum algorithm,” in Advances in Cryptology—Eurocrypt 1991, vol. 547 of Lecture Notes in Computer Science, pp. 54–67, Springer, Brighton, UK, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. M. J. Coster, A. Joux, B. A. LaMacchia, A. M. Odlyzko, C.-P. Schnorr, and J. Stern, “Improved low-density subset sum algorithms,” Computational Complexity, vol. 2, no. 2, pp. 111–128, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. M. K. Lee and K. Park, “Low-density attack of public-key cryptosystems based on compact knapsacks,” Journal of Electrical Engineering and Information Science, vol. 4, no. 2, Article ID 197204, 1999. View at Google Scholar
  26. N. Koblitz, Algebraic Aspects of Cryptography, vol. 3, Springer, Berlin, Germany, 1998. View at MathSciNet
  27. A. M. Odlyzko, “The rise and fall of knapsack cryptosystems,” in Cryptology and Computational Number Theory, vol. 42 of Proceedings of Symposia in Applied Mathematics, pp. 75–88, 1990. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  28. B. Wang, Q. Wu, and Y. Hu, “A knapsack-based probabilistic encryption scheme,” Information Sciences, vol. 177, no. 19, pp. 3981–3994, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. T. Kleinjung, K. Aoki, J. Franke et al., “Factorization of a 768-bit RSA modulus,” http://eprint.iacr.org/2010/006.
  30. K. Aardal, C. A. J. Hurkens, and A. K. Lenstra, “Solving a system of linear Diophantine equations with lower and upper bounds on the variables,” Mathematics of Operations Research, vol. 25, no. 3, pp. 427–442, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  31. R. C. Merkle and M. E. Hellman, “Hiding information and signatures in trapdoor knapsacks,” IEEE Transactions on Information Theory, vol. 24, no. 5, pp. 525–530, 1978. View at Google Scholar · View at Scopus
  32. A. Shamir, “A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem,” IEEE Transactions on Information Theory, vol. 30, no. 5, pp. 699–704, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  33. M. H. Qu and S. A. Vanstone, “The knapsack problem in cryptography,” in Finite Fields: Theory, Applications, and Algorithms, vol. 168 of Contemporary Mathematics, pp. 291–308, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  34. K. Itoh, E. Okamoto, and M. Mambo, “Proposal of a fast public key cryptosystem,” in Proceedings of the Selected Areas in Cryptography (SAC '97), Ottawa, Canada, 1997. View at Publisher · View at Google Scholar