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.     

基于超混沌系统和离散分数随机变换的图像加密算法

本文结合超混沌系统和离散分数随机变换,提出一种图像加密新方案,并给出实现该算法的光学装置原理图。在加密过程中,利用超混沌系统产生的混沌序列来构造离散分数随机变换(DFRT)的随机矩阵,再将DFRT的阶数和超混沌系统的初始值作为图像加密算法的主密钥,与单纯的离散分数随机变换的图像加密算法相比,在不增加计算负担的情况下,本算法的明文与密文之间具有更高的复杂性,并加大了密钥空间,提高了密钥敏感性。该系统是一个非线性的密码系统,消除了传统加密系统中因为线性过程而存在的不安全因素,提高了加密系统的抗统计攻击和噪声攻击的能力。     

实时图像增强算法研究

图像增强是图像处理最有吸引力的领域。在嵌入式视频图像处理系统中,图像增强后的效果和图像增强的实时性是决定算法优劣的两个关键问题。而恰当的图像增强算法和高效硬件平台的合理搭建是解决问题的有效途径。在研究多种实时图像增强算法基础上,本文在matlab平台上对三种典型的增强算法进行算法仿真,即直方图均衡增强算法、基于照度-反射模型的同态滤波增强算法、基于小波变换增强算法。并对仿真结果进行分析,比较各算法的优缺点,指出了其最佳的应用场景和最高效的硬件实现平台,以期从中总结出一套行之有效的实时图像增强算法的应用指导规则。     

用CryptAPI函数加密文档文件

阐述了计算机加密技术,分析了公共密钥、个人密钥、数字签字、数字认证,介绍了Microsoft集成到IE软件的浏览器里的CryptAPI(加密应用程序接口)的模板和基本函数,以CryptAPI支持的加密服务供应器为基础实现用CryptAPI函数加密文档．     

一种带有时序参数的分组密码

通过将系统时间和数据组号混合到轮密钥之中,可以有效地防止一些对分组密码算法的攻击．文中探讨了这类实用的密码算法方案的一般模式．由于变更部分轮密钥通常比若干轮变换快很多,这类方案会有明显的效率优势．在安全方面,由于加密时所有明文组几乎都各自使用了不同的轮密钥,而绝大数攻击方法需要一定数量相同密钥加密的明密文对,从而使这些攻击方法不能奏效．这也许会导致这类带有时间组号参数的分组算法在减少迭代轮情况下仍然是安全的．做为例子,给出了一个在安全和效率方面均有良好性能的密码算法TCR6．     

基于FPGA的高速加密芯片的设计与实现

以非线性组合函数和线性反馈移位寄存器(LFSR:Linear Feedback Shift Registers)为基础,利用可编程逻辑门阵列(FPGA:Field-Programmable Gate Array)设计了一个高速加密芯片.该芯片既能满足密码学领域对密钥序列的高质量要求,又能满足保密通信领域高速度要求.介绍了加密芯片的设计理论、设计过程、加密芯片安全性分析和硬件实现,最后对密钥流进行了随机性统计测试.     

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.