UPM Institutional Repository

Security analysis of Lucas based El-Gamal Cryptosystem in the elliptic curve group over finite field using two types of GMITM attacks


Citation

Sarbini, Izzatul Nabila and Wong, Tze Jin and Koo, Lee Feng and Othman, Mohamed and Md Said, Mohamad Rushdan and Yiu, Pang Hung (2018) Security analysis of Lucas based El-Gamal Cryptosystem in the elliptic curve group over finite field using two types of GMITM attacks. International Journal of Cryptology Research, 8 (2). 24 - 38. ISSN 1985-5753

Abstract

The success of Garbage-man-in-the-middle (GMITM) attack relies on the possibility to access to the ”bin” of recipient in the cryptosystem. It is capable to recover the original plaintext by granting an entry to the ”bin”. There are basically two types of GMITM attacks, a polynomial attack and a homomorphic attacks. In this paper, an investigation was carried out to evaluate the polynomial structure of cryptosystem and the nature of a homomorphic attack on cryptosystem. The results show that the cryptanalyst could obtain the plaintext without knowing the secret number, a, b and R.


Download File

[img] Text (Abstract)
LUCAS.pdf

Download (67kB)
Official URL or Download Paper: https://mscr.org.my/journal/journal-volume

Additional Metadata

Item Type: Article
Divisions: Faculty of Computer Science and Information Technology
Faculty of Science
Institute for Mathematical Research
Publisher: Malaysian Society for Cryptology Research
Keywords: Bin; Decryption; Elliptic curve; Encryption; Lucas sequence
Depositing User: Ms. Nida Hidayati Ghazali
Date Deposited: 15 Jul 2021 10:11
Last Modified: 15 Jul 2021 10:11
URI: http://psasir.upm.edu.my/id/eprint/73841
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item