Abstract
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 [3]) as a more relevant measure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adleman, L.M.: Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1024 (1994)
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
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
Blakey, E.: System and Method for Finding Integer Solutions. United States patent application 20070165313 (2007)
Blum, M.: A Machine-Independent Theory of the Complexity of Recursive Functions. J. of the Assoc. for Computing Machinery 14(2), 322–336 (1967)
Bovet, D.P., Crescenzi, P.: Introduction to the Theory of Complexity. Prentice Hall, Englewood Cliffs (1994)
Brent, R.P.: Recent Progress and Prospects for Integer Factorisation Algorithms. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 3–20. Springer, Heidelberg (2000)
Church, A.: An Unsolvable Problem of Elementary Number Theory. American J. of Math. 58, 345–363 (1936)
Miehle, W.: Link-Length Minimization in Networks. Operations Research 6(2), 232–243 (1958)
Shor, P.W.: Polynomial Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Computing 26, 1484–1509 (1997)
Sipser, M.: Introduction to the Theory of Computation. PWS (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Tokyo
About this paper
Cite this paper
Blakey, E. (2009). Factorizing RSA Keys. In: Suzuki, Y., Hagiya, M., Umeo, H., Adamatzky, A. (eds) Natural Computing. Proceedings in Information and Communications Technology, vol 1. Springer, Tokyo. https://doi.org/10.1007/978-4-431-88981-6_2
Download citation
DOI: https://doi.org/10.1007/978-4-431-88981-6_2
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-88980-9
Online ISBN: 978-4-431-88981-6
eBook Packages: Computer ScienceComputer Science (R0)