Page 59 - Cyber Warnings

In this case, all external bits of the information which is the part of a set of encrypted
information are XNORed, while all internal bits of the encrypted information are in affirmation.
This is described using a Theorem 2.

Theorem 2

Let assume that we observe a set of m-bit binary information, where m  3 . The set of
m
information contains 2 different combinations of 0s and 1s. In that case, the source message
can be represented using the weight coefficients. This is given in Equation (9).

Message  f f f ... f f f
n n 1 n 2 2 1 0 (9)

Where:

n - the highest value of the weight coefficient for the message; n  2 ,

f - the weight coefficient for the message.

Let also assume that an encrypted message or a cipher 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 (10).


Cipher Message  g g g n 2 ...g g g 0 (10)
n
1
n
2 1
Where:
n - the highest value of the weight coefficient for the encrypted information n  2 ,

g - the weight coefficient for the encrypted information.

If the following algorithm is applied, the result will be a unique set of encrypted
information that can be encrypted in more levels.

st
The 1 Level of Encryption:

59 Cyber Warnings E-Magazine – March 2016 Edition
Copyright © Cyber Defense Magazine, All rights reserved worldwide