Updating key size estimations for pairings (Q2010589)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Updating key size estimations for pairings	scientific article

Statements

scholarly article

0 references

Updating key size estimations for pairings (English)

0 references

Razvan Barbulescu

0 references

Sylvain Duquesne

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

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

0 references

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

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

0 references

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

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

0 references

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

0 references

Collecting relations for the number field sieve in

0 references

Breaking ‘128-bit Secure’ Supersingular Binary Curves

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 GF(36n )

0 references

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

0 references

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

Point Decomposition Problem in Binary Elliptic Curves

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

0 references

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

0 references

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

0 references

10.1007/s00145-018-9280-5

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2010589

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