Taba Crypto
Taba Crypto
MSc in Cybersecurity
Jaganath Kaliyamoorthy
School of Computing
National College of Ireland
M.SC IN CYBERSECURITY
CRYPTOGRAPHY - TABA
R = 13
N = R + Sum
N= 13 + 17 = 30
N=30
Hellothisisfinalsubmissiontbaa = 30 characters
3) The aim of the above question is to provide confidentiality, integrity and non-
repudiation of the data which is been transferred. There is no single way to achieve
this, so we have taken number of methods and approach to achieve them.
With reference to the above illustration, we can see that the plain text is encrypted
using receivers public key using RSA encryption scheme, this ensures the
confidentiality of the communication. On the other hand, the plain text has been
encrypted using the sender’s private key and using RSA digital signature the message
has been signed and embedded with the cipher text. Now at the receivers end, the
cipher text has been decrypted using the receivers private key, thus ensuring the
message was confidential, to verify where the integrity and non-repudiation of the
message is unhalted, we decrypt the message using the sender’s public key and verify
the signature and the decrypted message is similar, if it is then the message received
is the message send by the sender. Thus, the confidentiality, data integrity and non-
repudiation of the message has been ensured.
Limitations:
In this method, we have used Vigenere cipher along with Hash and Digital signature.
Here the plain text has been encrypted using the shared secret key. On the other
hand, the hash of the plain text has been calculated and encrypted using the sender’s
Private key. Now this serves as the digital signature and it has been embedded along
with the cipher text. Now it has been sent to the receiver. The Receiver decrypts the
message using the shared secret key and obtains the plain text. Now the hash of this
text has been calculated and on the other hand the digital signature has been
encrypted using the senders public key. Now the hash of that is calculated and then it
has been compared and checked, if the value is same then the plain text is not
modified.
Limitation:
In the final method, we can use the Vigenere cipher and RSA digital signature. The
plain text has been encrypted using the shared private key and on the other hand the
message has been encrypted using sender’s private key. Then both are embedded
and provided to the receiver, then the receiver decrypts the cipher text using the
shared secret key and then the Signature has been decrypted using the sender’s
public key. Then the value has been compared and verified. If it is changed then the
text has been altered. Thus, we have ensured the confidentiality, integrity, and non-
repudiation has been ensured.
Limitations:
Since one-time pad is highly strong encryption algorithm, breaking the algorithm is
nearly impossible. The Diffie Hellman is used to exchange the key securely. Finally,
by using the key length which is similar to the key allows the key to be perfectly secure
and makes it highly difficult to the attacker to brute force the key or guess the key.
Proposed requirements:
• Exhaustion of key:
One of the major limitations is key exhaustion, as the key can leak information and
due to this the one time pad is used and the key length has to be same of the
message and the same key will not be used again, this leads to key exhaustion.
• Key management:
For small scale, the key can be managed however, for each communication if the
key needs to maintain then it becomes a chaos. So key management is one of the
major limitations of Symmetric key encryption.
• Attribution Data:
Unlike public key cryptography the symmetric key cryptography doesn’t provide
embedded attributes like expiry and access control for encrypting and decrypting
the file.
• Key Distribution:
Since Diffie Hellman method doesn’t come with authentication, the key can be
altered and man in the middle attack is possible, so key distribution in a secure
channel is one of the major concerns in symmetric cryptography.
5) For this question, we can consider the method 3, and the whole process of encryption,
decryption, digital signature, and the calculations have been provided below,
Let us assume the secret key has been shared between the sender and the receiver
in before hand and then the process of encryption is happening. For instance, the key
could have been exchanged using a Diffie-Hellman method securely. Then both the
parties are using the Vigenere table encrypting and decrypting the message.
Vigenere Table
Let us assume the key as “cryptography” for the encryption and decryption process,
Using the vigenere table we have calculated the cipher text and reversed the
ciphertext to plain text using the same key.
Plai
ntex
t h e l l o t h i s i s f i n a l s u b m i s s i o n t b a a
Enc
rypt
Key c r y p t o g r a p h y c r y p t o g r a p h y c r y p t o
ion
Cip
hert
ext j v j a h h n z s x z d k e y a l i h d i h z g q e r q t o
Cip
hert
Dec ext j v j a h h n z s x z d k e y a l i h d i h z g q e r q t o
rypt Key c r y p t o g r a p h y c r y p t o g r a p h y c r y p t o
ion Plai
ntex
t h e l l o t h i s i s f i n a l s u b m i s s i o n t b a a
So, one part of the process been completed, next we need to verify the digital signature
of the message, for that we are considering RSA Digital signature.