New discrete logarithm computation for the medium prime case using the function field sieve

DOI10.3934/amc.2020119zbMath1506.11153OpenAlexW3092018740MaRDI QIDQ2158232

Yanyan Li

Publication date: 26 July 2022

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2020119

zbMATH Keywords

finite fielddiscrete logarithmfunction field sieve

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (1)

Individual discrete logarithm with sublattice reduction

Cites Work

• Unnamed Item
• Unnamed Item
• Selected areas in cryptography -- SAC 2013. 20th international conference, Burnaby, BC, Canada, August 14--16, 2013. Revised selected papers
• Function field sieve method for discrete logarithms over finite fields
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
• On the Function Field Sieve and the Impact of Higher Splitting Probabilities
• Breaking ‘128-bit Secure’ Supersingular Binary Curves
• Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
• Fast evaluation of logarithms in fields of characteristic two
• The Function Field Sieve in the Medium Prime Case
• New directions in cryptography
• Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
• Algorithmic Cryptanalysis
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic

This page was built for publication: New discrete logarithm computation for the medium prime case using the function field sieve