Dr.

Mohammad Aloun
 Cryptography:
◦ The science (art) of encryption (secret writing)
◦ Sending information in a way that prevents others from reading it.
◦ Process data into unintelligible form, reversible, without data loss.
 It is one of the mathematical techniques that ensure secure
communications within a non-secure channel and protect
information from adversaries and increase the security of
communications.
 Cryptanalysis = the science (art) of breaking
encryption.
 Cryptology = Cryptography + Cryptanalysis

2
• Plaintext: a message in its original form.
• Ciphertext: a message in the transformed, unrecognized
form (the result of encryption).
• Encryption: the process for producing ciphertext from
plaintext.
• Decryption: is the process that used to decrypt ciphertext to
recover the plaintext, the reverse of encryption.
• Key: a secret value used to control encryption/decryption.

3
 Plaintext Ciphertext
• An original message • The coded message

Enciphering/encryption Deciphering/decryption
•The process of converting from •Restoring the plaintext from
plaintext to ciphertext the ciphertext

Cryptography Cryptanalysis Cryptology

•Techniques used for
•The area of study of the •The areas of
deciphering a message
many schemes used for cryptography and
without any knowledge of
encryption cryptanalysis
the enciphering details
 Symmetric Key (Private Key)
◦ Same key for encryption and decryption
◦ Modern types: Stream ciphers, Block ciphers
◦ The following algorithms use Symmetric Encryption: RC4, AES,
DES, 3DES.
 Asymmetric Key (Public Key)
◦ Two keys, one for encryption (public), and one for
decryption (private).
◦ The following algorithms use Asymmetric Encryption:
RSA, Diffie-Hellman, ECC, El Gamal, DSA.

5
© 2017 Pearson Education, Ltd., All rights reserved.
 There are two requirements for secure use of
conventional encryption:
◦ A strong encryption algorithm

◦ Sender and receiver must have obtained copies of

the secret key in a secure fashion and must keep
the key secure (key exchange).
In asymmetric encryption, each party has a private
key and public key, and each party generates the
secret key separately and both use the Diffie-
Hellman technique to exchange their public keys.
 Diffie-Hellman Key Exchange
The Diffie-Hellman protocol is the first invented public key cryptosystem proposed for
sharing the secret key. It is a key agreement mechanism that allows two parties to produce a
shared secret key.
  Characterized along three independent
dimensions:

The type of operations

The number of keys The way in which the
used for transforming
used plaintext is processed
plaintext to ciphertext

Symmetric, single-
key, secret-key,
Substitution Block cipher
conventional
encryption

Asymmetric, two-
Transposition key, or public-key Stream cipher
encryption
 Eve

Alice Bob
Insecure Channel

 Encryption: Prevent Eve from intercepting message.

 Authentication: Prevent Eve from impersonating Alice.
◦ Passwords
◦ Biometrics
◦ Other methods of authentication
 Confidentiality: prevent unauthorized reading
of information.
- Cryptography used for confidentiality
 Integrity: detect unauthorized writing of
information
◦ Cryptography used for integrity
 Availability: Data is available in a timely
manner when needed.

12
 Cryptographic algorithms need to be reasonably efficient
 Cryptographic algorithms are not impossible to break
with the key
◦ e.g. try all the keys – brute-force cryptanalysis
 A scheme can be made more secure by making the key
longer
◦ Increase the length of the key by one bit or add some special
characters to it.

13
 Not to publish the algorithms
◦ We can achieve better security if we keep the algorithm
secret.
◦ Hard to keep secret if widely used
 Publish the algorithms
◦ Security of the algorithms depend on the secrecy of the
keys.
 Common practice:
◦ Commercial: publish
◦ Military: keep secret
➢ Experience has shown that secret algorithms tend
to be weak when exposed.

14
 The security of an encryption system must
depend only on the key, not on the secrecy
of the algorithm.
 There is no such thing as a provably secure
system.
 Systems are believed secure only when
many people try and fail to break them.
• Even expertly designed systems have weaknesses.

15
 Security attack
◦ Any action that disclose the security of information owned
by an organization.
 Security mechanism
◦ A process (or a device incorporating such a process) that is
designed to prevent, detect, or recover from a security
attack. E.g: antivirus, firewall
 Security service (security objectives)
◦ A processing or communication service that enhances the
security of the data processing systems and the
information transfers of an organization.
◦ Intended to counter security attacks, they make use of one
or more security mechanisms to provide the service.
 Confidentiality (secrecy):
◦ Only the sender and intended receiver should be able
to understand the contents of the transmitted
message.
 Data integrity:
◦ The content of their communication is not altered,
either maliciously or by accident, in transmission.
 Availability:
◦ Timely accessibility of data to authorized entities.
 Authentication:
◦ Both the sender and receiver need to confirm the
identity of other party involved in the communication.
 Accountability:
◦ Actions of an entity can be traced uniquely to that
entity.
 “Secret codes”
 The course covers:
◦ Classical cryptography
◦ Symmetric ciphers
◦ Asymmetric ciphers (Public key cryptography)
◦ Advanced cryptanalysis