基于可满足性问题的非对称密码方案设计  

Design of asymmetric cryptographic scheme based on the satisfiability problem

作　　者：孙瑞 黄佳文 孙学贵 Sun Rui;Huang Jiawen;Sun Xuegui(Shangrao Normal University,Shangrao 334001)

机构地区：[1]上饶师范学院,江西上饶334001

出　　处：《无线互联科技》2022年第8期67-68,共2页Wireless Internet Technology

基　　金：国家自然科学基金项目,可掩藏态集以及其在量子信息秘密共享中的应用研究,项目编号:12065021;江西省教育厅社科类基金项目,新型媒介对赣南革命老区留守儿童体质健康的影响研究,项目编号:TY19220;上饶师范学院校级自选课题,可验证的公钥密码体制构造及可证明安全的方法研究,项目编号:202126。

摘　　要：基于可满足性问题构造加密方案具有挑战性,关键是如何构造具有加密功能的难解的SAT合取范式,并将明文安全地隐藏在其中。文章首先改进了SRR(N,k,s)模型用以隐藏明文;其次,通过恰当选取约束密度值,保证密文的难解性;最后,证明方案满足选择明文攻击(IND-CPA)是安全的。It is a challenge to construct an encryption scheme based on the satisfiability problem. The key point is that how to construct a complicated SAT conjunction normal form with encrypting function and hide the plaintext in it safely. Firstly, the SRR(N,k,s) model is improved to hide the plaintext. Secondly, constraining reasonably constraint den-sity of the constructed(3,s)-SATconjunctive normal form to generate difficult instances and encrypting the plaintext. Finally, it is proved that this scheme can securely against chosen-plaintext attack.

关 键 词：非对称加密 可满足性问题 选择明文攻击 

分 类 号：TN918.4[电子电信—通信与信息系统]