Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order

DOI10.1007/s10114-005-0632-3zbMath1111.14016OpenAlexW2356201742MaRDI QIDQ2505361

Liang Liang Xiao, Junquan Li, Mu-Lan Liu

Publication date: 4 October 2006

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-005-0632-3

zbMATH Keywords

distinguished pointPollard's rho methodparallel collision search algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60) Elliptic curves over global fields (11G05) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Probability to meet in the middle
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• Parallel collision search with cryptanalytic applications
• The discrete logarithm problem on elliptic curves of trace one
• Monte Carlo Methods for Index Computation (mod p)
• Reducing elliptic curve logarithms to logarithms in a finite field
• Unnamed Item
• Unnamed Item