You are looking at a specific version 20150527:192156 of this paper.
See the latest version.
Paper 2015/505
The Tower Number Field Sieve
Razvan Barbulescu and Pierrick Gaudry and Thorsten Kleinjung
Abstract
The security of pairing-based crypto-systems relies on the difficulty to compute discrete logarithms in finite fields GF(p^n) where n is a small integer larger than 1. The state-of-art algorithm is the number field sieve (NFS) together with its many variants. When p has a special form (SNFS), as in many pairings constructions, NFS has a faster variant due to Joux and Pierrot. We present a new NFS variant for SNFS computations, which is better for some cryptographically relevant cases, according to a precise comparison of norm sizes. The new algorithm is an adaptation of Schirokauer's variant of NFS based on tower extensions, for which we give a middlebrow presentation.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- discrete logarithmnumber field sievepairings
- Contact author(s)
- razvan barbaud @ imj-prg fr
- History
- 2015-05-27: received
- Short URL
- https://ia.cr/2015/505
- License
-
CC BY