You are looking at a specific version 20100531:203208 of this paper.
See the latest version.
Paper 2010/047
Lower Bounds for Straight Line Factoring
Daniel R. L. Brown
Abstract
Straight line factoring algorithms include a variant Lenstra's elliptic curve method. This note proves lower bounds on the length of straight line factoring algorithms.
Note: Riesel may have produced similar results in 1985 (reported to me by D. J. Bernstein). Paper will be revised accordingly.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- FactoringRSAStraight line programs
- Contact author(s)
- dbrown @ certicom com
- History
- 2010-05-31: last of 4 revisions
- 2010-01-30: received
- See all versions
- Short URL
- https://ia.cr/2010/047
- License
-
CC BY