The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
From MaRDI portal
Publication:5746221
DOI10.1007/978-3-319-04873-4_3zbMath1307.94061OpenAlexW1850106430MaRDI QIDQ5746221
Publication date: 18 February 2014
Published in: Pairing-Based Cryptography – Pairing 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04873-4_3
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (12)
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation ⋮ Individual discrete logarithm with sublattice reduction ⋮ A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree ⋮ Updating key size estimations for pairings ⋮ Refined analysis to the extended tower number field sieve ⋮ A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level ⋮ Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields ⋮ A Brief History of Pairings
This page was built for publication: The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
