Analysis of possible pre-computation aided DLP solving algorithms

DOI10.4134/JKMS.2015.52.4.797MaRDI QIDQ2950270zbMATH OpenFDO

Authors Jin Hong, Hyeonmi Lee

Publication date 8 October 2015

Published in Journal of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL http://mathnet.or.kr/mathnet/kms_content.php?no=413362

zbMATH Keywords

discrete logarithm problemdistinguished pointpre-computationtime memory tradeoff

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Discrete mathematics in relation to computer science (68R99) Cryptography (94A60)

Recommendations

• Solving discrete logarithm problems faster with the aid of pre-computation
• The Discrete Logarithm problem with preprocessing
• Computing small discrete logarithms faster
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• On the Discrete Logarithm Problem on Algebraic Tori

Cited in

(6)

• The Discrete Logarithm problem with preprocessing
• Solving discrete logarithm problems faster with the aid of pre-computation
• Computing small discrete logarithms faster
• Solving a 6120 -bit DLP on a Desktop Computer
• A fully-constructive discrete-logarithm preprocessing algorithm with an optimal time-space tradeoff
• Recent progress on the elliptic curve discrete logarithm problem

This page was built for publication: Analysis of possible pre-computation aided DLP solving algorithms

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