Recommendations
Cites work
- scientific article; zbMATH DE number 1676636 (Why is no real title available?)
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 1186938 (Why is no real title available?)
- scientific article; zbMATH DE number 475434 (Why is no real title available?)
- scientific article; zbMATH DE number 503245 (Why is no real title available?)
- scientific article; zbMATH DE number 1088239 (Why is no real title available?)
- scientific article; zbMATH DE number 1952905 (Why is no real title available?)
- scientific article; zbMATH DE number 2081059 (Why is no real title available?)
- scientific article; zbMATH DE number 1924342 (Why is no real title available?)
- scientific article; zbMATH DE number 2086903 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 799769 (Why is no real title available?)
- A Kilobit Hidden SNFS Discrete Logarithm Computation
- A Kilobit Special Number Field Sieve Factorization
- A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- A taxonomy of pairing-friendly elliptic curves
- Adequate elliptic curves for computing the product of \(n\) pairings
- Analysis of optimum pairing products at high security levels
- Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
- Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))
- Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
- Choosing and generating parameters for pairing implementation on BN curves
- Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Computation of a 768-bit prime field discrete logarithm
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Discrete logarithms and local units
- Efficient implementation of bilinear pairings on ARM processors
- Efficient pairings and ECC for embedded systems
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
- Extended tower number field sieve: a new complexity for the medium prime case
- FPGA implementation of pairings using residue number system and lazy reduction
- Fast Hashing to G 2 on Pairing-Friendly Curves
- Fast evaluation of logarithms in fields of characteristic two
- Faster explicit formulas for computing pairings over ordinary curves
- Faster hashing to \({\mathbb G}_2\)
- Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields
- Faster squaring in the cyclotomic subgroup of sixth degree extensions
- Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
- Function field sieve method for discrete logarithms over finite fields
- Guide to pairing-based cryptography
- Implementing Cryptographic Pairings over Barreto-Naehrig Curves
- Implementing pairings at the 192-bit security level
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- Mersenne factorization factory
- New Software Speed Records for Cryptographic Pairings
- New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On the discrete logarithm problem in finite fields of fixed characteristic
- On the function field sieve and the impact of higher splitting probabilities. Application to discrete logarithms in \(\mathbb{F}_{2^{1971}}\) and \(\mathbb{F}_{2^{3164}}\)
- On the use of the lattice sieve in the 3D NFS
- Optimal Pairings
- Pairing-Friendly Elliptic Curves of Prime Order
- Public Key Cryptography - PKC 2006
- Short signatures from the Weil pairing
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Solving a $$6120$$ -bit DLP on a Desktop Computer
- Solving a 676-bit discrete logarithm problem in \(\text{GF}(3^{6n})\)
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- Solving linear equations over GF(2): Block Lanczos algorithm
- Solving sparse linear equations over finite fields
- Some mathematical remarks on the polynomial selection in NFS
- Special prime numbers and discrete logs in finite prime fields
- Subgroup security in pairing-based cryptography
- The Eta Pairing Revisited
- The Function Field Sieve in the Medium Prime Case
- The Number Field Sieve in the Medium Prime Case
- The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
- The Weil pairing, and its efficient calculation
- 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 number field sieve for integers of low weight
- The tower number field sieve
- Using number fields to compute logarithms in finite fields
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
Cited in
(35)- Multi-party revocation in sovrin: performance through distributed trust
- The state of the union: union-only signatures for data aggregation
- Revisiting pairing-friendly curves with embedding degrees 10 and 14
- Still wrong use of pairings in cryptography
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- Hashing to elliptic curves of \(j\)-invariant 1728
- Finite field arithmetic in large characteristic for classical and post-quantum cryptography
- Fast, compact, and expressive attribute-based encryption
- Curves with Fast Computations in the First Pairing Group
- New versions of Miller-loop secured against side-channel attacks
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
- Higher-dimensional sieving for the number field sieve algorithms
- Special TNFS-secure pairings on ordinary genus 2 hyperelliptic curves
- Improving the efficiency of re-randomizable and replayable CCA secure public key encryption
- Fine-grained forward secrecy: allow-list/deny-list encryption and applications
- A survey of elliptic curves for proof systems
- A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation
- Making the identity-based Diffie-Hellman key exchange efficiently revocable
- LOVE a pairing
- Hardware implementation of multiplication over quartic extension fields
- Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
- Group signatures with user-controlled and sequential linkability
- Beta Weil pairing revisited
- 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
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Compact structure-preserving signatures with almost tight security
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
- Tower building technique on elliptic curve with embedding degree 18
- Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing
- Identity-based authenticated encryption with identity confidentiality
- zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs
- Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange
- Utilizing two subfields to accelerate individual logarithm computation in extended tower number field sieve
This page was built for publication: Updating key size estimations for pairings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010589)
