Lazy Random Walk Efficient for Pollard’s Rho Methoｄ Attacking on G3 over Barreto-Naehrig Curve (Corrected)

• Nekado Kenta

• Takai Yusuke

• Nogami Yasuyuki

抄録

Pairing–based cryptosystems are well implemented with Ate–type pairing over Barreto–Naehrig (BN) curve. Then, for instance, their securities depend on the difficulty of Discrete Logarithm Problem (DLP) on the so–denoted G3 over BN curve. This paper, in order to faster solve the DLP, first proposes to utilize Gauss period Normal Basis (GNB) for Pollard’s rho method, and then considers to accelerate the solving by an adoption of lazy random walk, namely tag tracing technique proposed by Cheon et al.

収録刊行物

• Memoirs of the Faculty of Engineering, Okayama University

  Memoirs of the Faculty of Engineering, Okayama University 47 25-32, 2013-01

  Faculty of Engineering, Okayama University

詳細情報

• CRID: 1390290699799546624
• NII論文ID: 120005232374
• NII書誌ID: AA12014085
• ISSN: 13496115
• DOI: 10.18926/49322
• NDL書誌ID: 025619210
• Web Site: https://ousar.lib.okayama-u.ac.jp/49322
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I025619210
• 本文言語コード: en
• データソース種別:
  • JaLC
  • IRDB
  • NDL
  • CiNii Articles