两种基于欧拉定理的背包概率加密体制  

Two Kinds of New Knapsack of Probabilistic Cryptosystem Based on Euler Theorem

作　　者：王晓菲[1] 徐赐文[1] 贾杰[1] 郭远[1] 李必涛[1] 王金姣[1] 

机构地区：[1]中央民族大学理学院,北京100081

出　　处：《中央民族大学学报（自然科学版）》2009年第1期82-85,共4页Journal of Minzu University of China(Natural Sciences Edition)

基　　金：国家自然科学基金(No.10471148);中央民族大学"十五"重点科研项目资助

摘　　要：本文根据欧拉定理对背包加密体制进行了改进,为了防止破译,采取了变形序列,将超递增序列转化为非超递增的伪随机序列,使得每次加密的密文都不同,加大了破译密文的难度.从而提高了背包加密体制的安全性.Based on Euler Theorem, the knapsack of Merkle-Hellman of cryptosystem is improved in this paper. In order to prevent decipher, the paper adopt a deformation of the sequence, making the superincreasing sequence into a non-super increasing pseudo-random sequence so that the cryptograph different once we encrypted each time. Therefore, the algorithm has increased the difficulty of deciphering the cryptograph , Consequently, the security of is the knapsack of cryptosystem has been strengthened.

关 键 词：非超递增序列 概率加密 背包加密体制 贪心算法 伪随机序列 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]