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
- EP ID EP96056
- DOI -
- Views 81
- Downloads 0
Modeling and Processing of Cloud Computing and It’s Performance Measurement
Abstract: Cloud computing is the growing technology of large scale distributed computing. It provides ondemand access to distributed resources, which are available in open environment on paid basis. Because all most all...
Ontology Based Data Analysing Approach for Actionable Knowledge Discovery
Abstract: In Data Mining, the effectiveness of association rules is limited by the huge quantity of delivered rules. In this manuscript, we propose a new approach to prune and filter discovered rules. An interactiv...
Minimization of Side Effects of Knowledge Hiding Based On Association Rule Mining
Abstract: Privacy is very important in Data Mining. Association rule mining, is a important technique, has already been applied in a wide range of areas. Large databases cannot be secured by encryption or other tec...
Detecting Anomaly IDS in Network using Bayesian Network
In a hostile area of network, it is a severe challenge to protect sink, developing flexible and adaptive security oriented approaches against malicious activities. Intrusion detection is the act of detecting, mon...
Development of Virtual Computing Lab Using Private Cloud
Abstract: Virtual Computing Lab (VCL) is a very effective answer for the educational institution to meet the increasing demand of physical machines, different computational laboratories and large number of users in alimi...