Extended tower number field sieve: a new complexity for the medium prime case

DOI10.1007/978-3-662-53018-4_20MaRDI QIDQ2835600zbMATH OpenOpenAlexFDO

Authors Taechan Kim, Razvan Barbulescu

Publication date 30 November 2016

Published in Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53018-4_20

zbMATH Keywords

discrete logarithm problemfinite fieldscryptanalysisnumber field sieve

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• The tower number field sieve
• A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm
• Refined analysis to the extended tower number field sieve
• A unified polynomial selection method for the (tower) number field sieve algorithm

Cites work

• scientific article; zbMATH DE number 2081059 (Why is no real title available?)
• A Kilobit Special Number Field Sieve Factorization
• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• A homomorphic LWE based E-voting scheme
• A taxonomy of pairing-friendly elliptic curves
• Algorithmic Number Theory
• Bounds for resultants of univariate and bivariate polynomials
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Discrete logarithms and local units
• Factoring integers with elliptic curves
• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• Implementing pairings at the 192-bit security level
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields
• Pairing-Friendly Elliptic Curves of Prime Order
• Public Key Cryptography - PKC 2006
• Solving sparse linear equations over finite fields
• The Number Field Sieve in the Medium Prime Case
• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
• The multiple number field sieve for medium- and high-characteristic finite fields
• The multiple number field sieve with conjugation and generalized Joux-Lercier methods
• The tower number field sieve
• Using number fields to compute logarithms in finite fields

Cited in

(54)

• Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
• An efficient attribute-based access control system with break-glass capability for cloud-assisted industrial control system
• A unified polynomial selection method for the (tower) number field sieve algorithm
• Trapdoor DDH groups from pairings and isogenies
• Secure and Efficient Pairing at 256-Bit Security Level
• Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
• Improved extension protocols for Byzantine broadcast and agreement
• Choosing and generating parameters for pairing implementation on BN curves
• Computing discrete logarithms in \(\mathbb F_{p^6}\)
• Finite field arithmetic in large characteristic for classical and post-quantum cryptography
• The multiple number field sieve with conjugation and generalized Joux-Lercier methods
• Updating key size estimations for pairings
• Fast, compact, and expressive attribute-based encryption
• Fast, compact, and expressive attribute-based encryption
• Curves with Fast Computations in the First Pairing Group
• Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
• Generating pairing-friendly elliptic curve parameters using sparse families
• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
• Higher-dimensional sieving for the number field sieve algorithms
• An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication
• Improving the efficiency of re-randomizable and replayable CCA secure public key encryption
• Faster individual discrete logarithms in finite fields of composite extension degree
• Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
• Lattice sieving in three dimensions for discrete log in medium characteristic
• Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
• ON BOUNDS FOR BALANCED EMBEDDING DEGREE
• Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
• A survey of elliptic curves for proof systems
• Towards zero knowledge argument for double discrete logarithm with constant cost
• LOVE a pairing
• Hardware implementation of multiplication over quartic extension fields
• Short generators without quantum computers: the case of multiquadratics
• A brief history of pairings
• Individual discrete logarithm with sublattice reduction
• New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields
• Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis
• Families of SNARK-friendly 2-chains of elliptic curves
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
• A classification of ECM-friendly families of elliptic curves using modular curves
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
• Compact structure-preserving signatures with almost tight security
• TNFS resistant families of pairing-friendly elliptic curves
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
• DiSSECT: distinguisher of standard and simulated elliptic curves via traits
• Polymath: Groth16 is not the limit
• zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs
• Refined analysis to the extended tower number field sieve
• The tower number field sieve
• A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm
• Indiscreet logarithms in finite fields of small characteristic
• Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
• New constructions of hinting PRGs, OWFs with encryption, and more

This page was built for publication: Extended tower number field sieve: a new complexity for the medium prime case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835600)