An attack on ELG-LUC3-ECC cryptosystem using Hastad’s and Julta’s theorem

In this study, an attack on the El-Gamal encryption scheme ELG-LUC3-ECC is proposed, which is based on a third-order Lucas sequence over an elliptic curve finite field, using Hastad’s and Julta’s theorems. Hastad’s theorem was used to solve the problem of multivariate modular equations system, whe...

Full description

Saved in:
Bibliographic Details
Main Authors: T.J, Wong, L.F, Koo, M.H.A., Sathar, A.F.N., Rasedee, Izzatul Nabila, Sarbini
Format: Article
Language:English
Published: Lviv Polytechnic National University 2024
Subjects:
Online Access:http://ir.unimas.my/id/eprint/47124/1/202411411351140.pdf
http://ir.unimas.my/id/eprint/47124/
https://science.lpnu.ua/sites/default/files/journal-paper/2024/dec/36889/202411411351140.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this study, an attack on the El-Gamal encryption scheme ELG-LUC3-ECC is proposed, which is based on a third-order Lucas sequence over an elliptic curve finite field, using Hastad’s and Julta’s theorems. Hastad’s theorem was used to solve the problem of multivariate modular equations system, whereas Julta’s theorem was used to find the solutions of multivariable modular equation. As a result, the minimum amount of plaintext required for a successful attack may be determined. Thus, similar attacks can be prevented if the quantity of plaintext remains within the appropriate range.