A Like ELGAMAL Cryptosystem But Resistant To Post-Quantum Attacks
| Autor: | Ahmed EL-YAHYAOUI, Fouzia OMARY |
|---|---|
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | International Journal of Communication Networks and Information Security (IJCNIS). 14 |
| ISSN: | 2073-607X 2076-0930 |
| Popis: | The Modulo 1 Factoring Problem (M1FP) is an elegant mathematical problem which could be exploited to design safe cryptographic protocols and encryption schemes that resist to post quantum attacks. The ELGAMAL encryption scheme is a well-known and efficient public key algorithm designed by Taher ELGAMAL from discrete logarithm problem. It is always highly used in Internet security and many other applications after a large number of years. However, the imminent arrival of quantum computing threatens the security of ELGAMAL cryptosystem and impose to cryptologists to prepare a resilient algorithm to quantum computer-based attacks. In this paper we will present a like-ELGAMAL cryptosystem based on the M1FP NP-hard problem. This encryption scheme is very simple but efficient and supposed to be resistant to post quantum attacks. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|