Nis
Nis
U N I V E R S I T Y
(Estd. u/s 3 of UGC Act 1956)
Vellore - 632 014, Tamil Nadu, India
Xenon Cipher
Developed by
ShachiKaul (16MCA0111)
Sharan Sharma (16MCA0132)
Ankit kumar gupta (16MCA0152)
Prepared for
Network Information and Security
Table of Contents
1|Page
1. Existing Algorithms 3
1.1 Key Generation
1.2 Problem 3
2. Modifications made in this Cryptosystem 4
3. Logic/design elements used in the proposed algorithm
5
4. Cryptanalysis of proposed algorithm
4.1 Strength of the algorithm
4.2 Weakness of the algorithm
4.3 Attacks possible
4.4 Attacks impossible
4.5 Benefits
4.6 Drawbacks
5. Applications
6. Performance analysis of proposed cryptosystem by
comparing with the existing systems
7. Program: C/C++/Java code
8. Sample input and Output
9. Conclusion
10. References
2|Page
Key is updated at each encryption operation
Order of encryption and decryption matters so as to avoid keys mismatch.
Key whitening concept is used which provides good security.
In order to encrypt and decrypt files using Xenon you will need two copies of the
same key, one to use for encryption and the other for decryption. It does not matter
which one is used for which operation, only that the one used to decrypt a file is
exactly the same as the one used to encrypt it. The key used to encrypt the file will
be updated during encryption and will not be the same, so to decrypt the copy of
the original must be used.
As iterating steps2, 3, all round-key words generated successively in 4 words of 32-bits. All data
blocks are of 32-bit word.
3|Page
Figure-1 Initial Seed-Key Loading on Data-Pads
Figure-3
In the above, shaded block denotes function of consecutive Round1 and Round2.
4|Page
1.2 PROBLEM:
As many files such as word documents or html, have required header/footer
contents which may be guessed by an attacker - thus for those bytes, the attacker
would know both the key and the plaintext through guesswork, and if the attacker
knows enough bytes of both key and plaintext they may be able to figure out the
outputs of the randomization algorithm and thus the updated key
2. Extension
1. To overcome a guessing activity of attacker we can increase the key size
2. For this, we can also send cipher text and key text in the same file as the attacker
cannot differentiate between two.
3. Even if plaintext is known, it is impossible to guess the original key So, Shuffling
cipher text after it has been already XORed by using factorial function in figure-4
3.
D
es
ig
n
el
5|Page
ements in the proposed algorithm
For each encryption and decryption a key file is used which should be long
Design of the algorithm is shown in the figure 2
4.4 Benefits
Avalanche property
Differential cryptanalysis
Linear Cryptanalysis
Interpolation attack
BruteForce attack can be prevented
4.5 Drawbacks:
The key used to encrypt the file will be updated during encryption and will not be
the same, so to decrypt the copy of the original must be used.
7|Page
We have to maintain a copy of key generated at each round function for its
respective encryption and decryption
8|Page
8. Sample input and Output
9|Page
FILE TO BE ENCYPTED:
10 | P a g e
DECRYPT THE SAME FILE:
11 | P a g e
DECRYPTED FILE:
12 | P a g e
7. Conclusion
10. References
[1] Xenon_V1.0.PDF
[2] Wikepedia.org/XenonCryptosystem
13 | P a g e