Art

J-GLOBAL ID：201202255137140905   Reference number：12A1166383

Finding a Very Short Lattice Vector in the Extended Search Space

拡張検索空間において非常に短い格子ベクトルを見つけること

Author (2)： FUKASE Masaharu (Dokkyo Univ.) ,  YAMAGUCHI Kazunori (The Univ. of Tokyo)
Material： Journal of Information Processing (Web)  (J Inf Proc (Web))
Volume： 20  Issue： 3  Page： 785-795 (J-STAGE)  Publication year： 2012 
JST Material Number： U0109A  ISSN： 1882-6652  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *lattice ,  cryptography key ,  scale down ,  *retrieval ,  dimension ,  cryptogram ,  *vector (mathematics)
Semi thesaurus term： lattice basis reduce ,  secret key

JST classification (1)： Theory of computation  (JB02000A)

Reference (19)：

• [1] Ajtai, M. and Dwork, C.: A Public-Key Cryptosystem with worst-case/average-case equivalence, Proc. 29th STOC, pp.284-293 (1997).
• [2] Ajtai, M.: The Shortest Vector Problem in L₂ is NP-hard for Randomized Reductions (Extended Abstract), Proc. Thirtieth Annual ACM Symposium on Theory of Computing, pp.10-19 (1998).
• [3] Dagdelen, Ö. and Schneider, M.: Parallel Enumeration of Shortest Lattice Vectors, Euro-Par 2010, Vol.6272 of LNCS, pp.211-222 (2010).
• [4] Fukase, M. and Yamaguchi, K.: The Analysis of ESS for the Shortest Vector in Lattice, Proc. SICT 2010, pp.209-213 (2010).
• [5] Fukase, M. and Yamaguchi, K.: Exhaustive Search for Finding a Very Short Vector in High-Dimensional Lattices, Proc. (short papers) IWSEC 2010, pp.26-41 (2010).

Terms in the title (4)： 拡張 ,  検索 ,  格子 ,  ベクトル