A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms

DOI10.1007/BF01270401zbMath0769.94010OpenAlexW1492653595MaRDI QIDQ1803561

Ly J. A. Thiong

Publication date: 29 June 1993

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

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

zbMATH Keywords

cyclic groupdiscrete logarithmsmixed radix representationPohlig- Hellman algorithm

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Fast evaluation of logarithms in fields of characteristic two
• Computing Logarithms in Finite 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: A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms