Secure image encryption scheme using 4D-Hyperchaotic systems based reconfigurable pseudo-random number generator and S-Box

This paper introduces the design of a hardware efficient reconfigurable pseudorandom number generator (PRNG) using two different feedback controllers based four-dimensional (4D) hyperchaotic systems i.e. Hyperchaotic-1 and -2 to provide confidentiality for digital images. The parameter's value of these two hyperchaotic systems is set to be a specific value to get the benefits i.e. all the multiplications (except a few multiplications) are performed using hardwired shifting operations rather than the binary multiplications, which doesn't utilize any hardware resource. The ordinary differential equations (ODEs) of these two systems have been exploited to build a generic architecture that fits in a single architecture. The proposed architecture provides an opportunity to switch between two different 4D hyperchaotic systems depending on the required behavior. To ensure the security strength, that can be also used in the encryption process in which encrypt the input data up to two times successively, each time using a different PRNG configuration. The proposed reconfigurable PRNG has been designed using Verilog HDL, synthesized on the Xilinx tool using the Virtex-5 (XC5VLX50T) and Zynq (XC7Z045) FPGA, its analysis has been done using Matlab tool. It has been found that the proposed architecture of PRNG has the best hardware performance and good statistical properties as it passes all fifteen NIST statistical benchmark tests while it can operate at 79.101-MHz or 1898.424-Mbps and utilize only 0.036 %, 0.23 %, and 1.77 % from the Zynq (XC7Z045) FPGA's slice registers, slice LUTs, and DSP blocks respectively. Utilizing these PRNGs, we design two 16 × 16 substitution boxes (S-boxes). The proposed S-boxes fulfill the following criteria: Bijective, Balanced, Non-linearity, Dynamic Distance, Strict Avalanche Criterion (SAC) and BIC non-linearity criterion. To demonstrate these PRNGs and S-boxes, a new three different scheme of image encryption algorithms have been developed: a) Encryption using S-box-1, b) Encryption using S-box-2 and, c) Two times encryption using S-box-1 and S-box-2. To demonstrate that the proposed cryptosystem is highly secure, we perform the security analysis (in terms of the correlation coefficient, key space, NPCR, UACI, information entropy and image encryption quantitatively in terms of (MSE, PSNR and SSIM)).     

结合公钥加密和关键字可搜索加密的加密方案

带关键字搜索的公钥加密(PEKS)是一种有用的加密原语，它允许用户将在加密数据上搜索的功能委托给不可信的第三方服务器，而不影响原始数据的安全性和隐私性。但是，由于缺乏对于数据的加密以及解密能力，PEKS方案不能单独进行使用，必须与标准的公钥加密方案(PKE)相结合。因此，Baek等人在2006年引入了一种新的加密原语，称为结合PKE和PEKS的加密方案(PKE+PEKS)，它同时提供了PKE和PEKS的功能。目前，已有文献提出了几种PKE+PEKS方案。然而，他们都没有考虑关键字猜测攻击的问题。本文提出一个新的高效且能够抵抗关键字猜测攻击的PKE+PEKS方案，与已有方案相比，该方案在性能上有很大的提升，并且在生成关键字和数据密文时，不需要使用双线性对，极大地降低了计算和存储成本。安全性分析表明，本文中所提出的方案能够满足密文隐私安全性、陷门不可区分性和抗关键字猜测攻击的安全性。效率分析表明，本分提出的方案更加高效。     

Non-chaotic and chaotic propagation of stationary and dynamic images through MVKS turbulence

Anisoplanatic electromagnetic (EM) propagation across a turbulent atmosphere has been recently examined for an unmodulated carrier propagating over an image-bearing transparency through optical lensing, and for the embedded information inside a carrier recovered using heterodyning and digital demodulation. Carrier modulation yielded better recovery than simple lens-based imaging. A possible mitigation strategy is proposed whereby the image information is encrypted on an RF chaotic carrier, thereafter secondarily embedded onto an optical carrier. Results based on the modified von Karman (MVKS) and the Hufnagel-Valley (H-V) models showed that the signal/image recovery under turbulence is improved compared with non-chaotic propagation. The case of time-varying/dynamic images is also taken up; it is demonstrated via cross-correlation products that turbulence is mitigated by the use of chaotic carrier encryption. Overall, transmission via chaos offers mitigation against distortions due to turbulence along with the security feature inherent via the chaos keys which prevent signal recovery without key-matching.     

抵御已知/选择明文攻击的混沌图像加密算法

论文在对现有一类典型图像混沌加密算法的分析基础上,提出了一种改进的图像混沌加密算法。该算法引入小波变换,可以有效地克服一些混沌加密算法不能抵御已知/选择明文攻击的缺陷。     

计算机网络安全系统设计

分析了现代计算机网络所面临的威胁和各种安全问题,同时提出了在设计一个有关网络系统时应该考虑的一些安全问题,如网络安全策略与技术、网络的访问控制、网络数据加密技术、信息隐藏技术等安全问题。     

一种基于m序列的图像随机加密与实时传输方案

提出了一种基于m序列的图像随机加密与实时传输方案。在加密时用m序列构造的相位函数取代了双相位输码方法中用作密钥的随机相位掩模，极大地压缩了密钥的数据量，使密钥的传送更加方便快捷。并在前有基础上加以改进，可以轻松地加密彩色图像。在完成加密后，可实时地在网络上传送加密图像，在接收端进行解密。最后进行了计算机模拟实验，实验结果表明该方案是可行的，并且易于实际应用。     

超细粉碎技术现状及发展趋势

综述了国内外超细粉碎技术及设备的现状、进展,指出了其发展趋势,从工作原理、结构特点等方面详细介绍了超细粉碎典型设备,同时又指出了近年来国内外在此领域中的新进展,基于现存问题指出了今后超细粉碎研究的方向。     

Data compression and encryption using cellular automata transforms

A family of basis functions, generated from the evolving states of Cellular Automata (CA), is used to compress and encrypt data. The operations required in encoding and decoding the data are described under the umbrella Cellular Automata Transforms (CAT). There is a huge number of these transform bases. CAT can be used in the way other mathematical transforms (e.g., Fourier, Discrete Cosine, Laplace, Wavelet, etc.) are utilized. In data-compression applications, the rules and pertinent keys used to generate the CA are selected to favor those that yield basis functions with the best information-packing characteristics. On the other hand, for encryption the selection is biased towards those with the tendency to yield an avalanche effect. In the latter case the transform process must be error-free.     

不同粒度松散煤体的氧扩散特性实验研究

以自行研制的煤对氧扩散特性测试装置为实验手段,在常温环境条件下测试了不同粒度松散煤体对氧的自由扩散特性.实验结果表明:煤样粒度的变化对取气腔氧浓度流出曲线的影响表现出2个极限值,煤样粒度在20～100目之间时,取气腔氧气浓度梯度随煤样粒度的增大而增大;当煤样粒度<20目或>100目时,煤样粒度的再变化对氧浓度流出曲线的影响则微乎其微;取气腔氧浓度曲线流形基本符合指数曲线的变化规律.     

Algebraic properties of cryptosystem PGM

In the late 1970s Magliveras invented a private-key cryptographic system calledPermutation Group Mappings (PGM). PGM is based on the prolific existence of certain kinds of factorization sets, calledlogarithmic signatures, for finite permutation groups. PGM is an endomorphic system with message space ℤ_|G| for a given finite permutation groupG. In this paper we prove several algebraic properties of PGM. We show that the set of PGM transformations ℐ _G is not closed under functional composition and hence not a group. This set is 2-transitive on ℤ_|G| if the underlying groupG is not hamiltonian and not abelian. Moreover, if the order ofG is not a power of 2, then the set of transformations contains an odd permutation. An important consequence of these results is that the group generated by the set of transformations is nearly always the symmetric group ℒ_|G|. Thus, allowing multiple encryption, any permutation of the message space is attainable. This property is one of the strongest security conditions that can be offered by a private-key encryption system. S. S. Magliveras was supported in part by NSF/NSA Grant Number MDA904-82-H0001, by U.S. West Communications, and by the Center for Communication and Information Science of the University of Nebraska.