Abstract
Different from existing methods that use matrix multiplications and have high computation complexity, this paper proposes an efficient generation method of n-dimensional (nD) Cat maps using Laplace expansions. New parameters are also introduced to control the spatial configurations of the nD Cat matrix. Thus, the proposed method provides an efficient way to mix dynamics of all dimensions at one time. To investigate its implementations and applications, we further introduce a fast implementation algorithm of the proposed method with time complexity O(n4) and a pseudorandom number generator using the Cat map generated by the proposed method. The experimental results show that, compared with existing generation methods, the proposed method has a larger parameter space and simpler algorithm complexity, generates nD Cat matrices with a lower inner correlation, and thus yields more random and unpredictable outputs of nD Cat maps.
| Original language | English |
|---|---|
| Article number | 7302020 |
| Pages (from-to) | 2622-2633 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Cybernetics |
| Volume | 46 |
| Issue number | 10 |
| DOIs | |
| State | Published - 26 Oct 2015 |
| Externally published | Yes |
Keywords
- Arnold's cat map
- Cryptography
- Laplace expansion
- N-dimensional (nD) Cat map
Fingerprint
Dive into the research topics of 'N-dimensional discrete cat map generation using Laplace expansions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver