A fully-constructive discrete-logarithm preprocessing algorithm with an optimal time-space tradeoff

DOI10.4230/LIPICS.ITC.2022.12MaRDI QIDQ6561693zbMATH OpenFDO

Authors Lior Rotem, Gil Segev

Publication date 25 June 2024

zbMATH Keywords

discrete logarithmpreprocessing

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The Discrete Logarithm problem with preprocessing
• On the distributed discrete logarithm problem with preprocessing
• Analysis of possible pre-computation aided DLP solving algorithms
• The query-complexity of preprocessing attacks
• Discrete logarithm problems with auxiliary inputs

Cited in

(1)

• On the distributed discrete logarithm problem with preprocessing

This page was built for publication: A fully-constructive discrete-logarithm preprocessing algorithm with an optimal time-space tradeoff

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