Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

STOC
1990
ACM

favoriteEmaildiscussreport

99views Algorithms» more STOC 1990»

The Number Field Sieve

13 years 8 months ago

The Number Field Sieve

Download www.std.org

The number field sieve is an algorithm to factor integers of the form re

Arjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S.

Real-time Traffic

Algorithms | Factoring Algorithms | Number Field Sieve | STOC 1990 |

claim paper

Related Content

» Rotations and Translations of Number Field Sieve Polynomials

» Analysis and Optimization of the TWINKLE Factoring Device

» CAIRN 2 An FPGA Implementation of the Sieving Step in the Number Field Sieve Method

» A Kilobit Special Number Field Sieve Factorization

» On Class Group Computations Using the Number Field Sieve

» Using number fields to compute logarithms in finite fields

» Improved RoutingBased Linear Algebra for the Number Field Sieve

» The number field sieve for integers of low weight

» Designing and Detecting Trapdoors for Discrete Log Cryptosystems

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1990
Where	STOC
Authors	Arjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S. Manasse, John M. Pollard

Comments (0)