Factorizing RSA keys, an improved analogue solution
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,...
| Päätekijä: | |
|---|---|
| Muut tekijät: | |
| Aineistotyyppi: | Journal article |
| Kieli: | English |
| Julkaistu: |
Springer
2009
|
| Aiheet: |