A Brief History of Pairings
From MaRDI portal
Publication:5267789
DOI10.1007/978-3-319-55227-9_1zbMath1409.94862OpenAlexW2592686001MaRDI QIDQ5267789
Publication date: 13 June 2017
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-55227-9_1
Related Items (2)
Factor base discrete logarithms in Kummer extensions ⋮ Identity-based authenticated encryption with identity confidentiality
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Building curves with arbitrary small MOV degree over finite prime fields
- Factoring polynomials with rational coefficients
- The Weil pairing, and its efficient calculation
- A taxonomy of pairing-friendly elliptic curves
- Special prime numbers and discrete logs in finite prime fields
- The Tower Number Field Sieve
- New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- Mersenne Factorization Factory
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
- Collecting relations for the number field sieve in
- An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic
- Elliptic Curves and Primality Proving
- On the use of the lattice sieve in the 3D NFS
- A Fault Attack on Pairing-Based Cryptography
- Solving sparse linear equations over finite fields
- Building Cyclic Elliptic Curves Modulo Large Primes
- Monte Carlo Methods for Index Computation (mod p)
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Reducing elliptic curve logarithms to logarithms in a finite field
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Candidate Multilinear Maps from Ideal Lattices
- 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
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Pairing-Friendly Elliptic Curves of Prime Order
- Computation of a 768-Bit Prime Field Discrete Logarithm
- The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
- The Number Field Sieve in the Medium Prime Case
- Cryptography and Coding
This page was built for publication: A Brief History of Pairings
