Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 819182, 7 pages
http://dx.doi.org/10.1155/2014/819182
Research Article

Signature Scheme Using the Root Extraction Problem on Quaternions

1State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, China
2Guangxi Key Lab of Wireless Wide Band Communication and Signal Processing, Guilin University of Electronic Technology, Guilin 541004, China

Received 6 February 2014; Accepted 19 May 2014; Published 28 May 2014

Academic Editor: Frank Werner

Copyright © 2014 Baocang Wang and Yupu Hu. 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. N. Koblitz and A. J. Menezes, “A survey of public-key cryptosystems,” SIAM Review, vol. 46, no. 4, pp. 599–634, 2004. View at Publisher · View at Google Scholar · View at Scopus
  2. Z. Hao, S. Zhong, and N. Yu, “A multihop key agreement scheme for wireless Ad hoc networks based on channel characteristics,” The Scientific World Journal, vol. 2013, Article ID 935604, 13 pages, 2013. View at Publisher · View at Google Scholar · View at Scopus
  3. Q. Zhang, X. Xue, and X. Wei, “A novel image encryption algorithm based on DNA subsequence operation,” The Scientific World Journal, vol. 2012, Article ID 286741, 10 pages, 2012. View at Publisher · View at Google Scholar · View at Scopus
  4. R. Guo, Q. Wen, Z. Jin, and H. Zhang, “An efficient and secure certificateless authentication protocol for healthcare system on wireless medical sensor networks,” The Scientific World Journal, vol. 2013, Article ID 761240, 7 pages, 2013. View at Publisher · View at Google Scholar · View at Scopus
  5. D. N. Moldovyan and N. A. Moldovyan, “A new hard problem over noncommutative finite groups for cryptographic protocols,” in Proceedings of the 5th International Conference on Mathematical Methods, Models and Architectures for Computer Network Security (MMM-ACNS '10), vol. 6258 of Lecture Notes in Computer Science, pp. 183–194, Springer, St. Petersburg, Russia, 2010.
  6. A. A. Kamal and A. M. Youssef, “Cryptanalysis of lvarez et al. key exchange scheme,” Information Sciences, vol. 223, no. 20, pp. 317–321, 2013. View at Google Scholar
  7. P. Pan, L. Wang, L. Wang, L. Li, and Y. Yang, “CSP-DHIES: a new public-key encryption scheme from matrix conjugation,” Security and Communication Networks, vol. 5, no. 7, pp. 809–822, 2012. View at Publisher · View at Google Scholar · View at Scopus
  8. G. Baumslag, N. Fazio, A. R. Nicolosi, V. Shpilrain, and W. E. Skeith, “Generalized learning problems and applications to non-commutative cryptography,” in Proceedings of the 5th International Conference on Provable Security (ProvSec '11), vol. 6980 of Lecture Notes in Computer Science, pp. 324–339, Springer, Xian, China, 2011.
  9. P. Vitkus, E. Sakalauskas, N. Listopadskis, and R. Vitkiene, “Microprocessor realization of key agreement protocol based on matrix power function,” Elektronika ir Elektrotechnika, no. 1, pp. 33–36, 2012. View at Publisher · View at Google Scholar · View at Scopus
  10. D. Boucher, P. Gaborit, W. Geiselmann, O. Ruatta, and F. Ulmer, “Key exchange and encryption schemes based on non-commutative skew polynomials,” in Proceedings of the 3rd International Workshop on Post-Quantum Cryptography (PQCrypto '10), vol. 6061 of Lecture Notes in Computer Science, pp. 126–141, Springer, Darmstadt, Germany, 2010.
  11. J. Climenta, P. R. Navarrob, and L. Tortosab, “Key exchange protocols over noncommutative rings. The case of End (Zp×Zp2),” International Journal of Computer Mathematics, vol. 89, no. 13-14, pp. 1753–1763, 2012. View at Google Scholar
  12. L. Gu, L. Wang, K. Ota, M. Dong, Z. Cao, and Y. Yang, “New public key cryptosystems based on non-Abelian factorization problems,” Security and Communication Networks, vol. 6, no. 7, pp. 912–922, 2013. View at Publisher · View at Google Scholar · View at Scopus
  13. L. Gu, Y. Pan, M. Dong, and K. Ota, “Noncommutative lightweight signcryption for wireless sensor networks,” International Journal of Distributed Sensor Networks, vol. 2013, Article ID 818917, 10 pages, 2013. View at Publisher · View at Google Scholar · View at Scopus
  14. I. Ahshel, M. Anshel, and D. Goldfeld, “An algebraic method for public key cryptography,” Mathematical Research Letters, vol. 6, pp. 287–291, 1999. View at Google Scholar
  15. I. Ahshel, M. Anshel, B. Fisher, and D. Goldfeld, “New key agreement protocols in braid group cryptography,” in Proceedings of the Cryptographers Track at RSA Conference on Topics in Cryptology (CT-RSA '01), vol. 2020 of Lecture Notes in Computer Science, pp. 13–27, Springer, San Francisco, Calif, USA, 2001.
  16. I. Anshel, M. Anshel, and D. Goldfeld, “Non-abelian key agreement protocols,” Discrete Applied Mathematics, vol. 130, no. 1, pp. 3–12, 2003. View at Publisher · View at Google Scholar · View at Scopus
  17. I. Anshel, M. Anshel, and D. Goldfeld, “A linear time matrix key agreement protocol over small finite fields,” Applicable Algebra in Engineering, Communications and Computing, vol. 17, no. 3-4, pp. 195–203, 2006. View at Publisher · View at Google Scholar · View at Scopus
  18. S. H. Paeng, K. C. Ha, J. H. Kim, S. Chee, and C. Park, “New public key cryptosystem using finite non Abelian groups,” in Proceedings of the Advances in Cryptology (CRYPTO '01), vol. 2139 of Lecture Notes in Computer Science, pp. 470–485, Springer, Santa Barbara, Calif, USA, 2001.
  19. S. S. Magliveras, D. R. Stinson, and T. Van Thing, “New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups,” Journal of Cryptology, vol. 15, no. 4, pp. 285–297, 2002. View at Publisher · View at Google Scholar · View at Scopus
  20. W. Lempken, T. Van Tran, S. S. Magliveras, and W. Wei, “A public key cryptosystem based on non-abelian finite groups,” Journal of Cryptology, vol. 22, no. 1, pp. 62–74, 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. K. H. Ko, S. J. Lee, and J. H. Cheon, “New public-key cryptosystem using braid groups,” in Proceedings of the Advances in Cryptology (CRYPTO '00), vol. 1880 of Lecture Notes in Computer Science, pp. 166–183, Springer, Santa Barbara, Calif, USA, 2000.
  22. J. Hughes, “A linear algebraic attack on the AAFG1 braid group cryptosystem,” in Proceedings of the 7th Australasian Conferenc on Information Security and Privacy (ACISP '02), vol. 2384 of Lecture Notes in Computer Science, pp. 176–189, Springer, Melbourne, Australia, 2002.
  23. S. J. Lee and E. Lee, “Potential weaknesses of the commutator key agreement protocol based on braid groups,” in Proceedings of the Advances in Cryptology (EuroCrypt '02), vol. 2332 of Lecture Notes in Computer Science, pp. 14–28, Springer, Amsterdam, The Netherlands, 2002.
  24. A. D. Myasnikov and A. Ushakov, “Length based attack and braid groups: cryptanalysis of Anshel-Anshel-Goldfeld key exchange protocol,” in Proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography (PKC '07), vol. 4450 of Lecture Notes in Computer Science, pp. 76–88, Springer, Beijing, China, 2007.
  25. A. D. Myasnikov and A. Ushakov, “Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux key agreement protocol,” Groups, Complexity, Cryptology, vol. 1, no. 1, pp. 63–75, 2009. View at Publisher · View at Google Scholar · View at Scopus
  26. C. Tobias, “Security analysis of the MOR cryptosystem,” in Proceedings of the 6th International Conference on Practice and Theory in Public-Key Cryptography (PKC '03), vol. 2567 of Lecture Notes in Computer Science, pp. 175–186, Springer, Miami, Fla, USA, 2002.
  27. I. Lee, W. Kim, D. Kwon, S. Nahm, N. Kwak, and Y. Baek, “On the security of MOR public key cryptosystem,” in Proceedings of Advances in Cryptology (AsiaCrypt '04), vol. 3329 of Lecture Notes in Computer Science, pp. 387–400, Springer, Jeju Island, Korea, 2004.
  28. A. Korsten, “Cryptanalysis of MOR and discrete logarithms in inner automorphism groups,” in Proceedings of the 2nd Western European Worksho on Research in Cryptology (WEWoRC '07), vol. 4954 of Lecture Notes in Computer Science, pp. 78–89, Springer, Bochum, Germany, 2008.
  29. J. Bohli, R. Steinwandt, M. I. G. Vasco, and C. Martínez, “Weak keys in MST 1,” Designs, Codes, and Cryptography, vol. 37, no. 3, pp. 509–524, 2005. View at Publisher · View at Google Scholar · View at Scopus
  30. S. R. Blackburn, C. Cid, and C. Mullan, “Cryptanalysis of the MST3 public key cryptosystem,” Journal of Mathematical Cryptology, vol. 3, no. 4, pp. 321–338, 2009. View at Publisher · View at Google Scholar · View at Scopus
  31. M. I. G. Vasco, A. L. P. Del Pozo, and P. T. Duarte, “A note on the security of MST 3,” Designs, Codes, and Cryptography, vol. 55, no. 2-3, pp. 189–200, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. J. H. Cheon and B. Jun, “A polynomial time algorithm for the braid Diffie-Hellman conjugacy problem,” in Proceedings of the Advances in Cryptology (CRYPTO '03), vol. 2729 of Lecture Notes in Computer Science, pp. 212–225, Springer, Santa Barbara, Calif, USA, 2003.
  33. E. Lee and J. H. Park, “Cryptanalysis of the public-key encryption based on braid groups,” in Proceedings of the Advances in Cryptology (EuroCrypt '03), vol. 2656 of Lecture Notes in Computer Science, pp. 477–490, Springer, Warsaw, Poland, 2003.
  34. A. Myasnikov, V. Shpilrain, and A. Ushakov, “A practical attack on a braid group based cryptographic protocol,” in Proceedings of the Advances in Cryptology (CRYPTO '05), vol. 3621 of Lecture Notes in Computer Science, pp. 86–96, Springer, Santa Barbara, Calif, USA, 2003.
  35. T. Satoh and K. Araki, “On construction of signature scheme over a certain non-commutative ring,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E80-A, no. 1, pp. 40–45, 1997. View at Google Scholar · View at Scopus
  36. E. Sakalauskas, “New digital signature scheme in Gaussian monoid,” Informatica, vol. 15, no. 2, pp. 251–270, 2004. View at Google Scholar · View at Scopus
  37. E. Sakalauskas, “One digital signature scheme in semimodule over semiring,” Informatica, vol. 16, no. 3, pp. 383–394, 2005. View at Google Scholar · View at Scopus
  38. D. Kahrobaei and C. Kouppari, “Non-commutative digital signatures,” Groups, Complexity, Cryptology, vol. 4, no. 2, pp. 377–384, 2012. View at Publisher · View at Google Scholar · View at Scopus
  39. B.-C. Wang and Y.-P. Hu, “Signature scheme based on the root extraction problem over braid groups,” IET Information Security, vol. 3, no. 2, pp. 53–59, 2009. View at Publisher · View at Google Scholar · View at Scopus
  40. L. Wang, L. Wang, Z. Cao, Y. Yang, and X. Niu, “Conjugate adjoining problem in braid groups and new design of braid-based signatures,” Science in China F: Information Sciences, vol. 53, no. 3, pp. 524–536, 2010. View at Publisher · View at Google Scholar · View at Scopus
  41. L. Wang, Z. Cao, P. Zeng, and X. Li, “One-more matching conjugate problem and security of braid-based signatures,” in Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security (ASIACCS '07), pp. 295–301, ACM, New York, NY, USA, March 2007. View at Publisher · View at Google Scholar · View at Scopus
  42. D. Coppersmith, “Weakness in quaternion signatures,” in Proceedings of the Advances in Cryptology (CRYPTO '99), vol. 1666 of Lecture Notes in Computer Science, pp. 305–314, Springer, Santa Barbara, Calif, USA, 1999.
  43. D. Coppersmith, “Weakness in quaternion signatures,” Journal of Cryptology, vol. 14, no. 2, pp. 77–85, 2001. View at Publisher · View at Google Scholar · View at Scopus
  44. M. O. Rabin, “Digitalized signatures and public-key functions as intractable as factorization,” Technical Report, Massachusetts Institute of Technology, Cambridge, Mass, USA, 1979. View at Google Scholar
  45. J. M. Pollard and C. P. Schnorr, “An efficient solution of the congruence x2+ky2m( mod  n),” IEEE Transactions on Information Theory, vol. IT-33, no. 5, pp. 702–709, 1987. View at Google Scholar · View at Scopus