Report icon

Report

An analogue solution to the problem of factorization

Abstract:

The task of factorizing a given integer is notoriously difficult, to the extent of rendering computationally infeasible the extraction of factors of numbers beyond a certain size. This infeasibility is what makes the RSA cryptographic system, for example, secure. We describe an analogue method of factorizing. Just as with traditional algorithms, there is a practical limit to the size of numbers that the method can factorize; in contrast with traditional algorithms, however, the method suffer...

Expand abstract
Publication status:
Published
Peer review status:
Not peer reviewed

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
Queen's College
Role:
Author
Publisher:
Oxford University Computing Laboratory Publisher's website
Publication date:
2007-01-01
Language:
English
Keywords:
Subjects:
UUID:
uuid:fa55ee61-2dd9-4e15-a698-0352087ccacc
Local pid:
ora:4908
Deposit date:
2011-02-09

Terms of use


Views and Downloads






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

TO TOP