| 本文已被：浏览 11758次 下载 15916次 |
码上扫一扫！ |
| LWE问题实际安全性分析综述 |
| 毕蕾,李帅钢,刘亚敏,张江,范淑琴 |
|
|
| (中国科学院信息工程研究所, 北京 中国 100049;中国科学院大学网络空间安全学院, 北京 中国 100049;密码科学技术国家重点实验室, 北京 中国 100878) |
|
| 摘要: |
| LWE问题被广泛用于设计安全的格上密码方案。为了评估基于LWE的格密码方案在给定具体参数下的安全强度，我们需要研究目前求解LWE问题算法的复杂度。本文以Albrecht等人[33]2015年的研究工作为基础，概述了求解LWE问题的主流算法及其复杂度，并给出了针对具体LWE实例的评估结果。 |
| 关键词: 格 带错误的学习问题 安全性分析 |
| DOI：10.19363/J.cnki.cn10-1380/tn.2019.03.01 |
| 投稿时间：2018-12-10修订日期：2019-02-15 |
| 基金项目:国家自然科学基金（No.61772515）资助。 |
|
| A Survey on the Analysis of the Concrete Hardness of LWE |
| BI Lei,LI Shuaigang,LIU Yamin,ZHANG Jiang,FAN Shuqin |
| Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100049, China;School of Cyber Security, University of Chinese Academy of Sciences, Beijing 100049, China;State Key Laboratory of Cryptology, Beijing 100878, China |
| Abstract: |
| The Learning with errors (LWE) problem has been widely used in designing secure lattice-based cryptosystems.In order to assess the concrete security of LWE-based schemeswhen given the parameters,we need to investigate the current algorithms which can be used to solve LWE problem and their actual complexity.In this paper,we give a brief survey on the main LWE solving algorithms and their complexity models,based on the survey of Martin R.Albrecht et al.in the year 2015[33].We also give some estimation results on concrete LWE instances. |
| Key words: Lattice learning with errors (LWE) problem security analysis |
