Comparative study of two pseudo chaotic number generators for securing the IoT
| Title | Comparative study of two pseudo chaotic number generators for securing the IoT |
| Publication Type | Conference Paper |
| Year of Publication | 2016 |
| Authors | Jallouli, O., Abutaha, M., Assad, S. E., Chetto, M., Queudet, A., Deforges, O. |
| Conference Name | 2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI) |
| Date Published | Sept. 2016 |
| Publisher | IEEE |
| ISBN Number | 978-1-5090-2029-4 |
| Keywords | binary diffusion matrix, Bit rate, chaotic communication, chaotic cryptography, Ciphers, composability, coupled chaotic maps, cryptographically strong pseudo random number generators, cryptography, generation time, Generators, Informatics, Information security, Internet of Things, IoT, logistic map, Metrics, network security applications, NIST, nonlinear functions, nonlinear recursive filters, PCNG2, piece-wise linear chaotic map, piecewise linear techniques, PRNGs, pseudo chaotic number generators, pubcrawl, PWLCmap, random number generation, recursive filters, Resiliency, second pseudo chaotic number generator, Skew Tent map, STmap |
| Abstract | The extremely rapid development of the Internet of Things brings growing attention to the information security issue. Realization of cryptographically strong pseudo random number generators (PRNGs), is crucial in securing sensitive data. They play an important role in cryptography and in network security applications. In this paper, we realize a comparative study of two pseudo chaotic number generators (PCNGs). The First pseudo chaotic number generator (PCNG1) is based on two nonlinear recursive filters of order one using a Skew Tent map (STmap) and a Piece-Wise Linear Chaotic map (PWLCmap) as non linear functions. The second pseudo chaotic number generator (PCNG2) consists of four coupled chaotic maps, namely: PWLCmaps, STmap, Logistic map by means a binary diffusion matrix [D]. A comparative analysis of the performance in terms of computation time (Generation time, Bit rate and Number of needed cycles to generate one byte) and security of the two PCNGs is carried out. |
| URL | https://ieeexplore.ieee.org/document/7732234/ |
| DOI | 10.1109/ICACCI.2016.7732234 |
| Citation Key | jallouli_comparative_2016 |
- pubcrawl
- NIST
- nonlinear functions
- nonlinear recursive filters
- PCNG2
- piece-wise linear chaotic map
- piecewise linear techniques
- PRNGs
- pseudo chaotic number generators
- network security applications
- PWLCmap
- random number generation
- recursive filters
- Resiliency
- second pseudo chaotic number generator
- Skew Tent map
- STmap
- generation time
- Bit rate
- chaotic communication
- chaotic cryptography
- Ciphers
- composability
- coupled chaotic maps
- cryptographically strong pseudo random number generators
- Cryptography
- binary diffusion matrix
- Generators
- Informatics
- information security
- Internet of Things
- IoT
- logistic map
- Metrics