Abstract
The discrete logarithm problem with auxiliary input (DLPwAI) is a problem to find α from G, αG, α dG in an additive cyclic group generated by G of prime order r and a positive integer d dividing r-1. The infeasibility of DLPwAI assures the security of some cryptographic schemes. In 2006, Cheon proposed a novel algorithm for solving DLPwAI. This paper shows our experimental results of Cheon's algorithm by implementing it with some speeding-up techniques. In fact, we succeeded to solve DLPwAI in a group with 128-bit order in 45 hours with a single PC on an elliptic curve defined over a prime finite field with 256-bit elements which is used in the TinyTate library. © 2011 IFIP International Federation for Information Processing.
Cite
CITATION STYLE
Sakemi, Y., Izu, T., Takenaka, M., & Yasuda, M. (2011). Solving DLP with auxiliary input over an elliptic curve used in TinyTate library. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6633 LNCS, pp. 116–127). https://doi.org/10.1007/978-3-642-21040-2_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
