A brief history of pairings

DOI10.1007/978-3-319-55227-9_1zbMATH Open1409.94862OpenAlexW2592686001MaRDI QIDQ5267789FDOQ5267789

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

Recommendations

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

zbMATH Keywords

finite fieldspairings

Mathematics Subject Classification ID

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

Cites Work

• Factoring polynomials with rational coefficients
• A taxonomy of pairing-friendly elliptic curves
• Title not available (Why is that?)
• Monte Carlo Methods for Index Computation (mod p)
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Pairing-Friendly Elliptic Curves of Prime Order
• The Weil pairing, and its efficient calculation
• Title not available (Why is that?)
• New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
• Solving sparse linear equations over finite fields
• Reducing elliptic curve logarithms to logarithms in a finite field
• Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
• Cryptography and Coding
• Title not available (Why is that?)
• Title not available (Why is that?)
• Elliptic Curves and Primality Proving
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Candidate Multilinear Maps from Ideal Lattices
• Title not available (Why is that?)
• A Fault Attack on Pairing-Based Cryptography
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• Building curves with arbitrary small MOV degree over finite prime fields
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• The Number Field Sieve in the Medium Prime Case
• Using number fields to compute logarithms in finite fields
• Computation of a 768-Bit Prime Field Discrete Logarithm
• The Tower Number Field Sieve
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• Collecting relations for the number field sieve in
• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
• Special prime numbers and discrete logs in finite prime fields
• Mersenne Factorization Factory
• On the use of the lattice sieve in the 3D NFS
• Building Cyclic Elliptic Curves Modulo Large Primes
• An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic

Cited In (2)

• Factor base discrete logarithms in Kummer extensions
• Identity-based authenticated encryption with identity confidentiality

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)