ON BOUNDS FOR BALANCED EMBEDDING DEGREE (Q5150737)

scientific article; zbMATH DE number 7310339

Language	Label	Description	Also known as
English	ON BOUNDS FOR BALANCED EMBEDDING DEGREE	scientific article; zbMATH DE number 7310339

Statements

instance of

scholarly article

0 references

title

ON BOUNDS FOR BALANCED EMBEDDING DEGREE (English)

0 references

zbMATH Open document ID

1490.14045

0 references

DOI

10.17223/20710410/32/5

0 references

author

S. A. Novoselov

0 references

published in

Prikladnaya diskretnaya matematika

0 references

publication date

15 February 2021

0 references

full work available at URL

http://mathnet.ru/eng/pdm546

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

hyperelliptic curve cryptography

0 references

pairings

0 references

embedding degree

0 references

discrete logarithm problem

0 references

MaRDI profile type

MaRDI publication profile

0 references

OpenAlex ID

W2461549630

0 references

cites work

Reducing elliptic curve logarithms to logarithms in a finite field

0 references

Q2739458

0 references

Q4783728

0 references

On the Minimal Embedding Field

0 references

On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields

0 references

Aspects of Pairing Inversion

0 references

A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic

0 references

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

0 references

The Weil pairing, and its efficient calculation

0 references

A taxonomy of pairing-friendly elliptic curves

0 references

Pairings on hyperelliptic curves

0 references

Monte Carlo Methods for Index Computation (mod p)

0 references

An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)

0 references

The Past, Evolving Present, and Future of the Discrete Logarithm

0 references

Computing Discrete Logarithms in $${\mathbb F}_{3^{6 \cdot 137}}$$ and $${\mathbb F}_{3^{6 \cdot 163}}$$ Using Magma

0 references

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

0 references

Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity

0 references

The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods

0 references

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

0 references

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

0 references

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

0 references

Constructive and destructive facets of Weil descent on elliptic curves

0 references

Improved agreeing-gluing algorithm

0 references

A double large prime variation for small genus hyperelliptic index calculus

0 references

A general framework for subexponential discrete logarithm algorithms

0 references

An $L(1/3)$ discrete logarithm algorithm for low degree curves

0 references

Computing in the Jacobian of a Hyperelliptic Curve

0 references

Q4664851

0 references

Advances in Elliptic Curve Cryptography

0 references

On the Lambert $w$ function

0 references

Hyperelliptic Pairings

0 references

Q4474195

0 references

Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians

0 references

A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties

0 references

Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax

0 references

Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves

0 references

Constructing pairing-friendly hyperelliptic curves using Weil restriction

0 references

Constructing Pairing-Friendly Genus 2 Curves with Split Jacobian

0 references

Abelian Varieties with Prescribed Embedding Degree

0 references

Selecting cryptographic key sizes

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5150737