Page 55 - Cyber Warnings
P. 55







The ESIS Encryption Law


Abstract: In this article, I introduce a completely new system of multi-level encryption which can
provide a unique solution for the given set of input information. This new method is defined using
a set of the rules which are governed by the ESIS Encryption Law. In this case, an ESIS means
External-Symmetric Internal-Single. In other words, this corresponds to external bits of encrypted
information which are the results of symmetric function applications and internal bits which stay
single or in affirmation or in negation. Symmetric functions which are applied in this law are
XOR and XNOR functions. A detailed analysis and examples of the ESIS Encryption Law are
presented in this paper.


Introduction

It is considered that Claude E. Shannon is the father of mathematical cryptography. He was
working for several years at Bell Labs, and during that he produced an article called “A
mathematical theory of cryptography” which was published in the Bell System Technical
Journal in 1949. Shannon continued his work by writing another article named “A mathematical
theory of communication”. It is published in 1949 and it considered being the starting point for
development of modern cryptography. Shannon obtained the two main goals of cryptography:
secrecy and authenticity. Later, G. J. Simmons addressed the issue of authenticity. Shannon’s
paper “A mathematical theory of communication” brought cryptography’s transition from art to
science.

A secrecy system can be formulated as a set of transformations of one space which
addresses to the set of possible messages into another space which addresses to the set of
possible cryptograms. Each particular transformation of the set corresponds to enciphering with a
particular key. The transformations are reversible. That means the unique deciphering is possible
when the key is known. Each key and transformation is assumed to have the probability of
choosing that key. Similarly, each possible message is supposed to have a probability which is
determined by the underlying stochastic process. These probabilities are actually the
cryptanalyst’s probabilities for the choices in question and represent the knowledge of the
situation.



The ESIS Encryption Law

Since the beginning of my research until the moment of formulating this rule, the way I had
to pass was pretty winding. I started my research by examining logic functions and very soon I
have noticed that symmetric functions such as XOR and XNOR give a set of symmetric
solutions. On the other hand, basic functions such as AND, OR and NOT or combined functions
like NAND and NOR provide the set of solutions which is usually repeated. The question which
I was asking myself was – “Is there any algorithm which will give a unique set of encrypted
information for the certain set of input information?”. After some time, I have noticed that
external bits of encrypted information must be the result of symmetric function application,
otherwise the encrypted information will get deformed. But, the new question was – “Which

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

   50   51   52   53   54   55   56   57   58   59   60