INDEXED IN 

​​​​International Journal of Modern Science and Technology, 1(9), 2016, Pages 300-303. 


A Non-abelian group Cryptography 

S. Iswariya, A. R. Rishivarman
Department of Mathematics, Theivanai Ammal College for Women (Autonomous) Villupuram - 605 401. Tamilnadu, India.

Abstract
Most common public key cryptosystems and public key exchange protocols presently in use, such as the RSA algorithm, Diffie-Hellman, and elliptic curve methods are number theory based and hence depend on the structure of abelian groups. The strength of computing machinery has made these techniques theoretically susceptible to attack and hence recently there has been an active line of research to develop cryptosystems using noncommutative cryptographic platforms. This line of investigation has been given the broad title of noncommutative algebraic cryptography. This was initiated by two public key protocols that used the braid groups. The study of these protocols and the group theory surrounding them has had a large effect on research in infinite group theory. In cryptosystems, the algebraic properties of the platforms are used prominently in both devising cryptosystems and in cryptanalysis. The present paper discusses the potential non-commutative group and associate cryptosystem in detail.

​​Keywords: Non-abelian group; Cryptosystem; Public key; Private key.

​References

  1. Buchmann JA. Introduction to Cryptography. 2nd ed. Springer: 2004.
  2. Bresson E, Chevassut O, Pointcheval D. The Group Diffie-Hellman Problems. Nyberg K, Heys H. (Eds.).  Selected Areas in Cryptography. LNCS 2595. Springer: 2003 325-338.
  3. Myasnikov AG, Shpilrain V, Ushakov A. Group-Based Cryptography Advanced Courses in Mathematics. CRM Barcelona; Birkhäuser: 2007.
  4. Myasnikov A, Shpilrain V, Ushakov A. A Practical Attack on a Braid Group Based Cryptographic Protocols. Advances in Cryptology. 2005;3621:86-96.
  5. Arzhanseva GN, Yu Ol’shanskii A. Generosity of the Class of Groups in Which Subgroups with a Lesser Number of Generators are Free is Generic. Matematicheskie Zametki. 1996;59:489-496.
  6. Koblitz N. Algebraic Methods of Cryptography. Springer: 1998.
  7. Myasnikov A, Shpilrain V, Ushakov A. Non-commutative Cryptography and Complexity of Group theoretic Problems. Mathematical Surveys and Monographs. American Mathematical Society: 2011.
  8. Boaz T. Polynomial-time solutions of   computational problems in noncommutative-algebraic cryptography. Journal of Cryptology. 2015;28:601-622.
  9. Grigoriev D, Ponomarenko I. Homomorphic Public-Key Cryptosystems over Groups and Rings Quaderni di Matematica. 2005.
  10. Baumslag Y, Brjukhov B,  Rosenberger G. Some Cryptoprimitives for Noncommutative Algebraic Cryptography Aspects of Infinite Groups, World Scientific Press: 2009.
  11. Batty M, Braunstein S, Duncan A, Rees S. Quantum algorithms in group theory. Cont. Math. 2003;349:1-62.
  12. Wang L, Gu L, Ota K, Dong M, Cao Z, Yang Y. New public key cryptosystems based on non-Abelian factorization problems. Security and Communication Network. 2013;6(7):912-922.
  13. Magliveras SS, Stinson DR. New approaches to designing public key cryptosystem using one-way functions and trapdoors infinite group. Journal of Cryptology. 2002;15(4)285-297.
  14. Baumslag G, Fine B, Xu X.      Cryptosystems Using Linear Groups Appl. Based Cryptographic Primitives. In: Desmedt YG (Ed.): Public Key Cryptography – PKC, Springer: 2003.
  15. Zhang H, Liu J, Jia J, Mao S, Wu W. A survey on applications of matrix decomposition in cryptography. Journal of Cryptologic Research. 2014;9(1):341-357.

ISSN 2456-0235

International Journal of Modern Science and Technology