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)
PDF
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
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2010/047,
      author = {Daniel R.  L.  Brown},
      title = {Lower Bounds for Straight Line Factoring},
      howpublished = {Cryptology ePrint Archive, Paper 2010/047},
      year = {2010},
      note = {\url{https://eprint.iacr.org/2010/047}},
      url = {https://eprint.iacr.org/2010/047}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.