Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
16 views

Lecture5 Cryptography

Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views

Lecture5 Cryptography

Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 37

INTERNET

TECHNOLOGIES
CS 8416
CRYPTOGRAPHY
 Is the practice and study of techniques for secure

communication in the presence of adversarial behavior.

 It aims to protect information and communications,

ensuring that only those for whom the information is


intended can read and process it.
CRYPTOGRAPHY
 Is based on mathematical concepts and a set of rule-based

calculations known as algorithms to convert messages in


ways that make it hard to decode.
CRYPTOGRAPHY
CRYPTOGRAPHY
 Key aspects of cryptography include:

1. Confidentiality: Ensuring that the information cannot be

understood by anyone other than the intended recipient.


CRYPTOGRAPHY
Cont..

2. Integrity: Preventing the alteration of information in

storage or transit between the sender and the intended


receiver.

3. Authentication: Verifying the identity of the sender and

receiver in a communication process.


CRYPTOGRAPHY
 Cont

4. Non-repudiation: Ensuring that the sender cannot deny

having sent the message and the recipient cannot deny


having received it.
CRYPTOGRAPHY
 Cryptography techniques are derived from mathematical

concepts and a set of rule-based calculations called


algorithms.
CRYPTOGRAPHY
 Some common cryptographic algorithms include:

a. Symmetric encryption: Uses the same key for both

encryption and decryption. E.g. Caesar cipher,


Vigenere cipher, and DES (Data Encryption Standard).
CRYPTOGRAPHY
 Cont..

b. Asymmetric encryption: Uses a pair of keys (public

and private) for encryption and decryption, such as the


RSA algorithm.
AUTHENTICATION
 Is the process of verifying the identity of a user or system.

 It involves determining whether someone or something is

who or what it claims to be.


AUTHENTICATION
 Authentication is essential for securing networks, systems,

and data, and it is used in various applications, including


computer logins, online transactions, and access control.
AUTHENTICATION
 There are different types of authentication systems,

including:
1. Single-factor authentication: This is the most basic

form of authentication, where the user has to enter a


username and password to confirm their identity.
AUTHENTICATION
 Cont..

2. Multi-factor authentication: This involves using two or

more authentication factors to verify the identity of a


user or system.
AUTHENTICATION
 Cont..

The factors can be something such as;

What the user knows (e.g., password)

Something the user has (e.g., smart card)

Something the user is (e.g., biometric data).


AUTHENTICATION
 Cont..

3. Cryptographic authentication: This is a type of


authentication that uses cryptography to verify the
identity of a user or system.
AUTHENTICATION
 Cont..

It involves the use of digital certificates, public key

infrastructure (PKI), and other cryptographic techniques


to ensure the authenticity of digital documents and
transactions.
ASYMMETRIC ENCRYPTION
 Asymmetric encryption algorithms use two different keys

for encryption and decryption.

 The key used for encryption is the public key, and the key

used for decryption is the private key.

 Both the keys must belong to the receiver.


ASYMMETRIC ENCRYPTION
ASYMMETRIC ENCRYPTION
 Using different keys for encryption and decryption has

helped avoid the problem of key exchange, as seen in the


case of symmetric encryption.

 E.g. If Alice needs to send a message to Bob, both the

keys, private and public, must belong to Bob.


DIGITAL SIGNATURE
 Is a mathematical technique used to validate the
authenticity and integrity of a digital document, message,
or software.

 It is the digital equivalent of a handwritten signature or

stamped seal, but it offers far more inherent security.


DIGITAL SIGNATURE
 Intended to solve the problem of tampering and
impersonation in digital communications and transactions.

 They provide evidence of the origin, identity, and status of

electronic documents, transactions, or digital messages.


DIGITAL SIGNATURE
 Created using cryptographic algorithms and are commonly

used for software distribution, financial transactions,


contract management, and other cases where it is important
to detect forgery or tampering.
DIGITAL SIGNATURE
 Created using cryptographic algorithms and are commonly

used for software distribution, financial transactions,


contract management, and other cases where it is important
to detect forgery or tampering.
DIGITAL SIGNATURE
 A digital signature is –

Convenient to use

Time-saving

Useful in court to prove your participation in signing a

document
DIGITAL SIGNATURE
 A digital signature is –

Legally valid and much more secure

Efficient in signing bulk documents in a short time


DIGITAL SIGNATURE
 A digital signature scheme typically consists of three

algorithms:
1. A key generation algorithm that selects a private key

uniformly at random from a set of possible private


keys.
DIGITAL SIGNATURE
 Cont..

The algorithm outputs the private key and a


corresponding public key.
2. A signing algorithm that, given a message and a private

key, produces a signature.


DIGITAL SIGNATURE
 Cont..

3. A signature verifying algorithm that, given the message,


public key and signature, either accepts or rejects the
message's claim to authenticity.
DIGITAL SIGNATURE
DIGITAL SIGNATURE
 Where; and digest
M - Plaintext E - Encryption

H - Hash function D - Decryption

h - Hash digest

‘+’ - Bundle both plaintext


DIGITAL SIGNATURE
 The image from the figure shows the entire process, from

the signing of the key to its verification.


Step 1: M, the original message is first passed to a hash

function denoted by H# to create a digest.


DIGITAL SIGNATURE
 Cont..

Step 2: Next, it bundles the message together with the

hash digest h and encrypts it using the sender’s private


key.
DIGITAL SIGNATURE
 Cont..

Step 3: It sends the encrypted bundle to the receiver,

who can decrypt it using the sender’s public key.


DIGITAL SIGNATURE
 Cont..

Step 4: Once it decrypts the message, it is passed

through the same hash function (H#), to generate a


similar digest.
DIGITAL SIGNATURE
 Cont..

Step 5: It compares the newly generated hash with the

bundled hash value received along with the message. If


they match, it verifies data integrity.
DIGITAL SIGNATURE
 Cont..

You might also like