【摘 要】
：
There are a lot of security issues in block cipher algorithm.Security analysis and enhanced design of an dynamic block cipher was proposed.Firstly, the safety of ciphertext was enhanced based on confu
【机 构】
：
College of Computer Science and Information Engineering,Harbin Normal University,Harbin 150025,P.R.C
【出 处】
：
第九届中国可信计算与信息安全学术会议
论文部分内容阅读
There are a lot of security issues in block cipher algorithm.Security analysis and enhanced design of an dynamic block cipher was proposed.Firstly, the safety of ciphertext was enhanced based on confusion substitution of S-box, thus disordering the internal structure of data blocks by four steps of matrix transformation.Then, the diffusivity of ciphertext was obtained by cyclic displacement of bytes using column ambiguity function.The dynamic key was finally generated by using LFSR, which improved the stochastic characters of secret key in each of round of iteration.The safety performance of proposed algorithm was analyzed by simulation test.The results showed the proposed algorithm has a little effect on the speed of encryption and decryption while enhancing the security.Meanwhile, the proposed algorithm has highly scalability, the dimension of S-box and the numer of register can be dynamically extended according to the security requirement.
其他文献
The digital community is an information integrated system, which utilize digital information technology and computer technology to make interconnected between users, management provider and service pr
In CRYPTO13, Gentry et al.proposed a fully homomorphic encryption scheme, called GSW.We find that the scheme has three special properties, which are not sufficiently recognized and applied in current
1991年,D.Chaum和E.Van.Heyst首次提出群签名的概念[1],群签名方案允许群中任一合法用户代表整个群体对消息进行匿名签名,验证者可以用群公钥验证签名的合法性,但无法确定签名者的身份,在发生争议时可由群管理员打开签名找到签名者的身份.由于这些特点,群签名在电子投票、电子现金等领域具有广泛的应用.
近年来,通过混合不同群上的运算来构造对称密码算法获得了密码设计者的青睐,逐位模2加运算和模2n加运算是设计密码算法中经常用到的两种运算,例如,分组密码Speck算法、LEA算法以及流密码Snow算法、Py算法等都使用了这两种运算.由于逐位模2加和模2n加是两个不同群上的运算,故二者的混合使用可增强密码算法的安全性.设计者经常将一种运算视为线性运算,将另外一种运算视为非线性运算,通过混合两种运算,以
针对现有全同态加密方案仅能对用同一密钥加密的密文进行计算的局限性,在Brakerski等人构造的全同态加密方案基础上,利用密钥隐私(Key-private)代理重加密的思想,构造了首个密钥隐私的全同态代理重加密方案,该方案可以使拥有重加密密钥的代理者在不改变明文的情况下,把用Alice的公钥加密后的密文转换为可以用Bob的私钥解密,且代理者无法获知Alice和Bob的身份,同时,根据同态运算的性质
During the last decades, many public key cryptosystems based on non-abelian algebraic structures were proposed, such as cryptosytems based on inner automorphism groups, general linear groups and braid
随着智能卡的广泛应用,智能卡所带来的数据安全性问题越来越受到人们的关注.传统的直接块加密技术、异或加密技术以及置乱加密技术都存在各自的缺点,并不完全适合于智能卡存储器的加密.随着目前轻量级分组密码算法在物联网以及RFID方向上的广泛应用,选择一种加密效率和安全性都较高的轻量级分组密码算法来实现智能卡存储器安全性也成为了必然趋势.
Before going into details we would like to mention that non-abelian algebraic structures have already been used in a cryptographic context.
与传统的公钥加密体制不同,IBE(Identity-Based Encryption)体制[1-10]将用户的身份信息(例如邮箱地址)作为公钥,无需使用公钥证书,也无需建立证书机构,大大减少了公钥加密体制中由分发、维护、撤销证书产生的通信开销.传统IBE方案的安全性均建立在用户私钥不被泄露的基础上,一旦合法用户的私钥被泄露,整个系统的安全也将遭到威胁.为了减少IBE体制中由于私钥泄露带来的安全损失
1984年, Shamir提出了基于身份的签名机制[1].在该体制中,用户可以选取自己的身份作为公钥,私钥由可信的私钥生成中心PKG生成.不过,直到2001年,Boneh和Franklin才设计出第一个真正实用的基于Weil配对的基于身份的加密算法[2].利用基于身份的加密体制,学者们提出了大量的基于身份的认证密钥协商协议.然而,大多数基于身份的认证密钥协商协议[3]-[5]都是在单一PKG环境下