A Network Coding and DES Based Dynamic Encryption Scheme For Moving Target Defense
A Network Coding and DES Based Dynamic Encryption Scheme For Moving Target Defense
Existing System
The basic goal of MTD is to achieve the active defense to the external attacks based on
unknown vulnerabilities and backdoors. To date, MTD has been studied in various contexts,
including cloud computing and web applications. The similar dynamic idea can also be adopted
in cryptography design. It is well known that Data Encryption Standard (DES) has been widely
used as a mainstream symmetrical encryption. Meanwhile, DES has laid a foundation for the
development and application of modern block cipher theory. At present, with the rapid
development of computing power, the classic iterated block cipher DES has become very fragile,
which causes the effective realization of DES crack by the exhaustive attack. So, it has gradually
been replaced by the triple-DES algorithm or Advanced Encryption Standard (AES) so that the
encoder has a large enough key space.
Proposed System
In this paper, we present an encryption scheme to improve DES under the concept of
MTD, by means of (linear) network coding (NC), which advocates linearly combining coding
along with data propagation. The following two reasons motivate us to choose NC. First, NC,
which has been used in for encryption scheme design, changes the static nature of network
information transmission, so it is a good match to achieve the dynamic, active and random
features of MTD as defined. Second, the use of NC as an encryption scheme has the potential to
resist the exhaustive attack, as anL-bit plaintext may correspond to possible ciphertexts.
Future work
The proposed scheme can achieve the MTD features by the following procedures. First, a
re-encryption process can be implemented on the outer NC layer of the scheme, so that the key
and ciphertexts can be dynamically changed. Second, the key length can be actively extended, so
that the scheme is adaptable to the rapid development of the computing power. Third, the
parameters in the scheme can be flexibly chosen, so that there is a transition between efficiency
and security.The security level of the proposed scheme will be tested in our future work.
Module implementation
1. Inner Layer Encryption Embedding NC
In this step, the plaintext x, which is a binary row vector, is converted to a binary
intermediate sequence z1 based on a high-dimensional binary invertible matrix Ka
generated by the concept of NC. The main purpose of this step is to extend the key space
of the algorithm, so as to resist the exhaustive attack.
2. Middle Layer DES Encryption
The middle layer encryption step adopts DES to encode intermediate sequence z1,
and get another intermediate sequence z2. The main purpose of this step is to exploit the
design of S-box in DES to bring non-linearity into the encryption scheme, and hence to
effectively defense the analysis attack.
3. Outer Layer Encryption Embedding NC
In this outer layer encryption step, NC is adopted again to generate a low-
dimensional binary invertible matrix Kc to encode intermediate sequence z2, and the
ciphertext y is subsequently obtained. The purpose of this step is to take advantage of NC
to provide an interface for dynamic and efficient update, and to construct the triple
encryption model to resist the man-in-the-middle attack, which is a common and efficient
crack in double encryption schemes as mentioned before.
Architecture
Algorithm
1) Multiple DES: The most classical multiple DES algorithm is the triple DES which we
have discussed in Section Ⅴ. The complexity of multiple DES is several times larger
than single DES and therefore much larger than our encryption scheme. Besides, as we
said at the beginning, multiple DES cannot meet the dynamic security requirements of the
intelligent information network.
2) Mutable S-box DES: This algorithm can change the content order of S-box based on the
change of encryption key or directly change the content of S-box. Obviously, it can be
used to resist differential cryptanalysis (DC) but has no contribution to enlarge the key
space.
3) Sub key DES: This algorithm uses different sub key on every iteration during encryption
in DES. Due to 48-bit key required in every iteration process, after 16 iterations, the key
space of this improved DES is 768. This algorithm greatly increases the complexity of
key space and has a good behavior to resist the exhaustive attack. However, its
adaptability and extension with the rapid development of the computing power is even
less than the multiple DES algorithm for the reason that its key space is strictly static.
System Requirements
RAM : 2GB
Hard Disk : 57 GB
Monitor : SVGA
Scripts : JavaScript.