期刊
IEEE TRANSACTIONS ON CYBERNETICS
卷 46, 期 11, 页码 2622-2633出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2015.2483621
关键词
Arnold's cat map; cryptography; Laplace expansion; n-dimensional (nD) Cat map
类别
资金
- Macau Science and Technology Development Fund [FDCT/017/2012/A1]
- Research Committee at the University of Macau [MYRG2014-00003-FST, MRG017/ZYC/2014/FST, MYRG113(Y1-L3)-FST12-ZYC, MRG001/ZYC/2013/FST]
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(n(4)) 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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据