Integer Factorization with a Neuromorphic Sieve
Abstract
The bound to factor large integers is dominated by the computational effort to discover numbers that are smooth, typically performed by sieving a polynomial sequence. On a von Neumann architecture, sieving has loglog amortized time complexity to check each value for smoothness. This work presents a neuromorphic sieve that achieves a constant time check for smoothness by exploiting two characteristic properties of neuromorphic architectures: constant time synaptic integration and massively parallel computation. The approach is validated by modifying msieve, one of the fastest publicly available integer factorization implementations, to use the IBM Neurosynaptic System (NS1e) as a coprocessor for the sieving stage.
 Publication:

arXiv eprints
 Pub Date:
 March 2017
 arXiv:
 arXiv:1703.03768
 Bibcode:
 2017arXiv170303768M
 Keywords:

 Computer Science  Neural and Evolutionary Computing;
 Computer Science  Cryptography and Security
 EPrint:
 Fixed typos in equation for modular roots (Section II, par. 6