Bibliographic Details
| Title: |
POST-QUANTUM GenElGamal CRYPTOSYSTEM. |
| Authors: |
DIOP, Madicke1 madicke3.diop@ucad.edu.sn, SOW, Demba1 demba1.sow@ucad.edu.sn |
| Source: |
Advances & Applications in Discrete Mathematics. Feb2026, Vol. 43 Issue 2, p197-211. 15p. |
| Subjects: |
Cryptosystems, Factorization, Public key cryptography, Cryptography, Quantum computing |
| Abstract: |
GenElGamal is an extension of the ElGamal public key encryption scheme, which modifies the key generation and encryption steps, proposed by Sow and Sow in [24]. With the rise of quantum computing, the security of public key cryptosystems based on the discrete logarithm problem, particularly GenElGamal, is threatened. In this paper, we propose a post-quantum version of the GenElGamal cryptosystem called PQ-GenElGamal using the difficult modulo 1 factoring problem (M1FP) that is resistant to post-quantum attacks. We describe our scheme and prove its security against both classical and post-quantum attacks. [ABSTRACT FROM AUTHOR] |
|
Copyright of Advances & Applications in Discrete Mathematics is the property of Pushpa Publishing House and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
