International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Lower Bounds for Straight Line Factoring

Authors:
Daniel R. L. Brown
Download:
URL: http://eprint.iacr.org/2010/047
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2010-22948,
  title={Lower Bounds for Straight Line Factoring},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / Factoring, RSA, Straight line programs},
  url={http://eprint.iacr.org/2010/047},
  note={ dbrown@certicom.com 14760 received 29 Jan 2010, last revised 31 May 2010},
  author={Daniel R. L. Brown},
  year=2010
}