Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
On random walks for Pollard's Rho method
Mathematics of Computation
Speeding Up Pollard's Rho Method for Computing Discrete Logarithms
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Attacking elliptic curve cryptosystems with special-purpose hardware
Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays
Special-Purpose Hardware for Solving the Elliptic Curve Discrete Logarithm Problem
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Collision Search for Elliptic Curve Discrete Logarithm over GF(2m) with FPGA
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Ultra High Performance ECC over NIST Primes on Commercial FPGAs
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
Heterogenic Distributed System for Cryptanalysis of Elliptic Curve Based Cryptosystems
ICSENG '08 Proceedings of the 2008 19th International Conference on Systems Engineering
Breaking Elliptic Curve Cryptosystems Using Reconfigurable Hardware
FPL '10 Proceedings of the 2010 International Conference on Field Programmable Logic and Applications
On the correct use of the negation map in the Pollard rho method
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
An Integrated Prime-Field ECDLP Hardware Accelerator with High-Performance Modular Arithmetic Units
RECONFIG '11 Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs
Breaking ciphers with COPACOBANA –a cost-optimized parallel code breaker
CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
International Journal of Applied Cryptography
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
| Hi-index | 0.00 |
Elliptic curve cryptography (ECC) has become a popular public key cryptography standard. The security of ECC is due to the difficulty of solving the elliptic curve discrete logarithm problem (ECDLP). In this paper, we demonstrate a successful attack on ECC over prime field using the Pollard rho algorithm implemented on a hardware-software cointegrated platform. We propose a high-performance architecture for multiplication over prime field using specialized DSP blocks in the FPGA. We characterize this architecture by exploring the design space to determine the optimal integer basis for polynomial representation and we demonstrate an efficient mapping of this design to multiple standard prime field elliptic curves. We use the resulting modular multiplier to demonstrate low-latency multiplications for curves secp112r1 and P-192. We apply our modular multiplier to implement a complete attack on secp112r1 using a Nallatech FSB-Compute platform with Virtex-5 FPGA. The measured performance of the resulting design is 114 cycles per Pollard rho step at 100 MHz, which gives 878 K iterations per second per ECC core. We extend this design to a multicore ECDLP implementation that achieves 14.05M iterations per second with 16 parallel point addition cores.