Abstract
In this paper, we present a public key scheme using Discrete Logarithm problem, proposed by Diffie and Hellman (DLP)[1], particularly known as the Computational Diffie-Hellman Problem (CDH)[12]. This paper uses the Elgamal encryption scheme [6] and extends it so that more than one message can be sent. The combination of Hill Cipher[14 ] and the property of the matrix ring π΄π(ππ), of being left m-injective over itself, where π is a very large prime, are major contributions towards the proposal of this scheme.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have