An SVP algorithm by improving the RSR algorithm
暗号学セミナー
開催期間
2015.9.14(月)
10:00 ~ 10:45
10:00 ~ 10:45
場所
九州大学 伊都キャンパス 数理学研究教育棟／マス・フォア・インダストリ研究所B1 中会議室(122号)
講演者
Kenji Kashiwabara (University of Tokyo)
概要
An integral lattice consists of all the integral combinations of independent integral vectors in the N-dimensional linear space. The Shortest Vector Problem(SVP) is the problem of finding the nonzero shortest vector for a given integral lattice. Kashiwabara and Teruya have developed an SVP algorithm by improving the RSR algorithm. We succeeded in finding a short vector of dimension 144 in SVP challenge
(
http://www.latticechallenge.org/svp-challenge/
)