一种基于格理论的数字签名方案  

A Digital Signature Algorithm Based on Lattice Theory

作　　者：张文芳[1] 余位驰[1] 何大可[2] 王小敏[3] 

机构地区：[1]现代通信国家重点实验室,成都610041 [2]西南交通大学信息安全与国家计算网格省重点实验室,成都610031 [3]西南交通大学计算机与通信工程学院,成都610031

出　　处：《计算机科学》2006年第3期93-96,共4页Computer Science

基　　金：现代通信国家重点实验室基金(No:51436010202QT2201)

摘　　要：本文介绍了一种建立在解决 NTRU 格(NTRU Lattice)中近似最近向量问题(Appr-CVP)基础上的数字签名方案。与现有的基于解决 Appr-CVP 问题的数字签名方案相比,这种新的数字签名方案通过构造完整的短格基进行签名,在签名与近似最近向量问题之间建立了直接而清晰的关系,因此不需引入任何附加结构,具有更高的安全性。同时,该签名方案引入了适当的扰动,有效地限制了攻击者通过分析大量签名副本所获取的有用信息,具有副本分析免疫性。实验结果表明:该方案不仅安全可靠,而且易于实现。A digital signature algorithm based on solving the approximate closest vector problem（Appr-CVP）in NTRU- type lattice is proposed in this paper. Superior to the general Appr-CVP based signature schemes which aid some additional structure to make an incomplete linking with Appr-CVP, this new scheme builds a direct and straightforward linkage between signatures and the Appr-CVP in the underlying NTRU lattice through construction of a full short lattice basis, and so is much more safer. At the same time, by introducing carefully chosen perturbations, this new signature scheme can effectiv.ely limit the information that is obtainable from an analysis of a large signature transcript so as to be immune to transcript attacks. Research results show that this new digital signature scheme not only has better security properties, but also can be easily implemented.

关 键 词：格 数论研究组 数字签名 近似最近向量问题 短格基 

分 类 号：TP309.8[自动化与计算机技术—计算机系统结构] TN918.1[自动化与计算机技术—计算机科学与技术]