The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
A Novel Pseudo-random Number Generator Based on Discrete Chaotic Iterations
INTERNET '09 Proceedings of the 2009 First International Conference on Evolving Internet
Randomness Quality of CI Chaotic Generators: Applications to Internet Security
INTERNET '10 Proceedings of the 2010 2nd International Conference on Evolving Internet
Steganography: A Class of Algorithms having Secure Properties
IIH-MSP '11 Proceedings of the 2011 Seventh International Conference on Intelligent Information Hiding and Multimedia Signal Processing
Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding
IEEE Transactions on Information Forensics and Security
Lyapunov Exponent Evaluation of a Digital Watermarking Scheme Proven to be Secure
IIH-MSP '12 Proceedings of the 2012 Eighth International Conference on Intelligent Information Hiding and Multimedia Signal Processing
Practical Internet voting system
Journal of Network and Computer Applications
| Hi-index | 0.00 |
The design and engineering of original cryptographic solutions is a major concern to provide secure information systems. In a previous study, we have described a generator based on chaotic iterations, which uses the well-known XORshift generator. By doing so, we have improved the statistical performances of XORshift and make it behave chaotically, as defined by Devaney. The speed and security of this former generator have been improved in a second study, to make its usage more relevant in the Internet security context. In this paper, these contributions are summarized and a new version of the generator is introduced. It is based on a new Lookup Table implying a large improvement of speed. A comparison and a security analysis between the XORshift and these three versions of our generator are proposed, and various new statistical results are given. Finally, an application in the information hiding framework is presented, to give an illustrative example of the use of such a generator in the Internet security field.