Factorizing RSA Keys, An Improved Analogue Solution
- 95 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 our previous paper4)) as a more relevant measure, and advocate, more generally, non-standard complexity analyses for non-standard computers.
Keywords:Factorization Analogue Computer Computational Complexity Precision Complexity RSA 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. Available at ftp://ftp.comlab.ox.ac.uk/pub/Documents/techreports/RR-07-04.pdf.
- 3.Blakey, E., “Factorizing RSA Keys (An Improved Analogue Solution,” in Natural Computing, Proceedings in Information and Communications Technology, vol. 1 (Suzuki, Y., Hagiya, M., Umeo, H. and Adamatzky, A. eds), Springer, pp. 16–27, 2008. Available at http://users.ox.ac.uk/~quee1871/factor_iwnc.pdf.
- 4.Blakey, E., “On the Computational Complexity of Physical Computing Systems,” in Unconventional Computing 2007 (Adamatzky, A., Bull, L., De Lacy Costello, B., Stepney, S. and Teuscher, C. editors), Luniver Press, pp. 95–115, 2007. Available at http://users.ox.ac.uk/~quee1871/ uc07_paper.pdf".
- 5.Blakey, E., “System and Method for Finding Integer Solutions,” United States patent 7453574, 2007.Google Scholar
- 7.Bovet, D. P. and Crescenzi, P., Introduction to the Theory of Complexity, Prentice Hall, 1994.Google Scholar
- 12.Sipser, M., Introduction to the Theory of Computation, PWS, 1997.Google Scholar