Probabilistic analysis and performance modelling of the `Swedish' algorithm and modifications

DOI10.1007/978-1-4684-4730-9_21MaRDI QIDQ5019337zbMATH OpenOpenAlexFDO

Authors Joel E. Sachs, Shimshon Berkovits

Publication date 8 January 2022

Published in Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4684-4730-9_21

zbMATH Keywords

discrete logarithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3882551
• Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N
• On an probabilistic algorithm solving discrete logarithm problem
• scientific article; zbMATH DE number 4035941
• On asymptotic complexity of computing discrete logarithms over GF(p)

Cites work

• On computing logarithms over GF(2**p)

This page was built for publication: Probabilistic analysis and performance modelling of the `Swedish' algorithm and modifications

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