Groups from cyclic infrastructures and Pohlig-Hellman in certain infrastructures

DOI10.3934/AMC.2008.2.293MaRDI QIDQ629772zbMATH OpenOpenAlexFDO

Authors Felix Fontein

Publication date 10 March 2011

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/amc.2008.2.293

zbMATH Keywords

cryptographyfunction fieldsPohlig-Hellmaninfrastructures

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Computational aspects of algebraic curves (14Q05) Computational number theory (11Y99) Special algebraic curves and curves of low genus (14H45)

Recommendations

• A note on cyclic groups, finite fields, and the discrete logarithm problem
• Elementary thoughts on discrete logarithms
• scientific article; zbMATH DE number 1500484
• A general framework for subexponential discrete logarithm algorithms
• A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms

Cited in

(4)

• The infrastructure of a global field of arbitrary unit rank
• Comparison of scalar multiplication on real hyperelliptic curves
• Cryptographic aspects of real hyperelliptic curves
• Soficity, short cycles, and the Higman group

This page was built for publication: Groups from cyclic infrastructures and Pohlig-Hellman in certain infrastructures

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