Updating key size estimations for pairings (Q2010589)

!

WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use the normal view instead:

Updating key size estimations for pairings

scientific article; zbMATH DE number 7137724

Language	Label	Description	Also known as
default for all languages	No label defined
English	Updating key size estimations for pairings	scientific article; zbMATH DE number 7137724

Statements

instance of

scholarly article

0 references

title

Updating key size estimations for pairings (English)

0 references

0 references

0 references

Journal of Cryptology

0 references

publication date

27 November 2019

0 references

zbMATH Keywords

pairing-based cryptology

0 references

number field sieve

0 references

discrete logarithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00145-018-9280-5

0 references

cites work

Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields

0 references

Q4847920

0 references

Implementing pairings at the 192-bit security level

0 references

A Kilobit Special Number Field Sieve Factorization

0 references

Function field sieve method for discrete logarithms over finite fields

0 references

Faster explicit formulas for computing pairings over ordinary curves

0 references

Weakness of $\mathbb{F}_{3^{6 \cdot 1429}}$ and $\mathbb{F}_{2^{4 \cdot 3041}}$ for discrete logarithm cryptography

0 references

Subgroup security in pairing-based cryptography

0 references

Q4783728

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

Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys

0 references

Some mathematical remarks on the polynomial selection in NFS

0 references

Q4273681

0 references

Q4414287

0 references

Short signatures from the Weil pairing

0 references

Pairing-Friendly Elliptic Curves of Prime Order

0 references

The multiple number field sieve for medium- and high-characteristic finite fields

0 references

On a problem of Oppenheim concerning ''Factorisatio Numerorum''

0 references

Q4706999

0 references

Fast evaluation of logarithms in fields of characteristic two

0 references

Solving linear equations over GF(2): Block Lanczos algorithm

0 references

Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm

0 references

Public Key Cryptography - PKC 2006

0 references

FPGA implementation of pairings using residue number system and lazy reduction

0 references

Choosing and generating parameters for pairing implementation on BN curves

0 references

Implementing Cryptographic Pairings over Barreto-Naehrig Curves

0 references

Guide to pairing-based cryptography

0 references

A Kilobit Hidden SNFS Discrete Logarithm Computation

0 references

Faster hashing to ${\mathbb G}_2$

0 references

A taxonomy of pairing-friendly elliptic curves

0 references

Efficient implementation of bilinear pairings on ARM processors

0 references

Adequate elliptic curves for computing the product of $n$ pairings

0 references

Computing discrete logarithms in $\mathbb F_{p^6}$

0 references

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}}$

0 references

Solving a $$6120$$ -bit DLP on a Desktop Computer

0 references

Collecting relations for the number field sieve in $\text{GF}(p^6)$

0 references

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}}$)

0 references

On the discrete logarithm problem in finite fields of fixed characteristic

0 references

Solving discrete logarithms on a 170-bit MNT curve by pairing reduction

0 references

Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve

0 references

Faster squaring in the cyclotomic subgroup of sixth degree extensions

0 references

Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)

0 references

The Eta Pairing Revisited

0 references

Solving a 676-bit discrete logarithm problem in $\text{GF}(3^{6n})$

0 references

Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree

0 references

Q4737504

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 Function Field Sieve in the Medium Prime Case

0 references

The Number Field Sieve in the Medium Prime Case

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

Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms

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

Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field

0 references

0 references

0 references

0 references

0 references

The Weil pairing, and its efficient calculation

0 references

Q2757235

0 references

Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography

0 references

Q3840157

0 references

New Software Speed Records for Cryptographic Pairings

0 references

The multiple number field sieve with conjugation and generalized Joux-Lercier methods

0 references

Fast Hashing to G 2 on Pairing-Friendly Curves

0 references

Discrete logarithms and local units

0 references

Using number fields to compute logarithms in finite fields

0 references

The number field sieve for integers of low weight

0 references

Special prime numbers and discrete logs in finite prime fields

0 references

Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case

0 references

A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm

0 references

New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields

0 references

Efficient pairings and ECC for embedded systems

0 references

Optimal Pairings

0 references

Solving sparse linear equations over finite fields

0 references

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

0 references

Analysis of optimum pairing products at high security levels

0 references

Identifiers

zbMATH Open document ID

1435.94122

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S00145-018-9280-5

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2010589