A Novel Chaotic Image Encryption using Generalized Threshold Function

In this paper, after reviewing the main points of image encryption and threshold function, we introduce the methods of chaotic image encryption based on pseudorandom bit padding that the bits be generated by the novel generalized threshold function (segmentation and self-similarity) methods. These methods decrease periodic effect of the ergodic dynamical systems in randomness of the chaotic image encryption. The essential idea of this paper is that given threshold functions of the ergodic dynamical systems. To evaluate the security of the cipher image of this scheme, the key space analysis, the correlation of two adjacent pixels and differential attack were performed. This scheme tries to improve the problem of failure of encryption such as small key space and level of security.Comment: 7 pages, 5 figures, Published in international Journal of Computer Applications (March 2012

Using discrete-time hyperchaotic-based asymmetric encryption and decryption keys for secure signal transmission

In this paper, a framework for the synchronization of two non-identical discrete-time hyperchaotic systems, namely the 3D Baier-Klein and the 3D Hitzel-Zele maps, based on the use of hybrid output feedback concept and aggregation techniques, is employed to design a two-channel secure communication system. New sufficient conditions for synchronization are obtained by the use of Borne and Gentina practical criterion for stabilization study associated to the forced arrow form matrix for system description. The efficiency of the proposed approach to confidentially recover the transmitted message signal is shown via an application to the hyperchaotic Baier-Klein and Hitzel-Zele systems, considered as generators of asymmetric encryption and decryption keys

Still Wrong Use of Pairings in Cryptography

Several pairing-based cryptographic protocols are recently proposed with a wide variety of new novel applications including the ones in emerging technologies like cloud computing, internet of things (IoT), e-health systems and wearable technologies. There have been however a wide range of incorrect use of these primitives. The paper of Galbraith, Paterson, and Smart (2006) pointed out most of the issues related to the incorrect use of pairing-based cryptography. However, we noticed that some recently proposed applications still do not use these primitives correctly. This leads to unrealizable, insecure or too inefficient designs of pairing-based protocols. We observed that one reason is not being aware of the recent advancements on solving the discrete logarithm problems in some groups. The main purpose of this article is to give an understandable, informative, and the most up-to-date criteria for the correct use of pairing-based cryptography. We thereby deliberately avoid most of the technical details and rather give special emphasis on the importance of the correct use of bilinear maps by realizing secure cryptographic protocols. We list a collection of some recent papers having wrong security assumptions or realizability/efficiency issues. Finally, we give a compact and an up-to-date recipe of the correct use of pairings.Comment: 25 page

A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application to Watermarking

In this paper, a new chaotic pseudo-random number generator (PRNG) is proposed. It combines the well-known ISAAC and XORshift generators with chaotic iterations. This PRNG possesses important properties of topological chaos and can successfully pass NIST and TestU01 batteries of tests. This makes our generator suitable for information security applications like cryptography. As an illustrative example, an application in the field of watermarking is presented.Comment: 11 pages, 7 figures, In WISM 2010, Int. Conf. on Web Information Systems and Mining, volume 6318 of LNCS, Sanya, China, pages 202--211, October 201