| Presentation | 2017-07-14 Report of solving SVP's by using DeepLLL Junpei Yamaguchi, Masaya Yasuda, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Lattice-based cryptography is based on the computational herdbess of lattice problems such as Shortest vector problem (SVP) and Closest vector problem (CVP). Lattice basis reduction algorithm have been used as a good tool for cryptoanalysis. The most famous one is LLL algorithm, LLL algorithm with deep insertions (DeepLLL) and BKZ are its improvement. In this paper, we give the speeding-up method of DeepLLL. And then, we propose the DeepBKZ algorithm which is combined DeepLLL and BKZ, and we show its superiority by the comparison with BKZ and new records of Darmstadt SVP challenge. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Lattice / Shortest vector problem (SVP) / lattice reduction / DeepLLL / BKZ / Darmstadt SVP Challenge |
| Paper # | ISEC2017-23,SITE2017-15,ICSS2017-22,EMM2017-26 |
| Date of Issue | 2017-07-07 (ISEC, SITE, ICSS, EMM) |
| Conference Information | |
| Committee | SITE / EMM / ISEC / ICSS / IPSJ-CSEC / IPSJ-SPT |
|---|---|
| Conference Date | 2017/7/14(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Hitoshi Okada(NII) / Keiichi Iwamura(TUC) / Kazuto Ogawa(NHK) / Yoshiaki Shiraishi(Kobe Univ.) |
| Vice Chair | Tetsuya Morizumi(Kanagawa Univ.) / Masaru Ogawa(Kobe Gakuin Univ.) / Hirohisa Hioki(Kyoto Univ.) / Minoru Kuribayashi(Okayama Univ.) / Atsushi Fujioka(Kanagawa Univ.) / Shiho Moriai(NICT) / Takeshi Ueda(Mitsubishi Electric) / Hiroki Takakura(NII) |
| Secretary | Tetsuya Morizumi(Gifu Shotoku Gakuen Univ.) / Masaru Ogawa(Tokyo Univ. of the Arts) / Hirohisa Hioki(Shizuoka Univ.) / Minoru Kuribayashi(Tokyo Metropolitan Univ.) / Atsushi Fujioka(Tohoku Univ.) / Shiho Moriai(Tokai Univ.) / Takeshi Ueda(Yokohama National Univ.) / Hiroki Takakura(NTT) |
| Assistant | Akiyoshi Kabeya(Chiba Univ.) / Hisanori Kato(KDDI) / Kan Hyonho(NIT, Tokyo) / Harumi Murata(Tyukyo Univ.) / Keita Emura(NICT) / Yuichi Komano(TOSHIBA) / Yuuji Suga(IIJ) / Takahiro Kasama(NICT) / Akira Yamada(KDDI labs.) |
| Paper Information | |
| Registration To | Technical Committee on Social Implications of Technology and Information Ethics / Technical Committee on Enriched MultiMedia / Technical Committee on Information Security / Technical Committee on Information and Communication System Security / Special Interest Group on Computer Security / Special Interest Group on Security Psychology and Trust |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Report of solving SVP's by using DeepLLL |
| Sub Title (in English) | |
| Keyword(1) | Lattice |
| Keyword(2) | Shortest vector problem (SVP) |
| Keyword(3) | lattice reduction |
| Keyword(4) | DeepLLL |
| Keyword(5) | BKZ |
| Keyword(6) | Darmstadt SVP Challenge |
| 1st Author's Name | Junpei Yamaguchi |
| 1st Author's Affiliation | Kyushu University(Kyushu Univ.) |
| 2nd Author's Name | Masaya Yasuda |
| 2nd Author's Affiliation | Kyushu University(Kyushu Univ.) |
| Date | 2017-07-14 |
| Paper # | ISEC2017-23,SITE2017-15,ICSS2017-22,EMM2017-26 |
| Volume (vol) | vol.117 |
| Number (no) | ISEC-125,SITE-126,ICSS-127,EMM-128 |
| Page | pp.pp.115-122(ISEC), pp.115-122(SITE), pp.115-122(ICSS), pp.115-122(EMM), |
| #Pages | 8 |
| Date of Issue | 2017-07-07 (ISEC, SITE, ICSS, EMM) |