Solving Discrete Logarithms from Partial Knowledge of the Key

DOI10.1007/978-3-540-77026-8_17zbMath1153.94383OpenAlexW1852155050MaRDI QIDQ5458212

Nicolas Thériault, Chui Zhi Yao, K. Gopalakrishnan

Publication date: 11 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77026-8_17

zbMATH Keywords

Discrete Logarithm ProblemGeneric GroupsSide Channel Attacks

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity ⋮ Indistinguishable Proofs of Work or Knowledge ⋮ Attacking embedded ECC implementations through CMOV side channels ⋮ Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates ⋮ Computing discrete logarithms in an interval ⋮ Computing Interval Discrete Logarithm Problem with Restricted Jump Method

This page was built for publication: Solving Discrete Logarithms from Partial Knowledge of the Key