Mondal, Puja
(Indian Statistical Institute, Kolkata, 2021-07)
Nowadays the security of most used public-key algorithms are based on the hardness of one
of the following problems :
1. The integer factorization,
2. The elliptic-curve discrete logarithm problem.
But these problems ...