Factorizing RSA Keys
- 357 Downloads
Factorization is notoriously difficult. Though the problem is not known to be NP-hard, neither efficient, algorithmic solution nor technologically practicable, quantum-computer solution has been found. This apparent complexity, which renders infeasible the factorization of sufficiently large values, makes secure the RSA cryptographic system.
Given the lack of a practicable factorization system from algorithmic or quantum-computing models, we ask whether efficient solution exists elsewhere; this motivates the analogue system presented here. The system’s complexity is prohibitive of its factorizing arbitrary, natural numbers, though the problem is mitigated when factorizing n = pq for primes p and q of similar size, and hence when factorizing RSA keys.
Ultimately, though, we argue that the system’s polynomial time and space complexities are testament not to its power, but to the inadequacy of traditional, Turing-machine-based complexity theory; we propose precision complexity (defined in ) as a more relevant measure.
KeywordsFactorization analogue complexity cryptography
Unable to display preview. Download preview PDF.
- 2.Blakey, E.: An Analogue Solution to the Problem of Factorization. Oxford University Computing Science Research Report CS-RR-07-04 (2007), ftp://ftp.comlab.ox.ac.uk/pub/Documents/techreports/RR-07-04.pdf
- 3.Blakey, E.: On the Computational Complexity of Physical Computing Systems. Unconventional Computing proceedings, pp. 95–115 (2007), http://users.ox.ac.uk/~quee1871/uc07_paper.pdf
- 4.Blakey, E.: System and Method for Finding Integer Solutions. United States patent application 20070165313 (2007)Google Scholar
- 6.Bovet, D.P., Crescenzi, P.: Introduction to the Theory of Complexity. Prentice Hall, Englewood Cliffs (1994)Google Scholar
- 11.Sipser, M.: Introduction to the Theory of Computation. PWS (1997)Google Scholar