A Brief History of Pairings (Q5267789)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 6730153

Language	Label	Description	Also known as
English	A Brief History of Pairings	scientific article; zbMATH DE number 6730153

Statements

scholarly article

0 references

A Brief History of Pairings (English)

0 references

Razvan Barbulescu

0 references

Arithmetic of Finite Fields

0 references

publication date

13 June 2017

0 references

zbMATH Keywords

pairings

0 references

finite fields

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-55227-9_1

0 references

Elliptic Curves and Primality Proving

0 references

Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields

0 references

A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic

0 references

The Tower Number Field Sieve

0 references

0 references

Pairing-Friendly Elliptic Curves of Prime Order

0 references

Building curves with arbitrary small MOV degree over finite prime fields

0 references

A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves

0 references

A taxonomy of pairing-friendly elliptic curves

0 references

Candidate Multilinear Maps from Ideal Lattices

0 references

Collecting relations for the number field sieve in

0 references

An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic

0 references

Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method

0 references

The Number Field Sieve in the Medium Prime Case

0 references

0 references

Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields

0 references

The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$

0 references

Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case

0 references

Mersenne Factorization Factory

0 references

Computation of a 768-Bit Prime Field Discrete Logarithm

0 references

Cryptography and Coding

0 references

0 references

Factoring polynomials with rational coefficients

0 references

The Weil pairing, and its efficient calculation

0 references

0 references

Building Cyclic Elliptic Curves Modulo Large Primes

0 references

Reducing elliptic curve logarithms to logarithms in a finite field

0 references

Monte Carlo Methods for Index Computation (mod p)

0 references

A Fault Attack on Pairing-Based Cryptography

0 references

Using number fields to compute logarithms in finite fields

0 references

Special prime numbers and discrete logs in finite prime fields

0 references

0 references

New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields

0 references

Solving sparse linear equations over finite fields

0 references

On the use of the lattice sieve in the 3D NFS

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-55227-9_1

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5267789

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5267789&oldid=36327127"