Solving DLP with auxiliary input over an elliptic curve used in TinyTate library

Y Sakemi, T Izu, M Takenaka, M Yasuda - … , Crete, Greece, June 1-3, 2011 …, 2011 - Springer
The discrete logarithm problem with auxiliary input (DLPwAI) is a problem to find α from G,
αG, α d G 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 …

[CITATION][C] Solving DLP with auxiliary input over an elliptic curve used in TinyTate library (part 2)

酒見由美, 伊豆哲也, 武仲正彦 - 電子情報通信学会技術研究報告= IEICE …, 2011 - cir.nii.ac.jp
Solving DLP with auxiliary input over an elliptic curve used in TinyTate library (part 2) | CiNii
Research … Solving DLP with auxiliary input over an elliptic curve used in TinyTate library part
2 TinyTateライブラリが使用する楕円曲線における補助入力付き離散対数問題の解読報告(その2) …
Showing the best results for this search. See all results