光通信网物理层全光异或加解密技术研究

针对目前光通信保密系统中基于电信号处理的流密码加解密技术的局限性,提出基于全光信号处理的加解密技术;对几种典型的全光异或加密方案进行了研究,介绍了各自的工作原理、特点及研究进展;利用OptiSystem软件搭建了基于SOA-MZI(半导体光放大器-马赫-曾德干涉仪)异或门的全光加解密系统仿真模型,并基于HNLF(高非线性光纤)的自相位调制效应设计了一个优化结构对系统进行优化。研究表明:全光加解密技术具有优良的特性,能使整个光通信保密系统运算速率更高,传输更安全。     

利用El Gamal密码体制解决安全多方多数据排序问题

基于E1Gamal同态密码体制给出了一个解决百万富翁问题的扩展问题的协议——安全多方多数据排序协议。并使用安全多方计算的对安全性的定义，在半诚实模型下，对协议的正确性和安全性进行了理论证明。该协议为保密电子投标和拍卖、保密在线交易等新型电子交易奠定了基础。     

一种抗高阶旁路攻击的LED密码算法

LED密码算法是2011年提出的超轻量级密码算法,主要是为资源受限下物联网加密应用研发的.轻量级密码算法结构相对简单,更容易被旁路攻击成功.随机掩码是一种有效抗旁路攻击的方法,在深入LED密码算法结构研究的基础上,提出一种全随机掩码的LED密码算法CMLED.论述了CMLED算法的设计方法,从形式化方面给出了抗高阶旁路攻击选择掩码的原则.同时,对全随机掩码的CMLED与原始算法进行了硬件资源占用与加密效率对比,实验表明CMLED仍然可以高效地在智能卡上实现.     

Establishing the broadcast efficiency of the Subset Difference Revocation Scheme

When an organisation chooses a system to make regular broadcasts to a changing user base, there is an inevitable trade off between the number of keys a user must store and the number of keys used in the broadcast. The Complete Subtree and Subset Difference Revocation Schemes were proposed as efficient solutions to this problem. However, all measurements of the broadcast size have been in terms of upper bounds on the worst-case. Also, the bound on the latter scheme is only relevant for small numbers of revoked users, despite the fact that both schemes allow any number of such users. Since the broadcast size can be critical for limited memory devices, we aid comparative analysis of these important techniques by establishing the worst-case broadcast size for both revocation schemes.      

A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model

The first practical identity based encryption (IBE) scheme was published by Boneh and Franklin at Crypto 2001, based on the elliptic curve pairing. Since that time, many other IBE schemes have been published. In this paper, we describe a variant of Boneh-Franklin with a tight reduction in the random oracle model. Our new scheme is quite efficient compared to existing schemes; moreover, upgrading from Boneh-Franklin to our new scheme is straightforward.      

Means of unitaries, conjugations, and the Friedrichs operator

If C is a conjugation (an isometric, conjugate-linear involution) on a separable complex Hilbert space H, then T∈B(H) is called C-symmetric if T=CT^∗C. In this note we prove that each C-symmetric contraction T is the mean of two C-symmetric unitary operators. We discuss several corollaries and an application to the Friedrichs operator of a planar domain.     

一种新的增强ElGamal加密机制

针对传统的ElGamal加密机制不能抵抗自主选择密文攻击的问题,通过引入安全Hash函数和伪随机数发生函数给出了一种新的增强ElGamal加密机制.结果表明,该机制不仅能够抵抗自主选择密文攻击,且由于伪随机数发生函数的引入,解决了加密过程中随机数的暴露问题.该机制加密过程需要两次模幂运算,解密过程仅需一次模幂运算.完全适合于对安全性要求较高但是对系统资源要求消耗低的应用环境.     

A method for image encryption based on fractional-order hyperchaotic systems

By using sequences generated from fractional-order hyperchaotic systems, a color image encryption scheme is investigated. Firstly, a plain image, which is known to users in advance, is chosen as a secret key to confuse the original image. Then, the confused image is encrypted by the sequences generated from the fractional-order hyperchaotic systems. With this simple encryption method, we can get an encrypted image that is fully scrambled and diused. For chaos-based image cryptosystems, this encryption scheme enhances the security and improves the eectiveness. Furthermore, the cryptosystem resists the dierential attack. Experiments show that the algorithm is suitable for image encryption, and some statistical tests are provided to show the high security in the end     

Image encryption based on synchronization of fractional chaotic systems

This paper deals with a synchronization scheme for two fractional chaotic systems which is applied in image encryption. Based on Pecora and Carroll (PC) synchronization, fractional-order Lorenz-like system forms a master–slave configuration, and the sufficient conditions are derived to realize synchronization between these two systems via the Laplace transformation theory. An image encryption algorithm is introduced where the original image is encoded by a nonlinear function of a fractional chaotic state. Simulation results show that the original image is well masked in the cipher texts and recovered successfully through chaotic signals. Further, the cryptanalysis is conducted in detail through histogram, information entropy, key space and sensitivity to verify the high security.