Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N

DOI10.1007/BF01934386zbMath0567.12012OpenAlexW2052013517MaRDI QIDQ1059674

Shimshon Berkovits, Joel E. Sachs

Publication date: 1985

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934386

zbMATH Keywords

complexityHerlestam-Johannesson algorithmlogarithms over finite fieldspublic key distribution system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06)

Cites Work

• On computing logarithms over GF(2**p)
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N