Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography

DOI10.1007/978-3-319-04873-4_2zbMath1307.94031OpenAlexW2219990189MaRDI QIDQ5746220

Francisco Rodríguez-Henríquez, Gora Adj, Thomaz Oliveira, Alfred J. Menezes

Publication date: 18 February 2014

Published in: Pairing-Based Cryptography – Pairing 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04873-4_2

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (7)

Smoothness test for polynomials defined over small characteristic finite fields ⋮ Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography ⋮ Fully Secure IBE with Tighter Reduction in Prime Order Bilinear Groups ⋮ Faster initial splitting for small characteristic composite extension degree fields

This page was built for publication: Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography