Chapter-2 Part 1
Chapter-2 Part 1
Algorithms
Chapter-1
Part I
been monitored
Confidentiality (secrecy)
Integrity (anti-tampering)
Authentication
Non-repudiation.
Ensuring that no one can read the message except the intended receiver
Data is kept secret from those without the proper credentials, even if
that data travels through an insecure medium.
Assuring the receiver that the received message has not been altered in
any way from the original.
4. Non-repudiation
3. Hash Functions
The key for encrypting and decrypting the file had to be known to all
Symmetric Key Systems are faster and simpler but the problem
manner.
DES uses a 56 bit key and maps a 64 bit input block of plaintext onto a
These 56 bits are now small key for today's computing power.
Triple DES
Now decrypt the output of step 1 using single DES with key K2.
Finally, encrypt the output of step 2 using single DES with key K3.
Triple DES…
Triple DES…
It also has the advantage of proven reliability and a longer key length
that eliminates many of the shortcut attacks that can be used to reduce
the amount of time it takes to break DES. Key size is 168 bit long.
A replacement for DES was needed as its key size was too small.
Key Management
Symmetric-key systems are simpler and faster; their main drawback is that
the two parties must somehow exchange the key in a secure way and keep
it secure after that.
Key Management caused nightmare for the parties using the symmetric
key cryptography .
They were worried about how to get the keys safely and securely across to
all users so that the decryption of the message would be possible.
12/9/2022 Computer and Network Security 28 By: Mechal T.
Types Of Cryptography…
ProblemsWith Symmetric Key Cryptography…
Key Management
This gave the chance for third parties to intercept the keys in transit to
decode the top-secret messages.
Thus, if the key was compromised, the entire coding system was
compromised and a “Secret” would no longer remain a “Secret”.
The public key is used to encrypt the message and the private one is used
to decrypt the message.
1. A client (for example browser) sends its public key to the server and
requests some data.
2. The server encrypts the data using the client’s public key and sends the
encrypted data.
Since this is asymmetric, nobody else except the browser can decrypt the
data even if a third party has the public key of the browser.
RSA Algorithm
RSA (Rivest, Shamir and Adleman who first publicly described it in 1977)
is an algorithm for public-key cryptography.
the alphabet.
which indicates the number of positions each letter of the text has been
moved down.
B = 1,…, Z = 25.
E_n(x)=(x+n)mod\ 26
D_n(x)=(x-n)mod\ 26
Note: If any case (Dn) value becomes negative (-ve), in this case, we will
add 26 in the negative value.
Decrypted Message
Ciphertext: M → 12 Dn: (12 - 3) mod 26 Plaintext: 09 → J
After all, there are only 26 viable keys in the ordinary alphabet, and
only 255 useful keys in the ASCII alphabet!
improve the system by finding any weak point and thus work on the
known.
key.
Its very simple to implement like KPA but the success rate is quite low.
In this type of attack, only some cipher-text is known and the attacker
ciphertext is required.
This attack is similar CPA. Here, the attacker requests the cipher texts