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

DOI10.1007/BF01270401MaRDI QIDQ1803561zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The Pohlig-Hellman method generalized for group structure computation
• Structure computation and discrete logarithms in finite abelian \(p\)-groups
• scientific article; zbMATH DE number 1303121
• scientific article; zbMATH DE number 1113850
• Computing discrete logarithms with the parallelized kangaroo method.

Cites work

• scientific article; zbMATH DE number 3986611 (Why is no real title available?)
• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• scientific article; zbMATH DE number 4057589 (Why is no real title available?)
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Computing Logarithms in Finite Fields of Characteristic Two
• Fast evaluation of logarithms in fields of characteristic two
• New directions in cryptography

Cited in

(3)

• Groups from cyclic infrastructures and Pohlig-Hellman in certain infrastructures
• scientific article; zbMATH DE number 7310208 (Why is no real title available?)
• An iterative method based on Pohlig-Hellman and Pollard \(\rho \) for computing discrete logarithm

This page was built for publication: A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms

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