Sciweavers

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

25

CRYPTO
2006
Springer

favoriteEmaildiscussreport

115views Cryptology» more CRYPTO 2006»

The Number Field Sieve in the Medium Prime Case

14 years 2 months ago

The Number Field Sieve in the Medium Prime Case

Download magma.maths.usyd.edu.au

Antoine Joux, Reynald Lercier, Nigel P. Smart, Fre

Real-time Traffic

CRYPTO 2006 | Cryptology |

claim paper

Related Content

» The Function Field Sieve in the Medium Prime Case

» The number field sieve for integers of low weight

» Rotations and Translations of Number Field Sieve Polynomials

» Designing and Detecting Trapdoors for Discrete Log Cryptosystems

» Solving a 676Bit Discrete Logarithm Problem in GF36n

» Comparison of algorithms to calculate quadratic irregularity of prime numbers

» NonwaferScale Sieving Hardware for the NFS Another Attempt to Cope with 1024Bit

» Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography

» Solving norm equations in relative number fields using Sunits

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	CRYPTO
Authors	Antoine Joux, Reynald Lercier, Nigel P. Smart, Frederik Vercauteren

Comments (0)