Solving Discrete Logarithms from Partial Knowledge of the Key
From MaRDI portal
Publication:5458212
DOI10.1007/978-3-540-77026-8_17zbMath1153.94383MaRDI 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
94A60: Cryptography
Related Items
Computing discrete logarithms in an interval, Computing Interval Discrete Logarithm Problem with Restricted Jump Method, Attacking embedded ECC implementations through CMOV side channels, A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity, Indistinguishable Proofs of Work or Knowledge, Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates