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

DOI10.1007/978-3-319-69453-5_30zbMath1418.11159arXiv1605.07746OpenAlexW2963925737MaRDI QIDQ1698673

Emmanuel Thomé, François Morain, Aurore Guillevic

Publication date: 16 February 2018

Full work available at URL: https://arxiv.org/abs/1605.07746

zbMATH Keywords

finite fielddiscrete logarithmnumber field sieveMNT elliptic curve

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (2)

Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree ⋮ Updating key size estimations for pairings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• HT90 and ``simplest number fields
• Building curves with arbitrary small MOV degree over finite prime fields
• Bounds for resultants of univariate and bivariate polynomials
• Function field sieve method for discrete logarithms over finite fields
• A taxonomy of pairing-friendly elliptic curves
• Ordinary Abelian varieties having small embedding degree
• Elliptic curves suitable for pairing based cryptography
• An Implementation of the Number Field Sieve
• The Tower Number Field Sieve
• Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
• New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
• Nearly sparse linear algebra and application to discrete logarithms computations
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• Breaking ‘128-bit Secure’ Supersingular Binary Curves
• Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
• Collecting relations for the number field sieve in
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• Discrete logarithms and local units
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Reducing elliptic curve logarithms to logarithms in a finite field
• Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
• Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Pairing-Friendly Elliptic Curves of Prime Order
• Advances in Elliptic Curve Cryptography
• Virtual logarithms
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
• The Number Field Sieve in the Medium Prime Case
• Public Key Cryptography - PKC 2006
• Algorithmic Number Theory

This page was built for publication: Solving discrete logarithms on a 170-bit MNT curve by pairing reduction