Journal article icon

Journal article

Factorizing RSA keys, an improved analogue solution

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; t...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Author's Original

Actions


Access Document


Files:
Publisher copy:
10.1007/s00354-008-0059-3

Authors


More by this author
Institution:
University of Oxford
Oxford college:
Queen's College, The
Department:
Mathematical,Physical & Life Sciences Division - Computing Laboratory
Publisher:
Springer Publisher's website
Journal:
New Generation Computing Journal website
Volume:
27
Issue:
2
Pages:
159-176
Publication date:
2009-02-05
DOI:
EISSN:
1882-7055
ISSN:
0288-3635
URN:
uuid:f4b6c8f8-4861-4ca3-a7e2-b16d5cab0967
Local pid:
ora:4916

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP