On computing logarithms over GF(2**p)

DOI10.1007/BF01941467MaRDI QIDQ1168369zbMATH OpenFDO

Authors Tore Herlestam, Rolf Johannesson

Publication date 1981

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

finite fieldpublic key distribution system21, 326-334 (1981)evaluating logarithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06) Communication, information (94A99) Software, source code, etc. for problems pertaining to field theory (12-04)

Recommendations

• scientific article; zbMATH DE number 3918261
• Computing Logarithms in Finite Fields of Characteristic Two
• Fast evaluation of logarithms in fields of characteristic two
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• On Computing Logarithms Over Finite Fields

Cites work

• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• New directions in cryptography

Cited in

(10)

• Construction of logarithm tables for Galois fields
• scientific article; zbMATH DE number 3882551 (Why is no real title available?)
• scientific article; zbMATH DE number 3918261 (Why is no real title available?)
• Improving the security of exponential key exchange
• A polynomial form for logarithms modulo a prime (Corresp.)
• Fast evaluation of logarithms in fields of characteristic two
• scientific article; zbMATH DE number 4035941 (Why is no real title available?)
• Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N
• A polynomial representation for logarithms in GF(q)
• Probabilistic analysis and performance modelling of the `Swedish' algorithm and modifications

This page was built for publication: On computing logarithms over GF(2**p)

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