Documente Academic
Documente Profesional
Documente Cultură
1, 1 January 2010
Annotations for symmetric probabilistic encryption algorithm based on chaotic attractors of neural networks
LIU Nian-sheng1**, and GUO Dong-hui2
1. School of Computer Engineering, Jimei University, Xiamen 361021, China
2. School of Information Science and Technology, Xiamen University, Xiamen 361005, China
then
~
T= HTH = T ,
(1)
~
S = S H = S .
(2)
This work has been supported by the National Natural Science Foundation of China (No. 60076015), the Key Science Project of Fujian Province
in China (No. 2009H0037), the Science Project of Xiamen City in China (No. 3502Z20081073), and the Foundation for Young Professors of Jimei
University in China (No. 2006B003).
**
E-mail:nsliu@jmu.edu.cn
There are rotation matrices in both standard and generalized permutation matrices. For example, the unit matrix and
its some equivalent matrices are all rotation matrices[10].
Hence, a novel annotation is proposed for the symmetric
probabilistic encryption scheme based on chaotic attractors
of neural networks in order to avoid the equivalent keys.
Annotation 1. The permutation matrix H as a key can not be
a rotation matrix.
In order to avoid the equivalent key in the proposed
scheme, the following theorem will be proved firstly.
Theorem 1. For two different random permutation matrices
~
H1and H2, if none of H1, H2 or H1 H 2 is a rotation matrix,
~
where H1and H2 Rnn, and H2 is the transpose of H2, H1
and H2 are not the equivalent keys.
Proof: For two arbitrary different random permutation matrices H1and H2, we assume that they are equivalent keys.
Hence,
~
T= H1TH1 ,
~
T= H2TH2 ,
(3)
(4)
~
~
where H1 and H2 are the transpose of H1and H2, respectively. Eq.(4) can be expressed as
~
~
~
H 2TH2 = H 2 H 2TH 2 H2 .
(5)
~
H 2 H2 = I ,
(6)
~
T = H2TH2 .
(7)
~
~
T= H1 H2TH 2 H1 .
(8)
~
~
~
Let H 3 = H1 H 2 . Then H 3 = H 2 H1 . Substitute it into Eq.(8)
~
T= H3TH 3 .
(9)
~
where H is the transpose of H.
(10)
(11)
LIU et al.
Because H is a standard permutation matrix, H-1, the inverse matrix of H, is also a standard permutation matrix according to the properties of a standard permutation matrix.
~
Hence, H =H-1 is a standard permutation matrix too.
According to the definition of a standard permutation
matrix, each row and each column both have only one non~
zero element which is equal to 1. So, vH only changes the
order of 0and 1in . However, the numbers of 0
~
and 1in each row and each column of vH are the same as
. Hence, the frequency distributions of 0and 1are
identical between and .Theorem 2 is proved.
It will be seen from Theorem 2 that if T, the suitable synaptic matrix of HNN, is constructed to ensure the distributed
uniformity of the number 0and 1in each attraction
domain, the property of the uniform frequency distribution
will be held when the synaptic matrix of the neural network
is changed by the standard permutation matrix. For example,
a synaptic matrix T is constructed in Ref.[3] as follows
1 1 0 1 1 1 0 1
1 1 1 0 1 1 1 0
0 1 1 1 0 1 1 1
1 0 1 1 1 0 1 1
T=
1 1 0 1 1 1 0 1 .
1 1 1 0 1 1 1 0
0 1 1 1 0 1 1 1
1 0 1 1 1 0 1 1
Tab.1 Frequency distributions of 0and 1in the attraction domain of HNN with the synaptic matrix of Eq.(12)
Number
Number
Frequency
Frequency
of 0
of 1
of 0
of 1
Attractors
(12)
0 0 0 0 0 0 0 1
0 0 1 0 0 0 0 0
0 1 0 0 0 0 0 0
H=
0 0 0 0 0 0 1 0
1 0 0 0 0 0 0 0
0 0 0 1 0 0 0 0
0 0 0 0 0 1 0 0
1 1 0 1 0 1 1 1
1 1 1 0 1 1 1 0
0 1 1 1 1 0 1 1
~ 1 0 1 1 1 1 0 1
T = HTH =
,
. (13)
0 1 1 1 1 0 1 1
1 1 0 1 0 1 1 1
1 1 1 0 1 1 1 0
1 0 1 1 1 1 0 1
11111000
80
80
0.5
0.5
11110001
80
80
0.5
0.5
11100011
80
80
0.5
0.5
11000111
80
80
0.5
0.5
10001111
80
80
0.5
0.5
00011111
80
80
0.5
0.5
00111110
80
80
0.5
0.5
01111100
80
80
0.5
0.5
11111111
64
64
0.5
0.5
11110000
40
40
0.5
0.5
11100001
40
40
0.5
0.5
11000011
40
40
0.5
0.5
10000111
40
40
0.5
0.5
00001111
40
40
0.5
0.5
00011110
40
40
0.5
0.5
00111100
40
40
0.5
0.5
01111000
40
40
0.5
0.5
Annotation 2. If a suitable synaptic matrix of HNN is constructed to ensure the distributed uniformity of 0and 1
in the attraction domain of each chaotic attractor, the property of the uniform frequency distribution will be held after
the synaptic matrix of HNN is changed by a standard permutation matrix.
Tab.2 Frequency distributions of 0and 1in the attraction domain of HNN with the synaptic matrix of Eq.(13)
Number
Number
Frequency
Frequency
of 0
of 1
of 0
of 1
Attractors
10110110
80
80
0.5
0.5
01110110
80
80
0.5
0.5
01111100
80
80
0.5
0.5
01011101
80
80
0.5
0.5
11001101
80
80
0.5
0.5
11001011
80
80
0.5
0.5
10101011
80
80
0.5
0.5
10110011
80
80
0.5
0.5
11111111
64
64
0.5
0.5
10100011
40
40
0.5
0.5
01110100
40
40
0.5
0.5
10110010
40
40
0.5
0.5
01011100
40
40
0.5
0.5
00110110
40
40
0.5
0.5
01001101
40
40
0.5
0.5
11001001
40
40
0.5
0.5
10001011
40
40
0.5
0.5
[3] Donghui Guo, L.M. Cheng and L. L. Cheng, Applied Intelligence 10, 71 (1999).
[4] GUO Dong-Hui, HE Xiao-juan and CHEN Cai-sheng, Chinese Journal of Computers 23, 1230 (2000). (in Chinese)
[5] QI Rui, ZHANG Dali and YAN Pingfan, Journal of Tsinghua
University 41, 89 (2001). (in Chinese)
[6]