Updating key size estimations for pairings
type: Item
instance of: scholarly article
title: Updating key size estimations for pairings
zbMATH Open document ID: 1435.94122
author: Razvan Barbulescu
author: Sylvain Duquesne
published in: Journal of Cryptology
publication date: 2019-11-27T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 7137724
zbMATH Keywords: pairing-based cryptology
zbMATH Keywords: number field sieve
zbMATH Keywords: discrete logarithm
MaRDI profile type: Publication
full work available at URL: s00145-018-9280-5
OpenAlex ID: W2790485266
cites work: Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
cites work: Q4847920
cites work: Implementing Pairings at the 192-Bit Security Level
cites work: A Kilobit Special Number Field Sieve Factorization
cites work: Function field sieve method for discrete logarithms over finite fields
cites work: Faster Explicit Formulas for Computing Pairings over Ordinary Curves
cites work: Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
cites work: Subgroup Security in Pairing-Based Cryptography
cites work: Q4783728
cites work: Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
cites work: A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
cites work: The Tower Number Field Sieve
cites work: Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
cites work: Some mathematical remarks on the polynomial selection in NFS
cites work: Q4273681
cites work: Q4414287
cites work: Short signatures from the Weil pairing
cites work: Pairing-Friendly Elliptic Curves of Prime Order
cites work: The multiple number field sieve for medium- and high-characteristic finite fields
cites work: On a problem of Oppenheim concerning ''Factorisatio Numerorum''
cites work: Q4706999
cites work: Fast evaluation of logarithms in fields of characteristic two
cites work: Solving linear equations over GF(2): Block Lanczos algorithm
cites work: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
cites work: Public Key Cryptography - PKC 2006
cites work: FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
cites work: Choosing and generating parameters for pairing implementation on BN curves
cites work: Implementing Cryptographic Pairings over Barreto-Naehrig Curves
cites work: Guide to pairing-based cryptography
cites work: A Kilobit Hidden SNFS Discrete Logarithm Computation
cites work: Faster Hashing to ${\mathbb G}_2$
cites work: A taxonomy of pairing-friendly elliptic curves
cites work: Efficient Implementation of Bilinear Pairings on ARM Processors
cites work: Adequate Elliptic Curves for Computing the Product of n Pairings
cites work: Computing discrete logarithms in \(\mathbb F_{p^6}\)
cites work: On the Function Field Sieve and the Impact of Higher Splitting Probabilities
cites work: Solving a $$6120$$ -bit DLP on a Desktop Computer
cites work: Collecting relations for the number field sieve in
cites work: Breaking ‘128-bit Secure’ Supersingular Binary Curves
cites work: On the discrete logarithm problem in finite fields of fixed characteristic
cites work: Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
cites work: Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
cites work: Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
cites work: Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
cites work: The Eta Pairing Revisited
cites work: Solving a 676-Bit Discrete Logarithm Problem in GF(36n )
cites work: Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
cites work: Q4737504
cites work: Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
cites work: The Function Field Sieve in the Medium Prime Case
cites work: The Number Field Sieve in the Medium Prime Case
cites work: Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
cites work: The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
cites work: Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
cites work: Point Decomposition Problem in Binary Elliptic Curves
cites work: Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
cites work: Mersenne Factorization Factory
cites work: Computation of a 768-Bit Prime Field Discrete Logarithm
cites work: Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
cites work: Q4474166
cites work: Q4364556
cites work: Q3509721
cites work: Q4279567

Updating key size estimations for pairings (cites work)
cites work: The Weil pairing, and its efficient calculation

Updating key size estimations for pairings (cites work)
cites work: Q2757235

Updating key size estimations for pairings (cites work)
cites work: Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography

Updating key size estimations for pairings (cites work)
cites work: Q3840157

Updating key size estimations for pairings (cites work)
cites work: New Software Speed Records for Cryptographic Pairings

Updating key size estimations for pairings (cites work)
cites work: The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods

Updating key size estimations for pairings (cites work)
cites work: Fast Hashing to G 2 on Pairing-Friendly Curves

Updating key size estimations for pairings (cites work)
cites work: Discrete logarithms and local units

Updating key size estimations for pairings (cites work)
cites work: Using number fields to compute logarithms in finite fields

Updating key size estimations for pairings (cites work)
cites work: The number field sieve for integers of low weight

Updating key size estimations for pairings (cites work)
cites work: Special prime numbers and discrete logs in finite prime fields

Updating key size estimations for pairings (cites work)
cites work: Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case

Updating key size estimations for pairings (cites work)
cites work: A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm

Updating key size estimations for pairings (cites work)
cites work: New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields

Updating key size estimations for pairings (cites work)
cites work: Efficient Pairings and ECC for Embedded Systems

Updating key size estimations for pairings (cites work)
cites work: Optimal Pairings

Updating key size estimations for pairings (cites work)
cites work: Solving sparse linear equations over finite fields

Updating key size estimations for pairings (cites work)
cites work: On the use of the lattice sieve in the 3D NFS

Updating key size estimations for pairings (cites work)
cites work: Analysis of Optimum Pairing Products at High Security Levels

Updating key size estimations for pairings (DOI)
DOI: 10.1007/S00145-018-9280-5