Special Purpose Factoring Devices
A journey from Bicycle to Quantum Computers
Computational Number Theory Project
Math 583e, University of Washington
Spring 2009
Contents
Factoring Problem
SPDs from Past
Modern Day SPDs
SPDs of Future
Summary
References
References
Course Notes: Math 583e
(by William B. Hart, Spring 2009)
Wikipedia: Integer Factorization
One line factoring algorithm
(by William B. Hart)
Lehmer Sieves
(by Michael R. Williams)
A tale of two sieves
(by Carl Pomerance)
Special purpose hardware for factoring: The NFS sieving step
(by Lenstra and Tromer)
A dedicated sieving hardware
(by Geiselmann and Steinwandt)
SHARK - A realizable special hardware sieving device for factoring 1024-bit integers
(by Franke et al)
Circuits for integer factorization: A proposal
(by Bernstein)
Analysis of Bernstein's factorization circuit
(by Lenstra et al)
Scalable Hardware for Sparse Systems of Linear Equations
(by Geiselmann et al)
On specialized hardware for supporting the Number Field Sieve (by Geiselmann and Steinwandt) in Embedded Cryptographic Hardware (by Nadia Nedjah)
Wikipedia: Quantum Computer
Matthew Hayward's webpage
Extra References
Factoring integers with Elliptic Curves
(by Lenstra)
Parallel (SIMD) Elliptic Curve Factoring
(by Dixon and Lenstra)
Speeding up Pollard and elliptic curve methods of factorization
(by Montgomery)
An Efficient Hardware Architecture for Factoring Integers with the Elliptic Curve Method
(by Franke et al)
Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware
(by Gaj et al)
ECM on Graphics Cards
(by Bernstein et al)
<< Prev: Summary
Back to Contents