An algorithm for evaluation of discrete logarithms in some nonprime finite fields

DOI10.1090/S0025-5718-98-00969-7zbMath0922.11106OpenAlexW2045906364MaRDI QIDQ4210964

I. A. Semaev

Publication date: 10 September 1998

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-98-00969-7

zbMATH Keywords

finite fieldscryptographydiscrete logarithms

Mathematics Subject Classification ID

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

Related Items (2)

Modular hyperbolas ⋮ Distribution of modular inverses and multiples of small integers and the Sato-Tate conjecture on average

Cites Work

• Number of small solutions of a homogeneous linear congruence
• Fast evaluation of logarithms in fields of characteristic two
• New directions in cryptography
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for evaluation of discrete logarithms in some nonprime finite fields