An Application of Discrete Algorithms in Asymmetric Cryptography
Fatima Amounas, El Hassan El Kinani, Abdelhakim Chillali, Mohammed Ben
Abstract
Fatima Amounas, El Hassan El Kinani, Abdelhakim Chillali, Mohammed Ben
Abstract
In this paper we propose an application of public key distribution based on the security depending on the difficulty of elliptic curve discrete logarithm problem. More precisely, we propose an example of Elgamal encryption cryptosystem on the elliptic curve given by the equation: y2 = x3 + 70x+ 57[73].
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we propose an application of public key distribution based on the security depending on the difficulty of elliptic curve discrete logarithm problem. More precisely, we propose an example of Elgamal encryption cryptosystem on the elliptic curve given by the equation: y2 = x3 + 70x+ 57[73].
Key concepts: ElGamal encryption, Elliptic curve cryptography, Discrete logarithm, Public-key cryptography, Elliptic curve, Post-quantum cryptography, Mathematics, Cryptography