A public key cryptosystem based on lattice matrices
Abstract
In this paper, we have developed a public key cryptosystem by using large abelian group of general linear group over bounded distributive lattice. We have defined automorphisms on lattice matrices by the definition lattice automorphisms. We have replaced the exponentiation by conjugation automorphisms, which are mainly used to define the public and private keys and which allows the calculations to be fast and effective. We also talk about different security aspects against known attacks and it is shown that the cryptosystem is highly secure. We have given the proposed scheme with counter example.
Copyright © 2020 Rajesh Gudepu, DPRV Subba Rao. 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.
Cite this article
R. Gudepu, D. S. Rao, A public key cryptosystem based on lattice matrices, J. Math. Comput. Sci. 10 (2020), 2408–2421. https://doi.org/10.28919/jmcs/4882
BibTeX
@article{Gudepu2020,
author = {Gudepu, Rajesh and Rao, DPRV Subba},
title = {A public key cryptosystem based on lattice matrices},
journal = {J. Math. Comput. Sci.},
volume = {10},
year = {2020},
pages = {2408--2421},
doi = {10.28919/jmcs/4882}
}