Computing Discrete Logarithms in $${\mathbb F}_{3^{6 \cdot 137}}$$ and $${\mathbb F}_{3^{6 \cdot 163}}$$ Using Magma
From MaRDI portal
Publication:2949468
DOI10.1007/978-3-319-16277-5_1zbMath1400.11161MaRDI QIDQ2949468
Francisco Rodríguez-Henríquez, Thomaz Oliveira, Gora Adj, Alfred J. Menezes
Publication date: 1 October 2015
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16277-5_1
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
Related Items
Faster individual discrete logarithms in finite fields of composite extension degree, ON BOUNDS FOR BALANCED EMBEDDING DEGREE, Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\), Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity, Smoothness test for polynomials defined over small characteristic finite fields, Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields, Indiscreet logarithms in finite fields of small characteristic, Dynamic universal accumulator with batch update over bilinear groups, Faster initial splitting for small characteristic composite extension degree fields, Still wrong use of pairings in cryptography, Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
Uses Software