Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 14:50, 30 December 2024

scientific article; zbMATH DE number 7009722

Language	Label	Description	Also known as
English	Faster individual discrete logarithms in finite fields of composite extension degree	scientific article; zbMATH DE number 7009722

Statements

scholarly article

0 references

Faster individual discrete logarithms in finite fields of composite extension degree (English)

0 references

Aurore Guillevic

0 references

Mathematics of Computation

0 references

publication date

31 January 2019

0 references

full work available at URL

https://arxiv.org/abs/1809.06135

0 references

zbMATH Keywords

finite field

0 references

discrete logarithm

0 references

number field sieve

0 references

function field sieve

0 references

individual logarithm

0 references

MaRDI profile type

0 references

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

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 509}}$ for Discrete Logarithm Cryptography

0 references

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

0 references

0 references

Function field sieve method for discrete logarithms over finite fields

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

Computing Logarithms in Finite Fields of Characteristic Two

0 references

Public Key Cryptography - PKC 2006

0 references

Discrete logarithms in \(\mathrm{GF}(p)\)

0 references

New directions in cryptography

0 references

A rigorous proof of the Waterloo algorithm for the discrete logarithm problem

0 references

The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields

0 references

A Kilobit Hidden SNFS Discrete Logarithm Computation

0 references

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

0 references

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

0 references

Breaking ‘128-bit Secure’ Supersingular Binary Curves

0 references

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

0 references

Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm

0 references

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

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

0 references

Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms

0 references

The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$

0 references

0 references

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

0 references

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

0 references

Computation of a 768-Bit Prime Field Discrete Logarithm

0 references

Computation of discrete logarithms in prime fields

0 references

Factoring polynomials with rational coefficients

0 references

0 references

A hyperelliptic smoothness test. I

0 references

A Hyperelliptic Smoothness Test, II

0 references

0 references

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

Discrete logarithms and local units

0 references

Practical Cryptography in High Dimensional Tori

0 references

Advances in Cryptology – CRYPTO 2004

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1090/MCOM/3376

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4612570

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