Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Improving the parallelized Pollard lambda search on anomalous binary curves
Mathematics of Computation
On random walks for Pollard's Rho method
Mathematics of Computation
The Montgomery Inverse and Its Applications
IEEE Transactions on Computers
Faster Attacks on Elliptic Curve Cryptosystems
SAC '98 Proceedings of the Selected Areas in Cryptography
CM-Curves with Good Cryptographic Properties
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Speeding up the Discrete Log Computation on Curves with Automorphisms
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
On the Implementation of Elliptic Curve Cryptosystems
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Information Processing Letters
A Hardware Algorithm for Modular Multiplication/Division
IEEE Transactions on Computers
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Power Efficient Processor Architecture and The Cell Processor
HPCA '05 Proceedings of the 11th International Symposium on High-Performance Computer Architecture
Speeding Up the Pollard Rho Method on Prime Fields
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Fast Elliptic-Curve Cryptography on the Cell Broadband Engine
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Faster addition and doubling on elliptic curves
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Factorization of a 768-bit RSA modulus
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Montgomery multiplication on the cell
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
High-performance modular multiplication on the cell processor
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
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
Efficient SIMD Arithmetic Modulo a Mersenne Number
ARITH '11 Proceedings of the 2011 IEEE 20th Symposium on Computer Arithmetic
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Curve25519: new diffie-hellman speed records
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
| Hi-index | 0.00 |
We describe a cell processor implementation of Pollard's rho method to solve discrete logarithms in groups of elliptic curves over prime fields. The implementation was used on a cluster of PlayStation 3 game consoles to set a new record. We present in detail the underlying single instruction multiple data modular arithmetic.