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 equatio...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Lviv Polytechnic National University
2024
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/117657/1/117657.pdf http://psasir.upm.edu.my/id/eprint/117657/ https://science.lpnu.ua/mmc/all-volumes-and-issues/volume-11-number-4-2024/attack-elg-luc3-ecc-cryptosystem-using-hastads |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| 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. |
|---|