光学图像加密与多参数加权类分数傅里叶变换

为了提高图像加密的安全性, 提出了一种多参数加权类分数傅里叶变换。此类多参数加权类分数傅里叶变换是C.C.Shih提出的四项加权类分数傅里叶变换的一种扩展, 除了分数阶数, 还有四个在四项加权系数之中的自由参数, 称其为向量参数。同时给出此多参数加权类分数傅里叶变换的离散形式, 并把这种算法应用到光学图像加密中。此算法在应用一次二维分数傅里叶变换可以有十个密键：一类为阶数参数; 另一类为向量参数, 因此这种加密算法在增加了安全性的同时, 加密过程的复杂度降低。数值仿真验证了此算法的有效性和可靠性。     

A novel bit-level image encryption algorithm based on chaotic maps

Recently, a number of chaos-based image encryption algorithms have been proposed at the pixel level, but little research at the bit level has been conducted. This paper presents a novel bit-level image encryption algorithm that is based on piecewise linear chaotic maps (PWLCM). First, the plain image is transformed into two binary sequences of the same size. Second, a new diffusion strategy is introduced to diffuse the two sequences mutually. Then, we swap the binary elements in the two sequences by the control of a chaotic map, which can permute the bits in one bitplane into any other bitplane. The proposed algorithm has excellent encryption performance with only one round. The simulation results and performance analysis show that the proposed algorithm is both secure and reliable for image encryption.     

Novel permutation measures for image encryption algorithms

This paper proposes two measures for the evaluation of permutation techniques used in image encryption. First, a general mathematical framework for describing the permutation phase used in image encryption is presented. Using this framework, six different permutation techniques, based on chaotic and non-chaotic generators, are described. The two new measures are, then, introduced to evaluate the effectiveness of permutation techniques. These measures are (1) Percentage of Adjacent Pixels Count (PAPC) and (2) Distance Between Adjacent Pixels (DBAP). The proposed measures are used to evaluate and compare the six permutation techniques in different scenarios. The permutation techniques are applied on several standard images and the resulting scrambled images are analyzed. Moreover, the new measures are used to compare the permutation algorithms on different matrix sizes irrespective of the actual parameters used in each algorithm. The analysis results show that the proposed measures are good indicators of the effectiveness of the permutation technique.     

采用混沌光注入实现混沌载波时延特征隐藏的研究

在混沌通信系统中,混沌载波的时延特征直接影响着通信系统的安全性,因此隐藏混沌载波的时延特征信息十分重要。本文基于外腔反馈式半导体激光器(ECSL)的单光注入结构,引入激光器参数失配,详细阐述了一种通过主从激光器参数失配来消除混沌信号时延特征的方法。利用自相关函数作为量化工具,对混沌信号的时延隐藏效果进行量化分析,数值研究了主从激光器间的参数失配对混沌信号时延消除的影响,并结合注入强度与频率失谐开展了进一步综合研究。研究结果表明:引入激光器参数失配对时延隐藏的效果影响显著,参数失配率在-0.4~0范围时有助于在从激光器混沌输出中隐藏主激光器外腔引入的反馈时延;而且,当主激光器注入强度在10ns-1~20ns-1范围内,主从激光器频率失谐控制在-20GHz附近时,信号时延隐藏效果最佳。因此,由此单混沌光注入系统产生的混沌信号可显著提高混沌载波的安全性,进而增强其潜在应用的性能。     

An Image Encryption Algorithm Using Logistic Map with Plaintext-Related Parameter Values

This paper deals with a plaintext-related image encryption algorithm that modifies the parameter values used by the logistic map according to plain image pixel intensities. The parameter values are altered in a row-wise manner, which enables the usage of the same procedure also during the decryption. Furthermore, the parameter modification technique takes into account knowledge about the logistic map, its fixed points and possible periodic cycles. Since the resulting interval of parameter values achieves high positive values of Lyapunov exponents, the chaotic behavior of the logistic map should be most pronounced. These assumptions are verified by a set of experiments and the obtained numerical values are compared with those reported in relevant papers. It is found that the proposed design that uses a simpler, but well-studied, chaotic map with mitigated issues obtains results comparable with algorithms that use more complex chaotic systems. Moreover, the proposed solution is much faster than other approaches with a similar purpose.     

Image encryption using exclusive-OR with DNA complementary rules and double random phase encoding

We propose an optical image encryption scheme based on the Deoxyribonucleic Acid (DNA) theory and the double random phase encoding (DRPE) technique. The piecewise linear chaotic map (PWLCM) is used to generate key images and random phase masks, and to determine DNA encoding rules. In order to achieve ultra-fast DNA encryption, we propose using an optical exclusive-OR (XOR) gate to achieve XOR operation in DNA encryption. Different plaintexts use different initial values of PWLCM, which are generated by Message Digest Algorithm 5 (MD5). The plaintext is encrypted by two rounds of DNA and then by DRPE to form a ciphertext. Numerical simulation and the analysis of attacks on encrypted image are implemented to demonstrate the security and validity of the proposed approach.     

How to Construct Polar Codes for Ring-LWE-Based Public Key Encryption

There exists a natural trade-off in public key encryption (PKE) schemes based on ring learning with errors (RLWE), namely: we would like a wider error distribution to increase the security, but it comes at the cost of an increased decryption failure rate (DFR). A straightforward solution to this problem is the error-correcting code, which is commonly used in communication systems and already appears in some RLWE-based proposals. However, applying error-correcting codes to those cryptographic schemes is far from simply installing an add-on. Firstly, the residue error term derived by decryption has correlated coefficients, whereas most prevalent error-correcting codes with remarkable error tolerance assume the channel noise to be independent and memoryless. This explains why only simple error-correcting methods are used in existing RLWE-based PKE schemes. Secondly, the residue error term has correlated coefficients leaving accurate DFR estimation challenging even for uncoded plaintext. It can be found in the literature that a tighter DFR estimation can effectively create a DFR margin. Thirdly, most error-correcting codes are not well designed for safety considerations, e.g., syndrome decoding has a nonconstant time nature. A code good at error correcting might be weak under a variety of attacks. In this work, we propose a polar coding scheme for RLWE-based PKE. A relaxed “independence” assumption is used to derive an uncorrelated residue noise term, and a wireless communication strategy, outage, is used to construct polar codes. Furthermore, some knowledge about the residue noise is exploited to improve the decoding performance. With the parameterization of NewHope Round 2, the proposed scheme creates a considerable DRF margin, which gives a competitive security improvement compared to state-of-the-art benchmarks. Specifically, the security is improved by 28.8%, while a DFR of 2−149 is achieved a for code rate pf 0.25, n=1024,q= 12,289, and binomial parameter k=55. Moreover, polar encoding and decoding have a quasilinear complexity O(Nlog2N) and intrinsically support constant-time implementations.     

相位恢复算法用于分区复用多图像加密的研究

衍射投影效应明显降低了基于双相位编码的多图像加密系统的性能.提出分区复用技术来解决这一问题.待加密的多个图像被放置于各个输出平面的不同区域,于是相邻两个输出平面的秘密图像区域将错落开来,因而有效抑制了衍射投影所产生的噪声.在此基础上,重点研究了用于该系统的相位恢复算法.在完整的顺序迭代之后,对解密质量最差的图像进行逐一补偿,从而寻找到了更加符合多幅秘密图像客观特点的子循环次序.根据这一次序,用完整迭代后附加调节性迭代的方法或者完全更换迭代次序的方法,都能够在保留基本算法快速收敛优势的前提下,使多幅解密图像质量以及系统地复用容量得以整体提高.     

Securing multiplexed information by in-plane rotation of random phase diffusers constituting a sandwich diffuser placed in the Fourier plane of a double random phase encoding system

We propose the encryption and multiplexing of two-dimensional input images by rotating the constituent diffusers of a sandwich random phase diffuser kept in the Fourier plane of a double random phase encoding system. Successive recording of encrypted images is done by taking the input images one by one. The results of multiplexing in encryption and decryption due to different sets of rotation of one or both of the random constituent phase masks have been presented. The use of an aperture system in addition to the rotation of one or both of the random phase masks enhances the multiplexing capability and security of the system avoiding the generation of cross-talk images at the time of decryption. Simulation results are presented in support of the proposed techniques. The decrypted images obtained from a multiplexed encrypted image have been recorded successfully. Mean square-error (MSE) and signal-to-noise ratio (SNR) values as a function of the number of multiplexed images have been calculated.     

The multiple-parameter discrete fractional Hadamard transform

Discrete fractional Hadamard transform (DFrHaT) is a generalization of the Hadamard transform, which has been widely used in signal processing. In this paper, we present the multiple-parameter discrete fractional Hadamard transform (MPDFrHaT), which has multiple order parameters instead of only one in DFrHaT. The proposed MPDFrHaT is shown to possess all of the desired properties of DFrHaT. In fact, it will reduce to DFrHaT when all of its order parameters are the same. We also propose a novel encryption technique, double random amplitude (DRA) encoding scheme, by cascading twofold random amplitude filtering. As a primary application, we exploit the multiple-parameter feature of MPDFrHaT and double random amplitude encoding scheme for digital image encryption in the MPDFrHaT domain. Results show that this method can enhance data security.