Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 5361695, 8 pages
http://dx.doi.org/10.1155/2016/5361695
Research Article

Research on Attacking a Special Elliptic Curve Discrete Logarithm Problem

1State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou 450001, China
2Air Force Engineering University, Xi’an 710038, China
3Basic Department, Army Aviation Institution, Beijing 101123, China

Received 17 December 2015; Revised 15 May 2016; Accepted 31 May 2016

Academic Editor: Nazrul Islam

Copyright © 2016 Jiang Weng et al. 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. D. Shanks, “Class number, a theory of factorization and genera,” in Proceedings of the Symposia in Pure Mathematics, vol. 20, pp. 415–440, 1971.
  2. J. M. Pollard, “Monte carlo methods for index computations (mod p),” Mathematics of Computation, vol. 32, no. 143, pp. 918–924, 1978. View at Google Scholar · View at MathSciNet
  3. P. C. Van Oorschot and M. J. Wiener, “Parallel collision search with cryptanalytic applications,” Journal of Cryptology, vol. 12, no. 1, pp. 1–28, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  4. D. Boneh and M. Franklin, “Identity-based encryption from the Weil pairing,” SIAM Journal on Computing, vol. 32, no. 3, pp. 586–615, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. D. Boneh and X. Boyen, “Short signatures without random oracles,” in Advances in Cryptology—EUROCRYPT 2004, pp. 56–73, Springer, Berlin, Germany, 2004. View at Google Scholar
  6. D. Boneh and X. Boyen, “Efficient selective-id secure identity-based encryption without random oracles,” in Advances in Cryptology—EUROCRYPT 2004, pp. 223–238, Springer, Berlin, Germany, 2004. View at Google Scholar
  7. D. Boneh, C. Gentry, and B. Waters, “Collusion resistant broadcast encryption with short ciphertexts and private keys,” in Advances in Cryptology—CRYPTO 2005, V. Shoup, Ed., vol. 3621 of Lecture Notes in Computer Science, pp. 258–275, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  8. J. H. Cheon, “Security analysis of strong diffie-hellman problem,” in Advances in Cryptology—EUROCRYPT 2006, vol. 4004, pp. 1–11, Springer, Berlin, Germany, 2006. View at Google Scholar
  9. J. H. Cheon, “Discrete logarithm problems with auxiliary inputs,” Journal of Cryptology, vol. 23, no. 3, pp. 457–476, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. T. Satoh, “On generalization of Cheon's algorithm,” IACR Cryptology ePrint Archive 2009:58, 2009. View at Google Scholar
  11. T. Kim, Integer factorization and discrete logarithm with additional in-formation [Ph.D. thesis], Seoul National University, 2011.
  12. M. Kim, J. H. Cheon, and I.-S. Lee, “Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs,” Mathematics of Computation, vol. 83, no. 288, pp. 1993–2004, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. T. Kim and C. J. Hee, “A new approach to discrete logarithm problem with auxiliary inputs,” IACR Cryptology ePrint Archive 2012:609, 2012. View at Google Scholar
  14. Y. Sakemi, G. Hanaoka, T. Izu, M. Takenaka, and M. Yasuda, “Solving a discrete logarithm problem with auxiliary input on a 160-bit elliptic curve,” in Public Key Cryptography—PKC 2012, M. Fischlin, J. Buchmann, and M. Manulis, Eds., vol. 7293 of Lecture Notes in Computer Science, pp. 595–608, Springer, New York, NY, USA, 2012. View at Publisher · View at Google Scholar
  15. D. R. L. Brown and R. P. Gallant, “The static Diffie-Hellman problem,” Cryptology ePrint Archive Report 2004/306, 2004, https://eprint.iacr.org/2004/306. View at Google Scholar
  16. T. W. Hungerford, Algebra, Graduate Texts in Mathematics, 1980.
  17. S. Lang, Algebra, Graduate Texts in Mathematics, Springer, New York, NY, USA, 3rd edition, 2002.
  18. T. Izu, M. Takenaka, and M. Yasuda, “Experimental results on Cheon's algorithm,” in Proceedings of the 5th International Conference on Availability, Reliability, and Security (ARES '10), pp. 625–628, IEEE, February 2010. View at Publisher · View at Google Scholar · View at Scopus