Sciweavers

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

11

ASIACRYPT
2015
Springer

favoriteEmaildiscussreport

15views Cryptology» more ASIACRYPT 2015»

The Tower Number Field Sieve

8 years 25 days ago

The Tower Number Field Sieve

Download eprint.iacr.org

The security of pairing-based crypto-systems relies on the diﬃculty to compute discrete logarithms in ﬁnite ﬁelds Fpn where n is

Razvan Barbulescu, Pierrick Gaudry, Thorsten Klein

Real-time Traffic

ASIACRYPT 2015 | Cryptology |

claim paper

Related Content

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

» Rotations and Translations of Number Field Sieve Polynomials

» The Number Field Sieve

» Analysis and Optimization of the TWINKLE Factoring Device

» On Class Group Computations Using the Number Field Sieve

» A Kilobit Special Number Field Sieve Factorization

» Using number fields to compute logarithms in finite fields

» Everywhere Ramified Towers of Global Function Fields

» Constructing Tower Extensions of Finite Fields for Implementation of PairingBased Cryptogr...

» Improved RoutingBased Linear Algebra for the Number Field Sieve

Post Info
More Details (n/a)

Added	16 Apr 2016
Updated	16 Apr 2016
Type	Journal
Year	2015
Where	ASIACRYPT
Authors	Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung

Comments (0)