Cryptographic primitive based on lattice problems

• Project/Area Number: 25330152
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Multi-year Fund
• Section: 一般
• Research Field: Information security
• Research Institution: Kansai University
• Principal Investigator: Kuwakado Hidenori 関西大学, 総合情報学部, 教授 (30283914)
• Co-Investigator(Kenkyū-buntansha): HIROSE Shoichi 福井大学, 大学院工学研究科, 教授 (20228836)
• Project Period (FY): 2013-04-01 – 2016-03-31
• Project Status: Completed (Fiscal Year 2015)
• Budget Amount: ¥4,940,000 (Direct Cost: ¥3,800,000、Indirect Cost: ¥1,140,000); Fiscal Year 2015: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000); Fiscal Year 2014: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000); Fiscal Year 2013: ¥2,600,000 (Direct Cost: ¥2,000,000、Indirect Cost: ¥600,000)
• Keywords: 暗号 / 格子 / 安全性 / 最短ベクトル問題 / 復号問題 / ハッシュ関数 / nearest-neighbor問題

Outline of Final Research Achievements

The Ajtai-GGH function and the SWIFFT function are better than usual hash functions because the preimage resistance and the collision resistance can be reduced to the difficulty of lattice problems. We first investigated the reduction technique used in proofs of these functions and the fast implementation technique of the SWIFFT function. We next proposed a Merkle-Damgaard hash function with a message preprocessing that is based on the Ajtai-GGH function. We studied its collision resistance and the indifferentiability from a random oracle and performed computer experiments for measuring the performance.

Research Products

• [Journal Article] A Note on the May-Ozerov Algorithm for the Nearest Neighbor Problem over Any Finite Field (2016)
  • Author(s): Shoichi Hirose
  • Journal Title: 2016年暗号と情報セキュリティシンポジウム Volume: 1D2-5 Pages: 1-7
  • Acknowledgement Compliant
• [Journal Article] Message Preprocessing for MD Hash Functions (2016)
  • Author(s): Hidenori Kuwakado, Shoichi Hirose
  • Journal Title: IEICE Technical Report Volume: 115 Pages: 89-93
  • Acknowledgement Compliant
• [Journal Article] May-Ozerov Algorithm for Nearest-Neighbor Problem over Fq and Its Application to Information Set Decoding (2016)
  • Author(s): Shoichi Hirose
  • Journal Title: Cryptology ePrint Archive Volume: 2016/237 Pages: 1-13
  • Open Access / Acknowledgement Compliant
• [Journal Article] Arithmetic in a Prime Field of SWIFFT/SWIFFTX (2015)
  • Author(s): Hidenori Kuwakado
  • Journal Title: IEICE Technical Report Volume: 114 Pages: 149-152
  • NAID: 110010017752
  • Acknowledgement Compliant
• [Presentation] May-Ozerov Algorithm for Nearest Neighbor Problem over Fq and its Application to Information Set Decoding (2016)
  • Author(s): Shoichi Hirose
  • Organizer: PQCrypto 2016, Hot Topic Session
  • Place of Presentation: 九州大学西新プラザ（福岡県，日本）
  • Year and Date: 2016-02-16
  • Int'l Joint Research