Extended tower number field sieve: a new complexity for the medium prime case
From MaRDI portal
Publication:2835600
DOI10.1007/978-3-662-53018-4_20zbMATH Open1384.94075OpenAlexW2406585997MaRDI QIDQ2835600FDOQ2835600
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
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
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
- Factoring integers with elliptic curves
- A taxonomy of pairing-friendly elliptic curves
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- Pairing-Friendly Elliptic Curves of Prime Order
- New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields
- Solving sparse linear equations over finite fields
- Implementing pairings at the 192-bit security level
- Bounds for resultants of univariate and bivariate polynomials
- A Kilobit Special Number Field Sieve Factorization
- Algorithmic Number Theory
- Title not available (Why is that?)
- A homomorphic LWE based E-voting scheme
- The Number Field Sieve in the Medium Prime Case
- Using number fields to compute logarithms in finite fields
- Discrete logarithms and local units
- The tower number field sieve
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
- The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
- Public Key Cryptography - PKC 2006
- The multiple number field sieve for medium- and high-characteristic finite fields
- The multiple number field sieve with conjugation and generalized Joux-Lercier methods
Cited In (54)
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
- Towards zero knowledge argument for double discrete logarithm with constant cost
- Polymath: Groth16 is not the limit
- zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs
- 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
- Finite field arithmetic in large characteristic for classical and post-quantum cryptography
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- 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
- Higher-dimensional sieving for the number field sieve algorithms
- Generating pairing-friendly elliptic curve parameters using sparse families
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
- 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
- Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE
- A survey of elliptic curves for proof systems
- Lattice sieving in three dimensions for discrete log in medium characteristic
- Short generators without quantum computers: the case of multiquadratics
- LOVE a pairing
- Hardware implementation of multiplication over quartic extension fields
- Individual discrete logarithm with sublattice reduction
- A brief history of pairings
- 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
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
- A classification of ECM-friendly families of elliptic curves using modular curves
- Families of SNARK-friendly 2-chains of elliptic curves
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Compact structure-preserving signatures with almost tight security
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- TNFS resistant families of pairing-friendly elliptic curves
- DiSSECT: distinguisher of standard and simulated elliptic curves via traits
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- Refined analysis to the extended tower number field sieve
- Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange
- 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
- 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)
