A Cryptographic Application of the M-Injectivity of ( ) Over Itself
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 sen...
Gespeichert in:
Veröffentlicht in: | International journal of recent technology and engineering 2021-11, Vol.10 (4), p.7-14 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 2277-3878 2277-3878 |
DOI: | 10.35940/ijrte.D6515.1110421 |