你即將離開本站

並前往https://eprint.iacr.org/2014/637.pdf

Generic Hardness of the Multiple Discrete Logarithm Problem

'Generic hardness' of a cryptographic problem, that is, hardness against such generic algorithms, was studied for many group-based cryptographic problems. While ...

確定！ 回上一頁

查詢 「Generic problem」的人也找了：

  1. Life problem
    2.
  2. Type of problem
    3.
  3. generic meaning
    4.