Advertisement

3D Research

, 6:2 | Cite as

A Novel Cryptosystem Based on General Linear Group

  • Majid KhanEmail author
  • Tariq Shah
3DR Express

Abstract

In this article, we have developed a novel public-key cryptosystem that uses large abelian subgroup of general linear group over residue ring. The merit of this proposed public key cryptosystem is that we can select session key in abelian subgroup of general linear group which reduces exponentiations and performed encryption effectively in a simple way. Our algorithm doesn’t use matrix modular exponentiation which leads us to problem in implementing. The aim of this article is to decrease the number of these exponentiations and consequently to accelerate the execution of encryption algorithm. A discussion about the security of built modifications made in the article shows that the level of security is high enough for an appropriate choice of parameters of the cryptosystems.

Keywords

General linear group Residue ring Public key cryptosystem 

References

  1. 1.
    Diffie, W., & Hellman, M. E. (1976). New directions in cryptography. IEEE Transactions on Information Theory, 22, 644–654.CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM, 21, 120–126.CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Rabin, M. O. (1979). Digitized signatures and public-key functions as intractible as factorization, MIT Laboratory for Computer Science Technical Report, LCS/TR-212.Google Scholar
  4. 4.
    Williams, H. C. (1980). A modification of the RSA public-key encryption procedure. IEEE Transactions on Information Theory IT, 6(26), 726–729. 1.1.CrossRefGoogle Scholar
  5. 5.
    Williams, H. C. (1985). Some public-key crypto-funtions as intractible as factorization. In G. R. Blakley & D. Chaum (Eds.), CRYPTO’84, LNCS 196 (pp. 66–70). Berlin: Springer.Google Scholar
  6. 6.
    Smith, P., Lennon M. (1993). LUC: A newpublic key system. In Proceedings of the IFIP TC11 Ninth International Conference on Information Security, IFIP/Sec 93, 103–117, North-Holland.Google Scholar
  7. 7.
    Cao, Z. (1999). Conic analog of RSA cryptosystem and some improved RSA cryptosystems. Journal of Natrual Science of Heilongjiang University, 16(4), 5–18.Google Scholar
  8. 8.
    Cao, Z. (2001). A threshold key escrow scheme based on public key cryptosystem. Science in China (E Series), 44(4), 441–448.CrossRefGoogle Scholar
  9. 9.
    Komaya, K., Maurer, U., Okamoto, T., & Vanston, S. (1992). Newpublic-key schemes bases on elliptic curves over the ring Zn. In J. Feigenbaum (Ed.), Crypto’91, LNCS 576 (pp. 252–266). Berlin: Springer.Google Scholar
  10. 10.
    Cao, Z. (2000). The multi-dimension RSA and its low exponent security. Science in China (E Series), 43(4), 349–354.CrossRefzbMATHGoogle Scholar
  11. 11.
    ElGamal, T. (1985). A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31, 469–472.CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    McCurley, K. (1988). A key distribution system equivalent to factoring. Journal of Cryptology, 1, 95–100.CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© 3D Research Center, Kwangwoon University and Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Departmentof Sciences & HumanitiesNational University of Computer & Emerging SciencesIslamabadPakistan
  2. 2.Departmentof MathematicsQuaid-i-Azam UniversityIslamaadPakistan

Personalised recommendations