CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Public Key Cryptosystem based on Matrices

by Zekeriya Y. Karatas, Erkam Luy, Bilal Gonen
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 182 - Number 42
Year of Publication: 2019
Authors: Zekeriya Y. Karatas, Erkam Luy, Bilal Gonen
10.5120/ijca2019918432

Zekeriya Y. Karatas, Erkam Luy, Bilal Gonen . Public Key Cryptosystem based on Matrices. International Journal of Computer Applications. 182, 42 ( Feb 2019), 47-50. DOI=10.5120/ijca2019918432

@article{ 10.5120/ijca2019918432,
author = { Zekeriya Y. Karatas, Erkam Luy, Bilal Gonen },
title = { Public Key Cryptosystem based on Matrices },
journal = { International Journal of Computer Applications },
issue_date = { Feb 2019 },
volume = { 182 },
number = { 42 },
month = { Feb },
year = { 2019 },
issn = { 0975-8887 },
pages = { 47-50 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume182/number42/30378-2019918432/ },
doi = { 10.5120/ijca2019918432 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:14:05.372830+05:30
%A Zekeriya Y. Karatas
%A Erkam Luy
%A Bilal Gonen
%T Public Key Cryptosystem based on Matrices
%J International Journal of Computer Applications
%@ 0975-8887
%V 182
%N 42
%P 47-50
%D 2019
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this article, a novel public key cryptosystem is introduced by using an abelian subgroup of GL(k;Zn) where n and k are positive integers. Instead of exponentiation, the conjugation automorphisms are mainly used to define the public and private keys. This allows the calculations to be fast and effective. The security analysis of the cryptosystem is discussed and it is shown that the cryptosystem is highly secure. Moreover, proposed scheme also generalizes the main scheme given in [1].

References
  1. M. Khan and T. Shah. A novel cryptosystem based on general linear group. 3D Res, 6:2, 2015.
  2. W. Deffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22:644–654, 1976.
  3. R. L. Rivest, A. Shamir, and L. A. Adleman. Method for obtaining digital signatures and public-key cryptosystems. Commun. ACM., 21(2):120–126, 1978.
  4. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469–472, 1985.
  5. P. Pailler. Public-key cryptosystems based on composite degree residuosity classes. Advances in Cryptology, EUROCRYPT, pages 223–238, 1999.
  6. M. O. Rabin. Digitized signatures and public-key functions as intractible as factorization. MIT Laboratory for Computer Science Technical Report, LCS/TR-212, 1979.
  7. Z. Cao. A threshold key escrow scheme based on public key cryptosystem. Science in China (E Series), 44(4):441–448, 2001.
  8. K. Komaya, U. Maurer, T. Okamoto, and S. Vanston. New public-key schemes bases on elliptic curves over the ring zn. in j. feigenbaum (ed.). Crypto91, LNCS 576:252–266, 1992.
  9. P. Smith and Lennon M. Luc: A newpublic key system. Proceedings of the IFIP TC11 Ninth International Conference on Information Security, IFIP/Sec 93:103–117, 1993.
  10. M. Thangavel, P. Varalakshmi, M. Murrali, and K. Nithya. An Enhanced and Secured RSA Key Generation Scheme (ESRKGS). J. Information Security and App., 20:3–10, 2015.
Index Terms

Computer Science
Information Sciences

Keywords

Lower Triangular Matrices General Linear Group Public Key Cryptosystems

Powered by PhDFocusTM