| 基于编码的数字签名综述 |
| |
| 作者姓名： | 宋永成 黄欣沂 伍玮 陈海霞 |
| |
| 作者单位： | 1. 福建师范大学计算机与网络空间安全学院福建省网络安全与密码技术重点实验室，福建 福州 350117;2. 密码科学技术国家重点实验室，北京 100878;3. 福建师范大学数学与统计学院，福建 福州 350117 |
| |
| 基金项目： | 国家自然科学基金(62032005);福建省科学技术厅科学基金(2020J02016);国家密码技术重点实验室项目(MMKFKT202008) |
| |
| 摘 要： | 量子计算理论和实践的快速发展导致基于传统数论困难问题的密码安全性存在很大不确定性。编码困难问题是公认的NP完全问题，求解复杂度呈指数级增长，且目前未发现量子计算对基于编码密码算法的威胁。因此，基于编码的密码算法有望抵抗量子算法攻击，是抗量子密码的主流方向之一。设计安全高效的基于编码的数字签名一直是公开问题。多年来，国内外学者使用经典方法和新方法构造基于编码的数字签名，但现存的构造存在安全性弱或性能差的不足。对当前基于编码的数字签名进行了综述，分析和评价了各类基于编码的数字签名，并指出未来的研究方向。
|
| 关 键 词： | 抗量子密码 基于编码的密码学 数字签名 身份认证 |
Survey of code-based digital signatures |
| |
| Authors: | Yongcheng SONG Xinyi HUANG Wei WU Haixia CHEN |
| |
| Affiliation: | 1. Fujian Provincial Key Laboratory of Network Security and Cryptology, College of Computer and Cyber Security, Fujian Normal University, Fuzhou 350117, China;2. State Key Laboratory of Cryptology, Beijing 100878, China;3. School of Mathematics and Statistics, Fujian Normal University, Fuzhou 350117, China |
| |
| Abstract: | The rapid development of quantum computing theory and practice brings great uncertainty to the security of cryptography based on hard problems in number theory.Code-based hard problem is recognized as NP-complete problem, the complexity increases exponentially, and there is currently no threat of quantum computing to code-based cryptographic algorithm.Therefore, code-based algorithm can resist the quantum algorithm attack, which is one of the main directions of quantum-resistant cryptography.It is still an open problem to design secure and efficient code-based signatures.For many years, international researchers use classical and new methods to construct code-based signatures, but existing constructions are weak in security or poor in performance.Code-based signatures were comprehensively summarized and analyzed, and future research directions were indicated. |
| |
| Keywords: | quantum-resistant cryptography code-based cryptography digital signatures identification |
|
| 点击此处可从《》浏览原始摘要信息 |
|
点击此处可从《》下载全文 |
