Abstract—Based on Elliptic Curve Discrete Logarithm Problem (DLP), Elliptic Curve Cryptography (ECC) shows promise in the public key cryptography methods. In this article, a new algorithm based on ECC is introduced, which has lower complexity than Menezes-Vanstone algorithm. Meanwhile our method introduces “one-time pad” to increase the security,
and solve data redundancy encryption problem while at the same time maintains the authenticity of the transmitted message, which cannot be fabricated by the eavesdropper and cannot be denied by the legal transmitter. The simulations
result shows that the redundancy problem is totally solved, and the correctness of the algorithm is verified through an example. A comparisons and resistance to different attacks are included also in the essay.
Index Terms—ECC, mvecc, ElGamal, one-time pad,
Menezes-vanstone cryptosystem.
Mostafa Ahmed Mohamed Sayed and Liu Rongke are with School of Electronic and Information Engineering, Beihang University (BUAA), Beijing, China(e-mail: mostafa_adawy@ymail.com,
rongke_liu@buaa.edu.cn).
[PDF]
Cite: Mostafa Ahmed Mohamed Sayed and Liu Rongke, "MMVECC Encryption Algorithm for Redundancy
Problem Solving and Authentication Verification," International Journal of Modeling and Optimization vol. 7, no. 2, pp. 116-121, 2017.
