ON BOUNDS FOR BALANCED EMBEDDING DEGREE

DOI10.17223/20710410/32/5zbMath1490.14045OpenAlexW2461549630MaRDI QIDQ5150737

S. A. Novoselov

Publication date: 15 February 2021

Published in: Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm546

zbMATH Keywords

discrete logarithm problempairingshyperelliptic curve cryptographyembedding degree

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
• Constructive and destructive facets of Weil descent on elliptic curves
• The Weil pairing, and its efficient calculation
• On the Lambert \(w\) function
• Improved agreeing-gluing algorithm
• A taxonomy of pairing-friendly elliptic curves
• An \(L(1/3)\) discrete logarithm algorithm for low degree curves
• Constructing pairing-friendly hyperelliptic curves using Weil restriction
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
• A general framework for subexponential discrete logarithm algorithms
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• Constructing Pairing-Friendly Genus 2 Curves with Split Jacobian
• The multiple number field sieve for medium- and high-characteristic finite fields
• The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
• Computing Discrete Logarithms in $${\mathbb F}_{3^{6 \cdot 137}}$$ and $${\mathbb F}_{3^{6 \cdot 163}}$$ Using Magma
• A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
• Pairings on hyperelliptic curves
• Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves
• On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
• A double large prime variation for small genus hyperelliptic index calculus
• Abelian Varieties with Prescribed Embedding Degree
• A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
• Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
• Aspects of Pairing Inversion
• Computing in the Jacobian of a Hyperelliptic Curve
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Monte Carlo Methods for Index Computation (mod p)
• 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
• The Past, Evolving Present, and Future of the Discrete Logarithm
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Hyperelliptic Pairings
• Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
• On the Minimal Embedding Field
• Advances in Elliptic Curve Cryptography
• Selecting cryptographic key sizes

This page was built for publication: ON BOUNDS FOR BALANCED EMBEDDING DEGREE