scientific article; zbMATH DE number 1795243

MaRDI QIDQ4550667zbMATH OpenFDO

Authors Andreas Enge

Publication date 3 September 2002

zbMATH Keywords

computation of logarithmsfinite class groupsprobabilistic algorithmsubexponential running time

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• A general framework for subexponential discrete logarithm algorithms
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• Structure computation and discrete logarithms in finite abelian \(p\)-groups
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
• Algebraic groups and discrete logarithm

Cited in

(5)

• A general framework for subexponential discrete logarithm algorithms
• A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups
• The arithmetic of Jacobian groups of superelliptic cubics
• Public Key Cryptography - PKC 2005
• The One-More Discrete Logarithm Assumption in the Generic Group Model

This page was built for publication:

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