A Review on Solving ECDLP over Large Finite Field Using Parallel Pollard’s Rho (ρ) Method

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2016, Vol 18, Issue 2

Abstract

Abstract: Elliptic Curve Discrete Log Problem (ECDLP) is the underlying basis of many popular Public Key Scheme like Diffie-Hellman and ElGamal. The strength of such public key schemes is based on the difficulty ofsolving the ECDLP. The best method for solving the ECDLP has time complexity exponential in the size of the underlying field. ECDLP based cryptosystems are popular because they provide good security at key sizes much smaller than number theoretical Public Key Schemes like RSA cryptosystem. Elliptic curve cryptosystem based on ECDLP are also present in the list of recommended algorithms for use by NIST and NSA. Since ECDLP based cryptosystems are in wide-spread use, continuous efforts on monitoring the effectiveness of new attacks or improvements to existing attacks on ECDLP over large field is important. Using the parallel Pollard’s method to solve the ECDLP efficiently is one of the prime concerns. Use of different parallel architectures like cluster computing (MPI), GPGPU, FPGA cluster increases the effectiveness of attack. This article covers various aspects of finite field, Elliptic Curve Cryptography (ECC), ECDLP, methods for solving ECDLP along with emphasis on parallel Pollard’s methods using CPU cluster.

Authors and Affiliations

Kaushal A. Chavan , Dr. Indivar Gupta , Dr. Dinesh B. Kulkarni

Keywords

Related Articles

 Intelligent Fire Extinguisher System

 The multisensor fire-detection algorithm is one of the current important issues in the field of firedetection systems for intelligent buildings. This paper proposes an adaptive fusion algorithm for fire detection,...

 Analysis of GLCM Feature Extraction for Choosing Appropriate Angle Relative to BP Classifier

 GIS can manage remotely sensed images, users must have an appropriate digital map that represents lands each one has information according to its owner, status, and some other data. The classification of such lan...

 Comparison Between Clustering Algorithms for Microarray Data  Analysis

 Currently, there are two techniques used for large-scale gene-expression profiling; microarray and RNA-Sequence (RNA-Seq).This paper is intended to study and compare different clustering algorithms that used &nbs...

 Application of Big Data in Intelligent Traffic System

 Abstract: With the rapid developmentof society, transportation industryis also facing unprecedentedchallenges, if big data is used in this area, the advantage is obvious, it can resolve the questions of traditional...

Establishing Point to Point Connections Among IoT Devices Over the Internet

The rapid growth in the number of devices connected to the internet, other than computers, has proposed the Internet of Things (IoT) era. These devices make use of the high availability of internet connection to intercha...

Download PDF file
  • EP ID EP96056
  • DOI -
  • Views 136
  • Downloads 0

How To Cite

Kaushal A. Chavan, Dr. Indivar Gupta, Dr. Dinesh B. Kulkarni (2016). A Review on Solving ECDLP over Large Finite Field Using Parallel Pollard’s Rho (ρ) Method. IOSR Journals (IOSR Journal of Computer Engineering), 18(2), 1-11. https://europub.co.uk/articles/-A-96056