A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption

Yang, Xiuping; Min, Lequan; Wang, Xue

doi:10.1063/1.4917380

Title: A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption

Full Record
Other Related Research

Abstract

This paper sets up a chaos criterion theorem on a kind of cubic polynomial discrete maps. Using this theorem, Zhou-Song's chaos criterion theorem on quadratic polynomial discrete maps and generalized synchronization (GS) theorem construct an eight-dimensional chaotic GS system. Numerical simulations have been carried out to verify the effectiveness of theoretical results. The chaotic GS system is used to design a chaos-based pseudorandom number generator (CPRNG). Using FIPS 140-2 test suit/Generalized FIPS 140-2, test suit tests the randomness of two 1000 key streams consisting of 20 000 bits generated by the CPRNG, respectively. The results show that there are 99.9%/98.5% key streams to have passed the FIPS 140-2 test suit/Generalized FIPS 140-2 test. Numerical simulations show that the different keystreams have an average 50.001% same codes. The key space of the CPRNG is larger than 2{sup 1345}. As an application of the CPRNG, this study gives an image encryption example. Experimental results show that the linear coefficients between the plaintext and the ciphertext and the decrypted ciphertexts via the 100 key streams with perturbed keys are less than 0.00428. The result suggests that the decrypted texts via the keystreams generated via perturbed keys of the CPRNG are almost completely independent onmore »« less

Authors:

Yang, Xiuping; Min, Lequan; Wang, Xue ^[1]

Schools of Mathematics and Physics, University of Science and Technology Beijing, Beijing 100083 (China)

Publication Date:: Fri May 15 00:00:00 EDT 2015

OSTI Identifier:: 22402555

Resource Type:: Journal Article

Journal Name:: Chaos (Woodbury, N. Y.)

Additional Journal Information:: Journal Volume: 25; Journal Issue: 5; Other Information: (c) 2015 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA); Journal ID: ISSN 1054-1500

Country of Publication:: United States

Language:: English

Subject:: 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; CHAOS THEORY; COMPUTER CODES; COMPUTERIZED SIMULATION; CRYPTOGRAPHY; IMAGES; MAPS; POLYNOMIALS; RANDOMNESS; STREAMS; SYNCHRONIZATION

Citation Formats


                    Yang, Xiuping, Min, Lequan, and Wang, Xue. A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption.  United States: N. p., 2015. 
        Web.  doi:10.1063/1.4917380.

Copy to clipboard


                    Yang, Xiuping, Min, Lequan, & Wang, Xue. A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption.  United States.  https://doi.org/10.1063/1.4917380

Copy to clipboard


                    Yang, Xiuping, Min, Lequan, and Wang, Xue. 2015.  
        "A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption".  United States.  https://doi.org/10.1063/1.4917380.

Copy to clipboard


                    
@article{osti_22402555,

  title        = {A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption},

  author       = {Yang, Xiuping and Min, Lequan and Wang, Xue},

  abstractNote = {This paper sets up a chaos criterion theorem on a kind of cubic polynomial discrete maps. Using this theorem, Zhou-Song's chaos criterion theorem on quadratic polynomial discrete maps and generalized synchronization (GS) theorem construct an eight-dimensional chaotic GS system. Numerical simulations have been carried out to verify the effectiveness of theoretical results. The chaotic GS system is used to design a chaos-based pseudorandom number generator (CPRNG). Using FIPS 140-2 test suit/Generalized FIPS 140-2, test suit tests the randomness of two 1000 key streams consisting of 20 000 bits generated by the CPRNG, respectively. The results show that there are 99.9%/98.5% key streams to have passed the FIPS 140-2 test suit/Generalized FIPS 140-2 test. Numerical simulations show that the different keystreams have an average 50.001% same codes. The key space of the CPRNG is larger than 2{sup 1345}. As an application of the CPRNG, this study gives an image encryption example. Experimental results show that the linear coefficients between the plaintext and the ciphertext and the decrypted ciphertexts via the 100 key streams with perturbed keys are less than 0.00428. The result suggests that the decrypted texts via the keystreams generated via perturbed keys of the CPRNG are almost completely independent on the original image text, and brute attacks are needed to break the cryptographic system.},

  doi          = {10.1063/1.4917380},

  url          = {https://www.osti.gov/biblio/22402555},
  journal      = {Chaos (Woodbury, N. Y.)},

  issn         = {1054-1500},

  number       = 5,

  volume       = 25,

  place        = {United States},

  year         = {Fri May 15 00:00:00 EDT 2015},

  month        = {Fri May 15 00:00:00 EDT 2015}

}

Copy to clipboard

Journal Article:

https://doi.org/10.1063/1.4917380

Other availability

Find in Google Scholar

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

A quantum encryption design featuring confusion, diffusion, and mode of operation

Journal Article Hu, Zixuan; Kais, Sabre - Scientific Reports

Abstract Quantum cryptography—the application of quantum information processing and quantum computing techniques to cryptography has been extensively investigated. Two major directions of quantum cryptography are quantum key distribution (QKD) and quantum encryption, with the former focusing on secure key distribution and the latter focusing on encryption using quantum algorithms. In contrast to the success of the QKD, the development of quantum encryption algorithms is limited to designs of mostly one-time pads (OTP) that are unsuitable for most communication needs. In this work we propose a non-OTP quantum encryption design utilizing a quantum state creation process to encrypt messages. As essentiallymore »« less
https://doi.org/10.1038/s41598-021-03241-8
Nonlinear dynamics and cryptosystem

Journal Article Liu, Y - AIP Conference Proceedings

In this paper, a new cryptosystem using dynamical systems is introduced which features storing information in stable configurations of dynamical systems but representing the information in arbitrary configurations of dynamical systems. The message {ital p} in a plaintext can be considered as a stable configuration of a dynamical system. The encrypted string of {ital p} in a ciphertext is an arbitrary configuration which will lead the dynamical system to the attractor defined by the original string {ital p}. The encryption procedure, {ital C}={ital E}({ital p}), treats a string in a plaintext as an attractor of a finite dynamical system, andmore »« less
https://doi.org/10.1063/1.51015
Stateless and stateful implementations of faithful execution

Patent Pierson, Lyndon; Witzke, Edward; Tarman, Thomas; ...

A faithful execution system includes system memory, a target processor, and protection engine. The system memory stores a ciphertext including value fields and integrity fields. The value fields each include an encrypted executable instruction and the integrity fields each include an encrypted integrity value for determining whether a corresponding one of the value fields has been modified. The target processor executes plaintext instructions decoded from the ciphertext while the protection engine is coupled between the system memory and the target processor. The protection engine includes logic to retrieve the ciphertext from the system memory, decrypt the value fields into themore »« less
Full Text Available
On the adaptivity and complexity embedded into differential evolution

Journal Article Senkerik, Roman; Pluhacek, Michal; Jasek, Roman; ... - AIP Conference Proceedings

This research deals with the comparison of the two modern approaches for evolutionary algorithms, which are the adaptivity and complex chaotic dynamics. This paper aims on the investigations on the chaos-driven Differential Evolution (DE) concept. This paper is aimed at the embedding of discrete dissipative chaotic systems in the form of chaotic pseudo random number generators for the DE and comparing the influence to the performance with the state of the art adaptive representative jDE. This research is focused mainly on the possible disadvantages and advantages of both compared approaches. Repeated simulations for Lozi map driving chaotic systems were performedmore »« less
https://doi.org/10.1063/1.4951913
A DES ASIC Suitable for Network Encryption at 10 Gbps and Beyond

Conference Gass, Karl; Pierson, Lyndon; Robertson, Perry; ...

The Sandia National Laboratories (SNL) Data Encryption Standard (DES) Application Specific Integrated Circuit (ASIC) is the fastest known implementation of the DES algorithm as defined in the Federal Information Processing Standards (FIPS) Publication 46-2. DES is used for protecting data by cryptographic means. The SNL DES ASIC, over 10 times faster than other currently available DES chips, is a high-speed, filly pipelined implementation offering encryption, decryption, unique key input, or algorithm bypassing on each clock cycle. Operating beyond 105 MHz on 64 bit words, this device is capable of data throughputs greater than 6.7 Billion bits per second (tester limited).more »« less
Full Text Available

Similar Records