Information hiding based on the optical interference principle

An information hiding method based on the optical interference principle is proposed. In this method, a secret image can be obtained by two light beams' interference. One of the beams is modulated by our assigned host image; and the other is modulated by a noise-like complex distribution, which is regard as the encrypted image. The transmission of the encrypted image can be implemented by hiding it in the host image to prevent the communication from being perceived by unauthorized person. In addition, this method can also realize simultaneous encryption and hiding for two images. A series of numerical simulation results are presented to verify the feasibility of our proposed method.     

Application of homomorphism to secure image sharing

In this paper, we present a new approach for sharing images between l players by exploiting the additive and multiplicative homomorphic properties of two well-known public key cryptosystems, i.e. RSA and Paillier. Contrary to the traditional schemes, the proposed approach employs secret sharing in a way that limits the influence of the dealer over the protocol and allows each player to participate with the help of his key-image. With the proposed approach, during the encryption step, each player encrypts his own key-image using the dealer's public key. The dealer encrypts the secret-to-be-shared image with the same public key and then, the l encrypted key-images plus the encrypted to-be shared image are multiplied homomorphically to get another encrypted image. After this step, the dealer can safely get a scrambled image which corresponds to the addition or multiplication of the l + 1 original images (l key-images plus the secret image) because of the additive homomorphic property of the Paillier algorithm or multiplicative homomorphic property of the RSA algorithm. When the l players want to extract the secret image, they do not need to use keys and the dealer has no role. Indeed, with our approach, to extract the secret image, the l players need only to subtract their own key-image with no specific order from the scrambled image. Thus, the proposed approach provides an opportunity to use operators like multiplication on encrypted images for the development of a secure privacy preserving protocol in the image domain. We show that it is still possible to extract a visible version of the secret image with only l-1 key-images (when one key-image is missing) or when the l key-images used for the extraction are different from the l original key-images due to a lossy compression for example. Experimental results and security analysis verify and prove that the proposed approach is secure from cryptographic viewpoint.     

Two-dimensional shift-orthogonal random-interleaving phase-code multiplexing for holographic data storage

A novel phase encoding technology for phase-code multiplexing in holographic data storage (HDS) system called two-dimensional shift-orthogonal random-interleaving (2-D SORI) phase encoding is proposed. Compared with the traditional one-dimensional orthogonal phase-code multiplexing methods, the 2-D method is less sensitive to the variations of the diffraction amplitude and to the phase error of the phase mask. Phase masks for the 2-D SORI phase-code multiplexing can be generated by shifting an elaborately designed phase plate at a certain step, which can avoid the use of a high-cost phase spatial light modulator for the generation of multiple orthogonal phase masks. The cross-talk arising from the systematic phase defects of the static phase modulator is eliminated by the shift operation of the phase plate. Phase codes are interleaved under a predetermined random mapping rule to prevent unauthorized users from accessing the data and eliminate the Bragg degeneration cross-talk. A 2-D SORI phase plate with the size of 5.12 mm × 10.24 mm is designed and fabricated, from which 128 orthogonal phase patterns are generated. The feasibility of the 2-D SORI phase-code multiplexing method for HDS is experimentally demonstrated.     

Optical multi-image encryption based on frequency shift

We present a novel multi-image encryption and decryption algorithm based on Fourier transform and fractional Fourier transforms. Lower frequency parts of the original images are selected, frequency shifted and encrypted by using double phase encoding in fractional Fourier domains. Multiple images are encrypted together into a single one. A simple optical setup is given to implement the proposed algorithm. This scheme has features of enhancement in decryption accuracy and high optical efficiency. Numerical results have been given to verify the validity and efficiency of the proposed scheme.     

Image encryption scheme by using iterative random phase encoding in gyrator transform domains

An image encryption is discussed based on the random phase encoding method in gyrator domains. An iterative structure of image encryption is designed for introducing more random phases to encrypt image. These random phase functions are generated by a two-dimensional chaotic mapping with the help of computer. The random phases are utilized for increasing the security of this encryption algorithm. In the chaotic mapping relation, the initial value and expression can serve as the key of algorithm. The mapping relation is considered secretly for storage and transmission in practical application in comparison to traditional algorithms. The angle parameter of gyrator transform is an additional key. Some numerical simulations have been given to validate the performance of the encryption scheme.     

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.     

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

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

A novel colour image encryption algorithm based on chaos

In this paper, a novel colour image encryption algorithm based on chaos has been proposed. We use chaotic system to encrypt the R, G, B components of a colour image at the same time and make these three components affect each other. So the correlations between R, G, B components can be reduced and the security of algorithm is increased. Simulation results show that the proposed algorithm can encrypt colour image effectively and resist various typical attacks.     

Parallel Collision Search with Cryptanalytic Applications

A simple new technique of parallelizing methods for solving search problems which seek collisions in pseudorandom walks is presented. This technique can be adapted to a wide range of cryptanalytic problems which can be reduced to finding collisions. General constructions are given showing how to adapt the technique to finding discrete logarithms in cyclic groups, finding meaningful collisions in hash functions, and performing meet-in-the-middle attacks such as a known-plaintext attack on double encryption. The new technique greatly extends the reach of practical attacks, providing the most cost-effective means known to date for defeating: the small subgroup used in certain schemes based on discrete logarithms such as Schnorr, DSA, and elliptic curve cryptosystems; hash functions such as MD5, RIPEMD, SHA-1, MDC-2, and MDC-4; and double encryption and three-key triple encryption. The practical significance of the technique is illustrated by giving the design for three $10 million custom machines which could be built with current technology: one finds elliptic curve logarithms in GF(2¹⁵⁵) thereby defeating a proposed elliptic curve cryptosystem in expected time 32 days, the second finds MD5 collisions in expected time 21 days, and the last recovers a double-DES key from two known plaintexts in expected time 4 years, which is four orders of magnitude faster than the conventional meet-in-the-middle attack on double-DES. Based on this attack, double-DES offers only 17 more bits of security than single-DES. Received 21 December 1995 and revised 24 September 1996     

利用复制SIM卡及网络漏洞进行欺诈的行为探析与对策研究

近年来,随着人们对移动通信业务的各种需求与日俱增,移动通信市场规模的不断扩大.在巨大的经济利益的驱使下,出现了大量利用移动通信网络的缺陷进行话费欺诈的现象,使电信运营商蒙受了巨大的经济损失.本文将对SIM卡复制的原理及利用复制SIM卡发送垃圾短信等话费欺诈行为进行深入的分析,提出针对此类问题的防范措施,以期提高移动通信...