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

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 hom...

Full description

Bibliographic Details
Main Authors: Sarbini, Izzatul Nabila, Wong, Tze Jin, Koo, Lee Feng, Othman, Mohamed, Md Said, Mohamad Rushdan, Yiu, Pang Hung
Format: Article
Language:English
Published: Malaysian Society for Cryptology Research 2018
Online Access:http://psasir.upm.edu.my/id/eprint/73841/
http://psasir.upm.edu.my/id/eprint/73841/1/LUCAS.pdf
_version_ 1848857376000573440
author Sarbini, Izzatul Nabila
Wong, Tze Jin
Koo, Lee Feng
Othman, Mohamed
Md Said, Mohamad Rushdan
Yiu, Pang Hung
author_facet Sarbini, Izzatul Nabila
Wong, Tze Jin
Koo, Lee Feng
Othman, Mohamed
Md Said, Mohamad Rushdan
Yiu, Pang Hung
author_sort Sarbini, Izzatul Nabila
building UPM Institutional Repository
collection Online Access
description 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.
first_indexed 2025-11-15T11:56:34Z
format Article
id upm-73841
institution Universiti Putra Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T11:56:34Z
publishDate 2018
publisher Malaysian Society for Cryptology Research
recordtype eprints
repository_type Digital Repository
spelling upm-738412021-07-15T10:11:25Z http://psasir.upm.edu.my/id/eprint/73841/ Security analysis of Lucas based El-Gamal Cryptosystem in the elliptic curve group over finite field using two types of GMITM attacks Sarbini, Izzatul Nabila Wong, Tze Jin Koo, Lee Feng Othman, Mohamed Md Said, Mohamad Rushdan Yiu, Pang Hung 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. Malaysian Society for Cryptology Research 2018 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/73841/1/LUCAS.pdf 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 https://mscr.org.my/journal/journal-volume
spellingShingle Sarbini, Izzatul Nabila
Wong, Tze Jin
Koo, Lee Feng
Othman, Mohamed
Md Said, Mohamad Rushdan
Yiu, Pang Hung
Security analysis of Lucas based El-Gamal Cryptosystem in the elliptic curve group over finite field using two types of GMITM attacks
title Security analysis of Lucas based El-Gamal Cryptosystem in the elliptic curve group over finite field using two types of GMITM attacks
title_full Security analysis of Lucas based El-Gamal Cryptosystem in the elliptic curve group over finite field using two types of GMITM attacks
title_fullStr Security analysis of Lucas based El-Gamal Cryptosystem in the elliptic curve group over finite field using two types of GMITM attacks
title_full_unstemmed Security analysis of Lucas based El-Gamal Cryptosystem in the elliptic curve group over finite field using two types of GMITM attacks
title_short Security analysis of Lucas based El-Gamal Cryptosystem in the elliptic curve group over finite field using two types of GMITM attacks
title_sort security analysis of lucas based el-gamal cryptosystem in the elliptic curve group over finite field using two types of gmitm attacks
url http://psasir.upm.edu.my/id/eprint/73841/
http://psasir.upm.edu.my/id/eprint/73841/
http://psasir.upm.edu.my/id/eprint/73841/1/LUCAS.pdf