FPGA implementation and image encryption application of a new PRNG based on a memristive Hopfield neural network with a special activation gradient

A memristive Hopfield neural network(MHNN)with a special activation gradient is proposed by adding a suitable memristor to the Hopfield neural network(HNN)with a special activation gradient.The MHNN is simulated and dynamically analyzed,and implemented on FPGA.Then,a new pseudo-random number generator(PRNG)based on MHNN is proposed.The post-processing unit of the PRNG is composed of nonlinear post-processor and XOR calculator,which effectively ensures the randomness of PRNG.The experiments in this paper comply with the IEEE 754-1985 high precision32-bit floating point standard and are done on the Vivado design tool using a Xilinx XC7 Z020 CLG400-2 FPGA chip and the Verilog-HDL hardware programming language.The random sequence generated by the PRNG proposed in this paper has passed the NIST SP800-22 test suite and security analysis,proving its randomness and high performance.Finally,an image encryption system based on PRNG is proposed and implemented on FPGA,which proves the value of the image encryption system in the field of data encryption connected to the Internet of Things(Io T).     

Pseudo-random number generation for Brownian Dynamics and Dissipative Particle Dynamics simulations on GPU devices

Brownian Dynamics (BD), also known as Langevin Dynamics, and Dissipative Particle Dynamics (DPD) are implicit solvent methods commonly used in models of soft matter and biomolecular systems. The interaction of the numerous solvent particles with larger particles is coarse-grained as a Langevin thermostat is applied to individual particles or to particle pairs. The Langevin thermostat requires a pseudo-random number generator (PRNG) to generate the stochastic force applied to each particle or pair of neighboring particles during each time step in the integration of Newton’s equations of motion. In a Single-Instruction-Multiple-Thread (SIMT) GPU parallel computing environment, small batches of random numbers must be generated over thousands of threads and millions of kernel calls. In this communication we introduce a one-PRNG-per-kernel-call-per-thread scheme, in which a micro-stream of pseudorandom numbers is generated in each thread and kernel call. These high quality, statistically robust micro-streams require no global memory for state storage, are more computationally efficient than other PRNG schemes in memory-bound kernels, and uniquely enable the DPD simulation method without requiring communication between threads.     

基于TD-ERCS混沌系统的伪随机数发生器及其统计特性分析

为了进一步分析切延迟椭圆反射腔映射系统(TD-ERCS)混沌系统的密码学意义上的安全性， 采用TD-ERCS并行方式构造了一个结构简单的伪随机序列发生器.用户密码不再是固定不变的 ，可在［2⁶⁴，2⁶⁷²］区域内任意取值.对所产生的二值伪随机 序列（即TD-ERC S序列）进行了均衡性、游程特性、相关性等基本统计特性初步测试，并与m序列、logistic 序列、Chebyshev混沌序列、SCQC序列作了对比分析.实验表明，TD-ERCS序列有更好的统计 特性. 关键词： 混沌 TD-ERCS PRNG 统计特性     

A two-dimensional analytical method for the transformation crystallography based on vector analysis

A simple 2-D analytical method has been developed for calculating the crystallographic features, including the orientation relationship (OR), habit plane (HP) and the direction and spacing of dislocations in the HP, under the condition that a pair of Burgers vectors from both phases are parallel to each other lying in the HP. In contrast to previous 2-D models for the OR and HP, which are on the plane normal to the parallel Burgers vectors, the present 2-D model is based on vector analysis in the HP. Closed-form expressions for the crystallographic features have been derived as functions of lattice parameter ratios. While the results are in agreement with those from a 2-D method based on the O-line model, the present method is simpler and improves our understanding of crystallographic features.     

基于几何区域分解的三维输运问题并行迭代算法

对三维直角坐标下的输运隐式差分方程,研究了基于几何区域分解的并行迭代算法,给出了串、并行迭代误差估计.并对相关数值结果进行了分析、比较.     

Traveling waves and chaotic properties in cellular automata

Traveling wave solutions of cellular automata (CA) with two states and nearest neighbors interaction on one-dimensional (1-D) infinite lattice are computed. Space and time periods and the number of distinct waves have been computed for all representative rules, and each velocity ranging from 2 to 22. This computation shows a difference between spatially extended systems, generating only temporal chaos and those producing as well spatial complexity. In the first case wavelengths are simply related to the velocity of propagation and the dispersivity is an affine function, while in the second case (which coincides with Wolfram class 3), the dispersivity is multiform and its dependence on the velocities is highly random and discontinuous. This property is typical of space-time chaos in CA. (c) 1999 American Institute of Physics.     

Statistical tests and chaotic synchronization based pseudorandom number generator for string bit sequences with application to image encryption

Recently, a stream encryption scheme using d-bit segment sequences has been proposed. This scheme may generate key avalanche effect. The randomness tests of d-bit segment pseudorandom number generator will be important for implementing such a scheme. Firstly this paper extends Beker and Piper’s binary pseudorandom sequence statistical test suite to d-bit segment sequences case. Secondly, a novel 3-dimensional polynomial discrete chaotic map (3DPDCM) is proposed. The calculated Lyapunov exponents of the 3DPCDM are 0.213, 0.125 and ? 3.228. Using the 3DPDCM constructs a 6-dimensional generalized synchronization chaotic system. Based on this system, a 8-bit segment chaotic pseudorandom number generator (CPRNG) is introduced. Using the generalized test suite tests 100 key streams generated via the 8-bit PRNG with different initial conditions and perturbed system parameters. The tested results are similar to those of the key streams generated via RC4 PRNG. As an application, using the key streams generated via the CPRNG and the RC4 PRNG encrypts an RGB image Landscape. The results have shown that the encrypted RGB images have significant avalanche effects. This research suggests that the requirements for PRNGs are not as strict as those under the traditional avalanche criteria. Suitable designed chaos-based d-bit string PRNGs may be qualified candidates for the stream encryption scheme with avalanche effect.     

A secret image sharing based on neighborhood configurations of 2-D cellular automata

The main goal of this work is to research how neighborhood configurations of two-dimensional cellular automata (2-D CA) can be used to design secret sharing schemes, and then a novel (n, n)-threshold secret image sharing scheme based on 2-D CA is proposed. The basic idea of the scheme is that the original content of a 2-D CA can be reconstructed following a predetermined number of repeated applications of Boolean XOR operation to its neighborhood. The main characteristics of this new scheme are: each shared image has the same size as the original one; the recovered image is exactly the same as the secret image, i.e., there is no loss of resolution or contrast; and the computational complexity is linear. Simulation results and formal analysis demonstrate the correctness and effectiveness of the proposed sharing scheme.     

Sparsely sampled high-resolution 4-D experiments for efficient backbone resonance assignment of disordered proteins

Intrinsically disordered proteins (IDPs) play important roles in many critical cellular processes. Due to their limited chemical shift dispersion, IDPs often require four pairs of resonance connectivities (H(α), C(α), C(β) and CO) for establishing sequential backbone assignment. Because most conventional 4-D triple-resonance experiments share an overlapping C(α) evolution period, combining existing 4-D experiments does not offer an optimal solution for non-redundant collection of a complete set of backbone resonances. Using alternative chemical shift evolution schemes, we propose a new pair of 4-D triple-resonance experiments--HA(CA)CO(CA)NH/HA(CA)CONH--that complement the 4-D HNCACB/HN(CO)CACB experiments to provide complete backbone resonance information. Collection of high-resolution 4-D spectra with sparse sampling and FFT-CLEAN processing enables efficient acquisition and assignment of complete backbone resonances of IDPs. Importantly, because the CLEAN procedure iteratively identifies resonance signals and removes their associating aliasing artifacts, it greatly reduces the dependence of the reconstruction quality on sampling schemes and produces high-quality spectra even with less-than-optimal sampling schemes.     

Performance Analysis of 2-D GRAPPA and Partial Fourier GRAPPA for 3-D MRI

The acquisition time of three-dimensional magnetic resonance imaging (3-D MRI) is too long to tolerate in many clinical applications. At present, parallel MRI (pMRI) and partial Fourier (PF) with homodyne detection, including 2-D pMRI (two-dimensional pMRI) and PF_pMRI (the combination of PF and pMRI), are often used to accelerate data sampling in 3-D MRI. However, the performances of 2-D pMRI and PF_pMRI have been seldom discussed. In this paper, we choose GRAPPA (generalized auto-calibrating partially parallel acquisition) as a representative pMRI to analyze and compare the performances of 2-D GRAPPA and PF_GRAPPA, including the noise standard deviation (SD), root mean-square error (RMSE) and g factor, through a series of in vitro experiments. A series of phantom experiments show that the SD, RMSE and g-factor values of PF_GRAPPA are lower than those of 2-D GRAPPA under the same acceleration factor. It demonstrates that the performance of PF_GRAPPA is better than that of 2-D GRAPPA. PF_GRAPPA can be used in any thickness of imaging slab, while 2-D GRAPPA can only be used in thick slab due to the difficulties in determination of the fitting coefficients which result from imperfect RF pulse. In vivo brain experiment results also show that the performance of PF_GRAPPA is better than that of 2-D GRAPPA.     

Fast Calculation of Computer-Generated Fresnel Hologram Utilizing Distributed Parallel Processing and Array Operation

Fresnel CGH for a three-dimensional (3-D) object is generated by calculating the Fresnel diffraction, but it requires a huge amount of calculation. This is one reason for the difficulty in realizing real-time holography. We propose fast calculation method of computer-generated Fresnel hologram (Fresnel CGH) utilizing distributed parallel processing and array operation. In our method, a projected image with depth information of the 3-D object is prepared to calculate the Fresnel diffraction. The Fresnel diffraction of the projected image is then calculated with depth information by array operation and distributed parallel processing. Parallel processing is realized using JavaSpaces and many standard computers. In our array operation, calculation error in phase distribution on a hologram occurs more than the strict Fresnel diffraction. However, it was confirmed by experiments that the influence of an error can be controlled and ignored. In this paper, our proposed method and some experimental results are shown.     

The parallel complexity of growth models

This paper investigates the parallel complexity of several nonequilibrium growth models.Invasion percolation, Eden growth, ballistic deposition, andsolid-on-solid growth are all seemingly highly sequential processes that yield self-similar or self-affine random clusters. Nonetheless, we present fast parallel randomized algorithms for generating these clusters. The running times of the algorithms scale asO(log² N), whereN is the system size, and the number of processors required scales as a polynomial inN. The algorithms are based on fast parallel procedures for finding minimum-weight paths; they illuminate the close connection between growth models and self-avoiding paths in random environments. In addition to their potential practical value, our algorithms serve to classify these growth models as less complex than other growth models, such asdiffusion-limited aggregation, for which fast parallel algorithms probably do not exist.     

一种全场三维共焦检测的新方法

提出了一种利用微光学阵更合成器件实现全场三维面形并行检测、记录的共焦方法。此方法的关键是，在共焦系统中引入一一微光学耻列合成器件来产生一点光源阵列，实现了对同一一剖面同时并行检测，并首次采用了ＣＣＤ面阵像元取代上孔光阑直接截取三维信息光强。本文讨论了该方法的三信息检测原理，响应关系，给出了初步的实验结果和三维重构图。     

Butterfly interconnection networks and their applications in Walsh-Hadamard transform-based information processing and optical computing

ＢｕｔｔｅｒｆｌｙｉｎｔｅｒｃｏｎｎｅｃｔｉｏｎｎｅｔｗｏｒｋｓａｎｄｔｈｅｉｒａｐｐｌｉｃａｔｉｏｎｓｉｎＷａｌｓｈ－Ｈａｄａｍａｒｄｔｒａｎｓｆｏｒｍ－ｂａｓｅｄｉｎｆｏｒｍａｔｉｏｎｐｒｏｃｅｓｓｉｎｇａｎｄｏｐｔｉｃａｌｃｏｍｐｕｔｉｎｇＨＥ...     

A novel cellular automata based technique for visual multimedia content encryption

This paper proposes a new method for visual multimedia content encryption using Cellular Automata (CA). The encryption scheme is based on the application of an attribute of the CLF XOR filter, according to which the original content of a cellular neighborhood can be reconstructed following a predetermined number of repeated applications of the filter.The encryption is achieved using a key image of the same dimensions as the image being encrypted. This technique is accompanied by the one-time pad (OTP) encryption method, rendering the proposed method reasonably powerful, given the very large number of resultant potential security keys. The method presented here makes encryption possible in cases where there is more than one image with the use of just one key image. A further significant characteristic of the proposed method is that it demonstrates how techniques from the field of image retrieval can be used in the field of image encryption. The proposed method is further strengthened by the fact that the resulting encrypted image for a given key image is different each time. The encryption result depends on the structure of an artificial image produced by the superposition of four 1-D CA time-space diagrams as well as from a CA random number generator.A semi-blind source separation algorithm is used to decrypt the encrypted image. The result of the decryption is a lossless representation of the encrypted image. Simulation results demonstrate the effectiveness of the proposed encryption method. The proposed method is implemented in C# and is available online through the img(Rummager) application.     

改进的3维粒子模拟并行算法

 提出了两种改进的3维粒子模拟并行算法,改进的并行算法能在每个时间步减少一次进程同步。算法分析和数值模拟表明,由于粒子运动路径和发射的初始位置与随机函数有关,只有一种改进的并行算法能保证并行计算正确。在3维粒子模拟软件CHIPIC3D上实现了改进的并行算法,应用CHIPIC3D对一种相对论返波管进行了并行模拟,模拟结果表明改进的并行算法能取得更高的加速比和效率。     

一种分布式内存环境下的并行二分网格加密算法

给出了一个基于ALBERT(Adaptive multi-Level finite element toolbox using Bisection refinement and Error control by Residual Techniques)的并行二分网格加密算法.其目的是开发基于ALBERT的、适合于分布式内存计算机的并行自适应有限元软件包.首先给出了针对ALBERT的并行化策略,然后重点介绍并行网格加密算法,并证明了并行算法和原有串行算法在加密结果上完全等效.最后,数值实验证明该并行算法能有效地在分布式内存的计算机上执行.     

The method of lines solution of discrete ordinates method for non-grey media

A radiation code based on method of lines (MOL) solution of discrete ordinates method (DOM) for radiative heat transfer in non-grey absorbing-emitting media was developed by incorporation of a gas spectral radiative property model, namely wide band correlated-k (WBCK) model, which is compatible with MOL solution of DOM. Predictive accuracy of the code was evaluated by applying it to 1-D parallel plate and 2-D axisymmetric cylindrical enclosure problems containing absorbing-emitting medium and benchmarking its predictions against line-by-line solutions available in the literature. Comparisons reveal that MOL solution of DOM with WBCK model produces accurate results for radiative heat fluxes and source terms and can be used with confidence in conjunction with computational fluid dynamics codes based on the same approach.     

Similarities and differences for light-induced surface plasmons in one- and two-dimensional symmetrical metallic nanostructures

Two types of double-sided nanostructure, one possessing a slit aperture with parallel grooves and the other possessing a circular aperture with concentric grooves, were fabricated to examine the similarities and differences of their diffraction behavior in one-dimensional (1-D) and two-dimensional (2-D) nanostructures. Based on the projection-slice theory, we conjecture that the surface plasmons in these two different nano-scale grooves possess similar modes. A localized surface plasmon (LSP) was used to examine the transmission characteristics induced by the apertures. The transmission characteristics of the slitted nanostructure and the circular nanostructure aperture were then measured. We coupled the transmission spectra measured from these two apertures with a 1-D parallel groove transmission curve simulated by a 1-D rigorous coupled wave analysis. Measured spectra results show reasonable agreement with the simulated data. We propose that the apparent blueshift observed in the peak frequency of a 2-D nanostructure is due to the difference in the shape of the aperture and the spot transmission characteristics of 1-D and 2-D systems as induced by a LSP.