arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.01669cs.CR
收藏

一种基于额外超增序列的快速量子安全非对称密码体制

A Fast Quantum-safe Asymmetric Cryptosystem Using Extra Superincreasing Sequences

Shenghui Su, Jianhua Zheng, Shuwang Lu

摘要:

本文给出了额外超增序列和反常子集和的定义,并提出了一个快速量子安全的非对称密码体制JUOAN 2。新密码体制基于分别与多元多项式问题和最短向量问题并行的可加多元置换问题(AMPP)和异常子集和问题(ASSP),由密钥生成器、加密算法和解密算法组成。分析了新密码系统抵抗Shamir最小聚点攻击和LLL格基约减攻击的安全性,并在假设AMPP和ASSP没有次指数时间解的条件下证明了新密码系统是语义安全的(IND-CPA).分析表明,该密码体制具有抗量子计算攻击的潜力,特别适用于在任何天气条件下机动野战条件下的两个移动终端之间的秘密通信。最后给出了一个例子来说明新密码体制的正确性。

英文摘要:

This paper gives the definitions of an extra superincreasing sequence and an anomalous subset sum, and proposes a fast quantum-safe asymmetric cryptosystem called JUOAN2. The new cryptosystem is based on an additive multivariate permutation problem (AMPP) and an anomalous subset sum problem (ASSP) which parallel a multivariate polynomial problem and a shortest vector problem respectively, and composed of a key generator, an encryption algorithm, and a decryption algorithm. The authors analyze the security of the new cryptosystem against the Shamir minima accumulation point attack and the LLL lattice basis reduction attack, and prove it to be semantically secure (namely IND-CPA) on the assumption that AMPP and ASSP have no subexponential time solutions. Particularly, the analysis shows that the new cryptosystem has the potential to be resistant to quantum computing attack, and is especially suitable to the secret communication between two mobile terminals in maneuvering field operations under any weather. At last, an example explaining the correctness of the new cryptosystem is given.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑