Page 56 - Cyber Warnings

function should be applied in order to get a unique set of encrypted information?”. I have
continued testing the opportunities and very soon the answer to that question appeared. Internal
bits should be the result of affirmation or negation or, in other words, they correspond to a
single-bit function. Consequently, I have realized that findings can be used for multi-level
encryption of digital information.

The fundamental principles of this law are presented as follows. The entire law can be
broken down into three cases – two general and one that is the combination of the previous two.

Case 1: External XORed, Internal inverted

In this case, all external bits of the information which is the part of a set of encrypted
information are XORed, while all internal bits of the encrypted information are inverted. This is
described using a Theorem 1.

Theorem 1
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 (1).

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

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 (2).


Cipher Message  g g g ...g g g
n n 1 n 2 2 1 0 (2)
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.

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