Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
type: Item
instance of: scholarly article
title: Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
zbMATH Open document ID: 1402.94049
author: Gora Adj
author: Isaac Canales-Martínez
author: Nareli Cruz-Cortés
author: Thomaz Oliveira
author: Luis Rivera-Zamarripa
author: Francisco Rodríguez-Henríquez
author: Alfred Menezes
published in: Advances in Mathematics of Communications
publication date: 2018-11-15T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11Y16
zbMATH DE Number: 6979630
zbMATH Keywords: discrete logarithm problem
zbMATH Keywords: finite fields
zbMATH Keywords: pairing-based cryptography
describes a project that uses: Maple
describes a project that uses: Magma
MaRDI profile type: Publication
full work available at URL: amc.2018044
OpenAlex ID: W2893614166
cites work: Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
cites work: Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
cites work: Computing Discrete Logarithms in $${\mathbb F}_{3^{6 \cdot 137}}$$ and $${\mathbb F}_{3^{6 \cdot 163}}$$ Using Magma
cites work: A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
cites work: Efficient pairing computation on supersingular abelian varieties
cites work: Q4409129
cites work: Computing Logarithms in Finite Fields of Characteristic Two
cites work: Q4783728
cites work: Short signatures from the Weil pairing
cites work: Fast evaluation of logarithms in fields of characteristic two
cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
cites work: Q4474195
cites work: Q4737495
cites work: On the Function Field Sieve and the Impact of Higher Splitting Probabilities
cites work: Solving a $$6120$$ -bit DLP on a Desktop Computer
cites work: Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
cites work: Breaking ‘128-bit Secure’ Supersingular Binary Curves
cites work: On the discrete logarithm problem in finite fields of fixed characteristic
cites work: A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
cites work: The Function Field Sieve in the Medium Prime Case
cites work: Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
cites work: Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
cites work: Counting irreducible factors of polynomials over a finite field
cites work: Q4474166
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
cites work: Discrete logarithms and local units
cites work: Solving sparse linear equations over finite fields
Wikidata QID: Q129186783
DOI: 10.3934/AMC.2018044
description: scientific article; zbMATH DE number 6979630