Updating key size estimations for pairings

DOI10.1007/s00145-018-9280-5zbMath1435.94122OpenAlexW2790485266MaRDI QIDQ2010589

Razvan Barbulescu, Sylvain Duquesne

Publication date: 27 November 2019

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-018-9280-5

zbMATH Keywords

discrete logarithmnumber field sievepairing-based cryptology

Mathematics Subject Classification ID

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

Related Items

Hashing to elliptic curves of \(j\)-invariant 1728, Multi-party revocation in sovrin: performance through distributed trust, Efficient hash maps to \(\mathbb{G}_2\) on BLS curves, LOVE a pairing, Fine-grained forward secrecy: allow-list/deny-list encryption and applications, Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree, Families of SNARK-friendly 2-chains of elliptic curves, Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation, A survey of elliptic curves for proof systems, Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice, Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves, A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation, The state of the union: union-only signatures for data aggregation, Higher-dimensional sieving for the number field sieve algorithms, Finite field arithmetic in large characteristic for classical and post-quantum cryptography, New versions of Miller-loop secured against side-channel attacks, Tower building technique on elliptic curve with embedding degree 18, Improving the efficiency of re-randomizable and replayable CCA secure public key encryption, Fast, compact, and expressive attribute-based encryption, Computing discrete logarithms in \(\mathbb F_{p^6}\), Compact structure-preserving signatures with almost tight security, Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange, A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level, Group signatures with user-controlled and sequential linkability, Beta Weil pairing revisited, Identity-based authenticated encryption with identity confidentiality, Hardware implementation of multiplication over quartic extension fields, Still wrong use of pairings in cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Solving linear equations over GF(2): Block Lanczos algorithm
• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
• Choosing and generating parameters for pairing implementation on BN curves
• Computing discrete logarithms in \(\mathbb F_{p^6}\)
• Short signatures from the Weil pairing
• The Weil pairing, and its efficient calculation
• Function field sieve method for discrete logarithms over finite fields
• A taxonomy of pairing-friendly elliptic curves
• Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
• Special prime numbers and discrete logs in finite prime fields
• The Tower Number Field Sieve
• Point Decomposition Problem in Binary Elliptic Curves
• New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
• Some mathematical remarks on the polynomial selection in NFS
• Guide to Pairing-Based Cryptography
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• On the Function Field Sieve and the Impact of Higher Splitting Probabilities
• Breaking ‘128-bit Secure’ Supersingular Binary Curves
• Analysis of Optimum Pairing Products at High Security Levels
• The multiple number field sieve for medium- and high-characteristic finite fields
• Faster Hashing to ${\mathbb G}_2$
• Mersenne Factorization Factory
• Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
• Subgroup Security in Pairing-Based Cryptography
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
• Solving a $$6120$$ -bit DLP on a Desktop Computer
• A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
• Collecting relations for the number field sieve in
• Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• On the use of the lattice sieve in the 3D NFS
• FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
• Fast evaluation of logarithms in fields of characteristic two
• Fast Hashing to G 2 on Pairing-Friendly Curves
• Efficient Implementation of Bilinear Pairings on ARM Processors
• The Eta Pairing Revisited
• Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
• Solving a 676-Bit Discrete Logarithm Problem in GF(36n )
• The number field sieve for integers of low weight
• New Software Speed Records for Cryptographic Pairings
• The Function Field Sieve in the Medium Prime Case
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Solving sparse linear equations over finite fields
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• Discrete logarithms and local units
• On the discrete logarithm problem in finite fields of fixed characteristic
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
• Implementing Pairings at the 192-Bit Security Level
• Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
• Using number fields to compute logarithms in finite fields
• Optimal Pairings
• Efficient Pairings and ECC for Embedded Systems
• Adequate Elliptic Curves for Computing the Product of n Pairings
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• A Kilobit Special Number Field Sieve Factorization
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Pairing-Friendly Elliptic Curves of Prime Order
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• Computation of a 768-Bit Prime Field Discrete Logarithm
• A Kilobit Hidden SNFS Discrete Logarithm Computation
• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
• The Number Field Sieve in the Medium Prime Case
• Public Key Cryptography - PKC 2006