A brief history of pairings

DOI10.1007/978-3-319-55227-9_1MaRDI QIDQ5267789zbMATH OpenOpenAlexFDO

Authors Razvan Barbulescu

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

zbMATH Keywords

finite fieldspairings

Mathematics Subject Classification ID

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

Recommendations

• Pairings for cryptographers
• The realm of the pairings
• On pairing-based cryptosystems
• Pairing-based cryptography on elliptic curves
• Bilinear pairings on elliptic curves

Cites work

• scientific article; zbMATH DE number 1643939 (Why is no real title available?)
• scientific article; zbMATH DE number 1689862 (Why is no real title available?)
• scientific article; zbMATH DE number 2081059 (Why is no real title available?)
• scientific article; zbMATH DE number 1759775 (Why is no real title available?)
• A Fault Attack on Pairing-Based Cryptography
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• A taxonomy of pairing-friendly elliptic curves
• An experiment of number field sieve over \(\mathrm{GF}(p)\) of low Hamming weight characteristic
• Building Cyclic Elliptic Curves Modulo Large Primes
• Building curves with arbitrary small MOV degree over finite prime fields
• Candidate Multilinear Maps from Ideal Lattices
• Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
• Computation of a 768-bit prime field discrete logarithm
• Cryptography and Coding
• Elliptic Curves and Primality Proving
• Extended tower number field sieve: a new complexity for the medium prime case
• Factoring polynomials with rational coefficients
• Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields
• 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
• Mersenne factorization factory
• Monte Carlo Methods for Index Computation (mod p)
• New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields
• On the use of the lattice sieve in the 3D NFS
• Pairing-Friendly Elliptic Curves of Prime Order
• Reducing elliptic curve logarithms to logarithms in a finite field
• Solving sparse linear equations over finite fields
• Special prime numbers and discrete logs in finite prime fields
• 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 arithmetic of dynamical systems
• The tower number field sieve
• Using number fields to compute logarithms in finite fields

Cited in

(6)

• Still wrong use of pairings in cryptography
• Updating key size estimations for pairings
• Pairings for cryptographers
• Factor base discrete logarithms in Kummer extensions
• Some key techniques on pairing vector spaces
• Identity-based authenticated encryption with identity confidentiality

Describes a project that uses

Uses Software

• ECPP

This page was built for publication: A brief history of pairings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267789)