CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Parallel Implementation of Pohlig-Hellman to Compute Discrete Logarithms

by Aditya Sakre, Amit Gurbani, Pooja Dedwal, J. V. Katti
journal cover thumbnail

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

@article{ 10.5120/ijca2017913941,
author = { Aditya Sakre, Amit Gurbani, Pooja Dedwal, J. V. Katti },
title = { Parallel Implementation of Pohlig-Hellman to Compute Discrete Logarithms },
journal = { International Journal of Computer Applications },
issue_date = { May 2017 },
volume = { 166 },
number = { 3 },
month = { May },
year = { 2017 },
issn = { 0975-8887 },
pages = { 5-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume166/number3/27647-2017913941/ },
doi = { 10.5120/ijca2017913941 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:12:41.003167+05:30
%A Aditya Sakre
%A Amit Gurbani
%A Pooja Dedwal
%A J. V. Katti
%T Parallel Implementation of Pohlig-Hellman to Compute Discrete Logarithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 166
%N 3
%P 5-8
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
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
  1. Mrs. Santoshi Pote and Mrs. Jayashree Katti 2015 “Attacks on Elliptic Curve Cryptography Discrete Logarithm Problem (EC-DLP)”.
  2. Lawrence C. Washington university of Maryland “Elliptic Curves Number Theory and Cryptography”.
  3. Jason S. Howell, “The index calculus algorithm for discrete logarithm”, March 31, 1998.
  4. Joppe W.BOS, Alina Dudeanu, Dimitar Jetchev, “Collision bounds for the additive pollard rho algorithm for solving discrete logarithms”.
  5. EDLYN TESKE, “The Pohlig-Hellman Method Generalized for Group Structure Computation”.
  6. 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

Computer Science
Information Sciences

Keywords

Discrete Logarithm Problem Pohlig-Hellman Multithreading.

Powered by PhDFocusTM