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)).     

Breeding schemes with optimum-contribution selection or truncation selection for beef cattle destined for use on dairy females

We tested the hypothesis that the size of a beef cattle population destined for use on dairy females is smaller under optimum-contribution selection (OCS) than under truncation selection (TRS) at the same genetic gain (ΔG) and the same rate of inbreeding (ΔF). We used stochastic simulation to estimate true ΔG realized at a 0.005 ΔF in breeding schemes with OCS or TRS. The schemes for the beef cattle population also differed in the number of purebred offspring per dam and the total number of purebred offspring per generation. Dams of the next generation were exclusively selected among the one-year-old heifers. All dams were donors for embryo transfer and produced a maximum of 5 or 10 offspring. The total number of purebred offspring per generation was: 400, 800, 1,600 or 4,000 calves, and it was used as a measure of population size. Rate of inbreeding was predicted and controlled using pedigree relationships. Each OCS (TRS) scheme was simulated for 10 discrete generations and replicated 100 (200) times. The OCS scheme and the TRS scheme with a maximum of 10 offspring per dam required approximately 783 and 1,257 purebred offspring per generation to realize a true ΔG of €14 and a ΔF of 0.005 per generation. Schemes with a maximum of 5 offspring per dam required more purebred offspring per generation to realize a similar true ΔG and a similar ΔF. Our results show that OCS and multiple ovulation and embryo transfer act on selection intensity through different mechanisms to achieve fewer selection candidates and fewer selected sires and dams than under TRS at the same ΔG and a fixed ΔF. Therefore, we advocate the use of a breeding scheme with OCS and multiple ovulation and embryo transfer for beef cattle destined for use on dairy females because it is favorable both from an economic perspective and a carbon footprint perspective.     

Inversion,chemical complexity,and interstitial transport in spinels

Spinels with the generic chemical formula AB₂O₄ have potential applications in nuclear energy and batteries. In both cases, their functionality is related to mass transport through the crystal. Here, using long-time atomistic simulations, we examine the impact of the cation structure on interstitial transport in two spinel chemistries, inverse MgGa₂O₄ and double MgAlGaO₄. We emphasize two aspects of the transport properties: the unit mechanisms that are described by individual barriers, for which we introduce pole-figure-like plots, and the aggregate behavior of those unit mechanisms. Compared to previous work on normal spinels, we find that inversion significantly reduces the rate of interstitial transport in these structures and has an impact on the stability of defects as they move through the lattice. In particular, B cation interstitials are found to be kinetically stable only in the inverse MgGa₂O₄. These results provide new insight into relationship between structure, chemistry, and transport in spinels.     

Ferroelectric and electromechanical performance of diverse engineered states of Mn-doped 0.75Pb(Mg1/3Nb2/3)O3-0.25PbTiO3 ceramics

The materials processing history has a great influence on their properties and finally determines their application effect. In this paper, the ferroelectric, polarization-switching current, and strain properties of Mn-doped 0.75Pb(Mg_1/3Nb_2/3)O₃-0.25PbTiO₃ ceramics were studied in fresh state, aged state, and poled state, respectively. Compared with the symmetric polarization-electric-field (P-E) hysteresis loops, current-density-electric-field (J-E) curves, and bipolar electric-field-induced strain (S-E) curves in fresh state samples, asymmetric P-E loops, J-E curves, and bipolar S-E curves were obtained in poled state samples. Well-aged-state samples exhibit double hysteresis P-E loop, four peaks J-E curves, and symmetric S-E curves without negative strain. The symmetry-conforming short-range order (SC-SRO) principle of point defects and internal electric field E_i is employed to clarify the different phenomenon of three states. Results indicated that randomly oriented defect polarization P_D in aged samples can reverse the spontaneous polarization P_S back and result in the double hysteresis P-E loop and four peaks J-E curves. The oriented P_D and resulting E_i in poled-state samples will lead to the asymmetric loops and strain memory effect.     

基于秩序与非秩序理论的文创产品卡通形象设计研究

目的 从秩序与非秩序理论出发,研究文创产品卡通形象的设计方法.方法 对秩序与非秩序理论的视觉机制和创制理论进行梳理,结合实例,阐述了其与文创产品卡通形象设计之间的联系,分析文创产品卡通形象中的秩序与非秩序的表现形式,提出基于秩序与非秩序理论文创产品卡通形象设计的主要原则,归纳出一套基于秩序与非秩序理论的文创产品卡通形象设计流程与方法,指导设计实践,并验证这些理论方法在设计实践中有效性与可行性.结论 通过对秩序与非秩序理论的研究,文创产品卡通形象设计时应注意提高辨识度、亲和力和便于衍生设计的原则.探索基于秩序与非秩序理论的设计流程与方法,按照界定主题、主体形象设计、主体形象拓展、衍生品应用四个环节开展整体方案设计,为文创产品卡通形象设计提供新的思路与方法.     

Low area field-programmable gate array implementation of PRESENT image encryption with key rotation and substitution

Lightweight ciphers are increasingly employed in cryptography because of the high demand for secure data transmission in wireless sensor network, embedded devices, and Internet of Things. The PRESENT algorithm as an ultra-lightweight block cipher provides better solution for secure hardware cryptography with low power consumption and minimum resource. This study generates the key using key rotation and substitution method, which contains key rotation, key switching, and binary-coded decimal-based key generation used in image encryption. The key rotation and substitution-based PRESENT architecture is proposed to increase security level for data stream and randomness in cipher through providing high resistance to attacks. Lookup table is used to design the key scheduling module, thus reducing the area of architecture. Field-programmable gate array (FPGA) performances are evaluated for the proposed and conventional methods. In Virtex 6 device, the proposed key rotation and substitution PRESENT architecture occupied 72 lookup tables, 65 flip flops, and 35 slices which are comparably less to the existing architecture.     

Reduced‐order method for mathematical modeling of multiphase dc‐dc converter

A multiphase dc‐dc converter is effective for miniaturization and achieving high‐power density in a switching power supply. However, its mathematical modeling becomes complex as the phase number of the circuit increases. This study proposes a new modeling method to derive a reduced‐order method in a simple manner. The frequency characteristics of the reduced‐order model are fit to those of the original mathematical model of the multiphase dc‐dc converter. Therefore, the efficacy of the proposed method is validated.     

A charge sharing–based switching scheme for SAR ADCs

This paper presents an energy-efficient switching scheme for successive approximation register (SAR) analogue-to-digital converter (ADC). The proposed scheme employs charge recycling method to keep the capacitor arrays free of transitional energy between bit generations except reset phase. In comparison with the conventional switching scheme, the proposed one achieves 100% transitional energy saving without considering reset phase. In addition, configuration of a 10-bit SAR ADC shows that the proposed switching scheme reduces the capacitor area by 25% compared with the conventional switching scheme.     

Location Privacy in Device-Dependent Location-Based Services: Challenges and Solution

With the evolution of location-based services (LBS), a new type of LBS has already gain a lot of attention and implementation, we name this kind of LBS as the Device-Dependent LBS (DLBS). In DLBS, the service provider (SP) will not only send the information according to the user’s location, more significant, he also provides a service device which will be carried by the user. DLBS has been successfully practised in some of the large cities around the world, for example, the shared bicycle in Beijing and London. In this paper, we, for the first time, blow the whistle of the new location privacy challenges caused by DLBS, since the service device is enabled to perform the localization without the permission of the user. To conquer these threats, we design a service architecture along with a credit system between DLBS provider and the user. The credit system tie together the DLBS device usability with the curious behaviour upon user’s location privacy, DLBS provider has to sacrifice their revenue in order to gain extra location information of their device. We make the simulation of our proposed scheme and the result convince its effectiveness.     

Numerical analysis of history-dependent hemivariational inequalities and applications to viscoelastic contact problems with normal penetration

In this paper numerical approximation of history-dependent hemivariational inequalities with constraint is considered, and corresponding Céa’s type inequality is derived for error estimate. For a viscoelastic contact problem with normal penetration, an optimal order error estimate is obtained for the linear element method. A numerical experiment for the contact problem is reported which provides numerical evidence of the convergence order predicted by the theoretical analysis.