On computing logarithms over GF(2**p)

DOI10.1007/BF01941467zbMath0493.12023MaRDI QIDQ1168369

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) Communication, information (94A99) Polynomials over finite fields (11T06) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items

Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N, Probabilistic Analysis and Performance Modelling of the ‘Swedish’ Algorithm and Modifications, Improving the Security of Exponential Key Exchange

Cites Work

• New directions in cryptography
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Unnamed Item