The week's pick
Random Articles
Reseach Article
Parallel Implementation of Pohlig-Hellman to Compute Discrete Logarithms
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 166 - Number 3 |
| Year of Publication: 2017 |
| Authors: Aditya Sakre, Amit Gurbani, Pooja Dedwal, J. V. Katti |
10.5120/ijca2017913941
|
Aditya Sakre, Amit Gurbani, Pooja Dedwal, J. V. Katti . Parallel Implementation of Pohlig-Hellman to Compute Discrete Logarithms. International Journal of Computer Applications. 166, 3 ( May 2017), 5-8. DOI=10.5120/ijca2017913941
Abstract
Almost half of the world is now connected to the Internet and it has become an integral part of our day to day life. The usage of Internet varies from personal communication to high level business transactions. So security of these Internet services is necessary to maintain Confidentiality, Integrity and Availability. To achieve this there were various cryptographic algorithms proposed. But security of these algorithms needs to be verified. The integer factorization problem, the finite field discrete logarithm problem and the elliptic curve discrete logarithm problem are essential mathematical problems that the practical public key cryptographic systems are based on. ElGamal is one of the cryptographic algorithm, based on discrete logarithms. Pohlig-Hellman algorithm is used for computing discrete logarithms. This paper proposes the parallel implementation of Pohlig-Hellman algorithm to observe improvement in execution time as compared to sequential execution. Paper also analyses the effect of key on execution time.
References
- Mrs. Santoshi Pote and Mrs. Jayashree Katti 2015 “Attacks on Elliptic Curve Cryptography Discrete Logarithm Problem (EC-DLP)”.
- Lawrence C. Washington university of Maryland “Elliptic Curves Number Theory and Cryptography”.
- Jason S. Howell, “The index calculus algorithm for discrete logarithm”, March 31, 1998.
- Joppe W.BOS, Alina Dudeanu, Dimitar Jetchev, “Collision bounds for the additive pollard rho algorithm for solving discrete logarithms”.
- EDLYN TESKE, “The Pohlig-Hellman Method Generalized for Group Structure Computation”.
- ElGamal T. A public key cryptosystem and a signature scheme based on discret logarithms [J].IEEE Transactions on information Theory,1985,31(4):469-472.
Index Terms
Keywords