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

Unconditionally Secure Oblivious Polynomial Evaluation: A Survey and New Results

Oblivious polynomial evaluation (OPE) is a two-party protocol that allows a receiver, R to learn an evaluation f(α), of a sender, S's polynomial f(x), whilst keeping both α and f(x) private. This protocol has attracted a lot of attention recently, as it has wide ranging applications in the field of cryptography. In this article we review some of these applications and, additionally, take an in-depth look at the special case of information theoretic OPE. Specifically, we provide a current and critical review of the existing information theoretic OPE protocols in the literature. We divide these protocols into two distinct cases (three-party and distributed OPE) allowing for the easy distinction and classification of future information theoretic OPE protocols. In addition to this work, we also develop several modifications and extensions to existing schemes, resulting in increased security, flexibility and efficiency. Lastly, we also identify a security flaw in a previously published OPE scheme.     

一种无证书签名方案的分析和改进

本文介绍了无证书签名的基本工作原理,介绍并分析了Hashimoto等人提出的一种无证书签名方案,对该方案进行了Ⅰ类型攻击,证明了该方案是不安全的,不能抵御超Ⅰ类型对手的攻击,对该方案提出了改进措施。     

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.     

A new linearly constrained minimum variance beamformer for reconstructing EEG sparse sources

Brain source imaging based on EEG aims to reconstruct the neural activities producing the scalp potentials. This includes solving the forward and inverse problems. The aim of the inverse problem is to estimate the activity of the brain sources based on the measured data and leadfield matrix computed in the forward step. Spatial filtering, also known as beamforming, is an inverse method that reconstructs the time course of the source at a particular location by weighting and linearly combining the sensor data. In this paper, we considered a temporal assumption related to the time course of the source, namely sparsity, in the Linearly Constrained Minimum Variance (LCMV) beamformer. This assumption sounds reasonable since not all brain sources are active all the time such as epileptic spikes and also some experimental protocols such as electrical stimulations of a peripheral nerve can be sparse in time. Developing the sparse beamformer is done by incorporating L1-norm regularization of the beamformer output in the relevant cost function while obtaining the filter weights. We called this new beamformer SParse LCMV (SP-LCMV). We compared the performance of the SP-LCMV with that of LCMV for both superficial and deep sources with different amplitudes using synthetic EEG signals. Also, we compared them in localization and reconstruction of sources underlying electric median nerve stimulation. Results show that the proposed sparse beamformer can enhance reconstruction of sparse sources especially in the case of sources with high amplitude spikes.     

Classic and inverse compositional Gauss-Newton in global DIC

Today, effective implementations of digital image correlation (DIC) are based on iterative algorithms with constant linear operators. A relevant idea of the classic finite element (or, more generally, global) DIC solver consists in replacing the gradient of the deformed state image with that of the reference image, so as to obtain a constant operator. Different arguments (small strains, small deformations, equality of the two gradients close to the solution, etc) have been given in the literature to justify this approximation, but none of them are fully accurate. Indeed, the convergence of the optimization algorithm has to be investigated from its ability to produce descent directions. Through such a study, this paper attempts to explain why this approximation works and what is its domain of validity. Then, an inverse compositional Gauss-Newton implementation of finite element DIC is proposed as a cost-effective and mathematically sound alternative to this approximation.     

Controlled Secure Direct Communication Protocol via the Three-Qubit Partially Entangled Set of States

In this paper, we first re-examine the previous protocol of controlled quantum secure direct communication of Zhang et al.’s scheme, which was found insecure under two kinds of attacks, fake entangled particles attack and disentanglement attack. Then, by changing the party of the preparation of cluster states and using unitary operations, we present an improved protocol which can avoid these two kinds of attacks. Moreover, the protocol is proposed using the three-qubit partially entangled set of states. It is more efficient by only using three particles rather than four or even more to transmit one bit secret information. Given our using state is much easier to prepare for multiqubit states and our protocol needs less measurement resource, it makes this protocol more convenient from an applied point of view.     

Fox Hunting in Wild Apples: Searching for Novel Genes in Malus Sieversii

Malus sieversii is considered the progenitor of modern apple (Malus pumila) cultivars and to represent a valuable source of genetic diversity. Despite the importance of M. sieversii as a source of disease resistance, stress tolerance, and novel fruit traits, little is known about gene function and diversity in M. sieversii. Notably, a publicly annotated genome sequence for this species is not available. In the current study, the FOX (Full-length cDNA OvereXpressing) gene hunting system was used to construct a library of transgenic lines of Arabidopsis in which each transgenic line overexpresses a full-length gene obtained from a cDNA library of the PI619283 accession of M. sieversii. The cDNA library was constructed from mRNA obtained from bark tissues collected in late fall–early winter, a time at which many abiotic stress-adaptative genes are expressed. Over 4000 apple FOX Arabidopsis lines have been established from the pool of transgenic seeds and cDNA inserts corresponding to various Gene Ontology (GO) categories have been identified. A total of 160 inserts appear to be novel, with no or limited homology to M. pumila, Arabidopsis, or poplar. Over 1300 lines have also been screened for freezing resistance. The constructed library of transgenic lines provides a valuable genetic resource for exploring gene function and diversity in Malus sieversii. Notably, no such library of t-DNA lines currently exists for any Malus species.     

一种二线制无极性数字称重传感器

现有的数字传感器至少由2根数据线和2根电源线共4根线组成,每根线均有明确的分工和极性,不能接错和短路,否则易损坏设备,需专业人员才能安装和维护;数据传输加密方式有限,易破解。利用本公司研发的"智能终端整机供电用二线制数据/电源共线传输装置及方法",将数字传感器的连线减至2根,且无极性、可短路,简化了系统的连接,提高系统的可靠性,使安装和维护变得极为简便。数据传输采用特殊的加密方式,极难破解。     

A proposed expert system for word sense disambiguation: deductive ambiguity resolution based on data mining and forward chaining

One of the major issues in the process of machine translation is the problem of choosing the proper translation for a multi‐sense word referred to as word sense disambiguation (WSD). Two commonly used approaches to this problem are statistical and example‐based methods. In statistical methods, ambiguity resolution is mostly carried out by making use of some statistics extracted from previously translated documents or dual corpora of source and target languages. Example‐based methods follow a similar approach as they also make use of bilingual corpora. However, they perform the task of matching at run‐time (i.e. online matching). In this paper, by looking at the WSD problem from a different viewpoint, we propose a system, which consists of two main parts. The first part includes a data mining algorithm, which runs offline and extracts some useful knowledge about the co‐occurrences of the words. In this algorithm, each sentence is imagined as a transaction in Market Basket Data Analysis problem, and the words included in a sentence play the role of purchased items. The second part of the system is an expert system whose knowledge base consists of the set of association rules generated by the first part. Moreover, in order to deduce the correct senses of the words, we introduce an efficient algorithm based on forward chaining in order to be used in the inference engine of the proposed expert system. The encouraging performance of the system in terms of precision and recall as well as its efficiency will be analysed and discussed through a set of experiments.