International Journal of Applied Cryptography · 2012 · 66 citations · 22 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureCryptographyTheory Of ComputationElliptic Curve CryptographyElliptic CurvesModular ArithmeticDiscrete Logarithm AlgorithmsElliptic Curve ArithmeticElliptic Curve Cryptography ImplementationElliptic Curve Discrete Logarithm ProblemFinite Field ArithmeticModular Arithmetic AlgorithmsModular Arithmetic In CryptographyModular Reduction Algorithms
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.
22
Modular multiplication without trial division
Peter L. Montgomery · Mathematics of Computation · 1985 · 2.4K citations
BOINC: A System for Public-Resource Computing and Storage
David P. Anderson · 2005 · 1.9K citations
Modular Multiplication Without Trial Division
Peter L. Montgomery · Mathematics of Computation · 1985 · 1.1K citations · Full text