An Efficient ElGamal Encryption Scheme Based on Polynomial Modular Arithmetic in $$ \text{F}_{2}^{\text{n}} $$ F 2 n

2018 ◽  
pp. 99-107
Author(s):  
Tan Soo Fun ◽  
Azman Samsudin
Keyword(s):  
Modular Arithmetic ◽  
Encryption Scheme ◽  
Elgamal Encryption

scholarly journals A Cryptographic Application of the M-Injectivity of 𝑀𝑛(𝑍𝑝) Over Itself

2021 ◽  
Vol 10 (4) ◽  
pp. 7-14
Author(s):  
Wannarisuk Nongbsap ◽  
◽  
Dr. Madan Mohan Singh ◽  
Keyword(s):  
Discrete Logarithm ◽  
Matrix Ring ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Encryption Scheme ◽  
Diffie Hellman ◽  
Hill Cipher ◽  
The Matrix ◽  
Elgamal Encryption

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.

Sign in / Sign up

Export Citation Format

Share Document