An analogue solution to the problem of factorization
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 f...
| Main Author: | |
|---|---|
| Format: | Report |
| Language: | English |
| Published: |
Oxford University Computing Laboratory
2007
|
| Subjects: |