计算机应用研究2017，Vol.34Issue(10)：2946-2949,4.DOI:10.3969/j.issn.1001-3695.2017.10.015
并行BKZ算法
Parallel BKZ algorithm
摘要
Abstract
The best lattice basis reduction algorithm known in practice for high dimensions is Schnorr-Euchner's BKZ.All security estimates of lattice cryptosystems are based on NTL's implementation of BKZ.With the increase of dimension,the time cost of lattice basis reduction algorithms will increase rapidly.Recent progress on lattice enumeration suggests that BKZ and NTL implementation are no longer optimal,but the precise impact on security estimates is unclear.To evaluate the effect with the parallel technology of BKZ is a better method.In order to reduce the running time of lattice basis reduction,this paper proposed an efficient parallel algorithm to simulate the behavior of BKZ in high dimension with high block size ≥50,which could predict approximately both the output quality and the running time.关键词
格基规约/BKZ/NTL/并行技术Key words
lattice basis reduction/BKZ/NTL/parallel technology分类
信息技术与安全科学引用本文复制引用
陈辉焱,刘乐,杨毅..并行BKZ算法[J].计算机应用研究,2017,34(10):2946-2949,4.基金项目
北京电子科技学院信息安全重点实验室开放基金资助项目(2014KF-chy) （2014KF-chy）
