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

DOI10.3934/AMC.2020119zbMATH Open1506.11153OpenAlexW3092018740MaRDI QIDQ2158232FDOQ2158232

Authors: 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

Recommendations

• The Number Field Sieve in the Medium Prime Case
• The Function Field Sieve in the Medium Prime Case
• On the function field sieve and the impact of higher splitting probabilities. Application to discrete logarithms in \(\mathbb{F}_{2^{1971}}\) and \(\mathbb{F}_{2^{3164}}\)
• scientific article; zbMATH DE number 2086903
• scientific article; zbMATH DE number 799769

zbMATH Keywords

discrete logarithmfinite fieldfunction field sieve

Mathematics Subject Classification ID

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

Cites Work

• On the function field sieve and the impact of higher splitting probabilities. Application to discrete logarithms in \(\mathbb{F}_{2^{1971}}\) and \(\mathbb{F}_{2^{3164}}\)
• New directions in cryptography
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))
• Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields
• Algorithmic Cryptanalysis
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
• Fast evaluation of logarithms in fields of characteristic two
• 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
• Title not available (Why is that?)
• The Function Field Sieve in the Medium Prime Case
• Title not available (Why is that?)
• Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment

Cited In (10)

• Title not available (Why is that?)
• The Number Field Sieve in the Medium Prime Case
• On the function field sieve and the impact of higher splitting probabilities. Application to discrete logarithms in \(\mathbb{F}_{2^{1971}}\) and \(\mathbb{F}_{2^{3164}}\)
• Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
• The multiple number field sieve for medium- and high-characteristic finite fields
• Individual discrete logarithm with sublattice reduction
• The Function Field Sieve in the Medium Prime Case
• Discrete logarithm in \(\mathrm{GF}(2^{809})\) with FFS
• Cryptography and Coding
• Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158232)