Fast Chaotic Encryption Scheme Based on Separable Moments and Parallel Computing

In this paper, we propose three novel image encryption algorithms. Separable moments and parallel computing are combined in order to enhance the security aspect and time performance. The three proposed algorithms are based on TKM (Tchebichef-Krawtchouk moments), THM (Tchebichef- Hahn moments) and KHM (Krawtchouk-Hahn moments) respectively. A novel chaotic scheme is introduced, which allows for the encryption steps to run si multaneously. The proposed algorithms are tested under several criteria and the experimental results show a remarkable resilience against all well-known attacks. Furthermore, the novel parallel encryption scheme exhibits a drastic improvement in the time performance. The proposed algorithms are compared to the state-of-the-art methods and they stand out as a promising choice for reliable use in real world applications.

Multi-dimensional cubic symmetric block cipher algorithm for encrypting big data

The advanced technology in the internet and social media, communication companies, health care records and cloud computing applications made the data around us increase dramatically every minute and continuously. These renewals big data involve sensitive information such as password, PIN number, credential numbers, secret identifications and etc. which require maintaining with some high secret procedures. The present paper involves proposing a secret multi-dimensional symmetric cipher with six dimensions as a cubic algorithm. The proposed algorithm works with the substitution permutation network (SPN) structure and supports a high processing data rate in six directions. The introduced algorithm includes six symmetry rounds transformations for encryption the plaintext, where each dimension represents an independent algorithm for big data manipulation. The proposed cipher deals with parallel encryption structures of the 128-bit data block for each dimension in order to handle large volumes of data. The submitted cipher compensates for six algorithms working simultaneously each with 128-bit according to various irreducible polynomials of order eight. The round transformation includes four main encryption stages where each stage with a cubic form of six dimensions.

Parallel Encryption of Noisy Images Based on Sequence Generator and Chaotic Measurement Matrix

With the rapid development of information technology in today’s society, the security of transmission and the storage capacity of hardware are increasingly required in the process of image transmission. Compressed sensing technology can achieve data sampling and compression at the rate far lower than that of the Nyquist sampling theorem and can effectively improve the efficiency of information transmission. Aiming at the problem of weak security of compressed sensing, this study combines the cryptographic characteristics of chaotic systems with compressed sensing technology. In the actual research process, the existing image encryption technology needs to be applied to the hardware. This paper focuses on the combination of image encryption based on compressed sensing and digital logic circuits. We propose a novel technology of parallel image encryption based on a sequence generator. It uses a three-dimensional chaotic map with multiple stability to generate a measurement matrix. This study also analyzes the effectiveness, reliability, and security of the parallel encryption algorithm for source noise pollution with different distribution characteristics. Simulation results show that parallel encryption technology can effectively improve the efficiency of information transmission and greatly enhance its security through key space expansion.

Signcryption schemes with insider security in an ideal permutation model

Signcryption aims to provide both confidentiality and authentication of messages more efficiently than performing encryption and signing independently. The “Commit-then-Sign & Encrypt” (CtS&E) method allows to perform encryption and signing in parallel. Parallel execution of cryptographic algorithms decreases the computation time needed to signcrypt messages. CtS&E uses weaker cryptographic primitives in a generic way to achieve a strong security notion of signcryption. Various message pre-processing schemes, also known as message padding, have been used in signcryption as a commitment scheme in CtS&E. Due to its elegance and versatility, the sponge structure turns out to be a useful tool for designing new padding schemes such as SpAEP [T. K. Bansal, D. Chang and S. K. Sanadhya, Sponge based CCA2 secure asymmetric encryption for arbitrary length message, Information Security and Privacy – ACISP 2015, Lecture Notes in Comput. Sci. 9144, Springer, Berlin 2015, 93–106], while offering further avenues for optimization and parallelism in the context of signcryption. In this work, we design a generic and efficient signcryption scheme featuring parallel encryption and signature on top of a sponge-based message-padding underlying structure. Unlike other existing schemes, the proposed scheme also supports arbitrarily long messages. We prove the construction secure when instantiated from weakly secure asymmetric primitives such as a trapdoor one-way encryption and a universal unforgeable signature. With a careful analysis and simple tweaks, we demonstrate how different combinations of weakly secure probabilistic and deterministic encryption and signature schemes can be used to construct a strongly secure signcryption scheme, further broadening the choices of underlying primitives to cover essentially any combination thereof. To the best of our knowledge, this is the first signcryption scheme based on the sponge structure that also offers strong security using weakly secure underlying asymmetric primitives, even deterministic ones, along with the ability to handle long messages, efficiently.