scientific article; zbMATH DE number 4035941

MaRDI QIDQ3775635zbMATH OpenFDO

Authors Bernard Smeets

Publication date 1987

zbMATH Keywords

computing logarithmsdiscrete logarithmsfinite fieldHamming weightHerlestam-Johannesson algorithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 3882551
• Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N
• scientific article; zbMATH DE number 3918261
• Computing Logarithms in Finite Fields of Characteristic Two
• On computing logarithms over GF(2**p)

Cited in

(4)

• Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N
• On the number of polynomials over \(\mathrm{GF}(2)\) that factor into \(2, 3\) or \(4\) prime polynomials
• scientific article; zbMATH DE number 3882551 (Why is no real title available?)
• Probabilistic analysis and performance modelling of the `Swedish' algorithm and modifications

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