Page 61 - Cyber Warnings
P. 61
h g g g
0 0 1 2
h g
1 1
... (14)
h g
n 1 n 1
h g g g
n n 0 1
…..
The (m - 2) Level of Encryption
Let again assume that an encrypted message in the second level of encryption can be
presented as array of the weight coefficients, where number of digits for the message and number
of digits for the cipher are the same. This is shown in Equation (15).
Cipher Message j j j ...j j j (15)
m 2 n n 1 n 2 2 1 0
Where:
n - the highest value of the weight coefficient for the encrypted information; n 2 ,
j - the weight coefficient for the encrypted information.
The algorithm is as follows:
...
j i i i
0 0 1 n 1
j i
1 1
... (16)
j i
n 1 n 1
j i i ... i
n n 0 n 2
Case 3: A Combination of the Previous Two Cases
In this case, the set of encrypted information is the result of the combination of the previous
two theorems.
Further, I encourage all the curious researchers and engineers to try to prove this law using,
for instance, a set of 4-bit binary information. As it can be shown, solutions of such a multi-level
61 Cyber Warnings E-Magazine – March 2016 Edition
Copyright © Cyber Defense Magazine, All rights reserved worldwide
