Welcome to the resource topic for 2010/047
Title:
Lower Bounds for Straight Line Factoring
Authors: 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.
ePrint: https://eprint.iacr.org/2010/047
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .