Factoring numbers in O(logn) arithmetic steps
From Thermodynamics of Computation
- reference groups
- Computer Science Theory
- author-supplied keywords
- Factoring algorithms
- arithmetic complexity
- prime numbers
- keywords
- authors
- Adi Shamir
- title
- Factoring numbers in O(logn) arithmetic steps
- type
- journal
- year
- 1979
- source
- Information Processing Letters
- pages
- 28-31
- volume
- 8
- issue
- 1
- link
- https://www.mendeley.com/catalogue/56b8f2f8-3271-3514-a0d4-7c8cb9adf9ea/(Error!"Error!" is not a number.)
Counts
- Citation count
- 36
- Page views
- 0
Identifiers
- doi: 10.1016/0020-0190(79)90087-5 (Google search)
- issn: 00200190
- sgr: 0038982373
- scopus: 2-s2.0-0038982373
- pui: 209158014
