计算机应用 ›› 2018, Vol. 38 ›› Issue (6): 1644-1647.DOI: 10.11772/j.issn.1001-9081.2017122960

• 网络空间安全 • 上一篇    下一篇

基于Niederreiter编码的混合加密方案的改进

刘相信1,2, 杨晓元1,2   

  1. 1. 武警工程大学 密码工程学院, 西安 710086;
    2. 网络与信息安全武警部队重点实验室, 西安 710086
  • 收稿日期:2017-12-18 修回日期:2018-02-01 出版日期:2018-06-10 发布日期:2018-06-13
  • 通讯作者: 刘相信
  • 作者简介:刘相信(1990-),男,山东日照人,硕士研究生,主要研究方向:密码学、信息安全;杨晓元(1959-),男,湖南湘潭人,教授,博士生导师,博士,CCF会员,主要研究方向:密码学、信息安全。
  • 基金资助:
    国家重点研发计划项目(2017YFB0802000);国家自然科学基金资助项目(U1636114)。

Improvement of hybrid encryption scheme based on Niederreiter coding

LIU Xiangxin1,2, YANG Xiaoyuan1,2   

  1. 1. College of Cryptographic Engineering, Engineering University of the Chinese Armed Police Force, Xi'an Shanxi 710086, China;
    2. Key Laboratory of Network and Information Security of the Chinese Armed Police Force, Xi'an Shanxi 710086, China
  • Received:2017-12-18 Revised:2018-02-01 Online:2018-06-10 Published:2018-06-13
  • Supported by:
    This work is partially supported by the National Key Research and Development Program of China (2017YFB0802000), the National Natural Science Foundation of China (U1636114).

摘要: 基于编码的密码方案具有抗量子的特性和较快的加解密速度,是当今抗量子密码方案的备用方案之一。现有基于编码的混合加密方案已经达到选择密文攻击不可区分(IND-CCA)安全,其缺点是加密收发双方共享秘密密钥的公钥尺寸较大。针对基于Niederreiter编码的混合加密方案公钥尺寸大的的问题,首先对Niederreiter编码方案的私钥进行随机拆分,然后对Niederreiter编码方案的明文进行随机拆分,最后对Niederreiter编码方案的加解密过程进行了改进。经过分析得出,改进方案的公钥尺寸小于Maurich方案的公钥尺寸,在80比特的安全级下,改进方案的公钥从原方案的4801比特降低到240比特;在128比特的安全级下,改进方案的公钥从原方案的9857比特降低到384比特。虽然改进后的方案比原方案过程复杂,但其存储代价和计算代价变小,方案的实用性增强。

关键词: 选择密文攻击不可区分, Niederreiter编码方案, 后量子密码, 编码理论, 非确定性多项式完全问题

Abstract: Coding-based encryption scheme, with the advantages of anti-quantum feature and fast encryption and decryption speed, is one of the candidate schemes for anti-quantum cryptography. The existing coding-based hybrid encryption schemes have the INDistinguishability under Chosen Ciphertext Attack (IND-CCA) security, which have the disadvantage that the public key size used to encrypt the shared secret key of the sender and receiver is large. The problem of large size of public key in hybrid encryption scheme based on Niederreiter coding was solved by the following three steps. Firstly, the private key of Niederreiter coding scheme was randomly split. Then, the plaintext of Niederreiter coding scheme was split randomly. Finally, the encryption and decryption processes of Niederreiter coding scheme were improved. It is concluded through analysis that, the public key size of the improved scheme is less than that of Maurich scheme. Compared with Maurich scheme, the public key of the improved scheme is reduced from 4801 bits of the original scheme to 240 bits under the security level of 80 bits, and the public key of the improved scheme is reduced from 9857 bits to 384 bits under the security level of 128 bits. Although the improved scheme is more complicated than the original scheme, its storage cost and calculation cost are smaller, and the practicability of the improved scheme is enhanced.

Key words: INDistinguishability under Chosen Ciphertext Attack (IND-CCA), Niederreiter coding scheme, post-quantum cryptography, coding theory, Non-deterministic Polynomial Complete (NPC) problem

中图分类号: