Scribd
Upload
57 views

Network and System Security (TCS 619) Unit II: B. Tech CSE VI Semester

The document discusses principles of symmetric and public key cryptography, including symmetric block ciphers, stream ciphers, digital signatures using RSA, message authentication codes, and secure hash algorithms such as SHA-1 and SHA-2. It also provides details on the processes of digital signatures, message authentication codes, and secure hash algorithms. Examples are given throughout to illustrate how these cryptographic techniques work.

Uploaded by

Vaishnav Negi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
57 views

Network and System Security (TCS 619) Unit II: B. Tech CSE VI Semester

The document discusses principles of symmetric and public key cryptography, including symmetric block ciphers, stream ciphers, digital signatures using RSA, message authentication codes, and secure hash algorithms such as SHA-1 and SHA-2. It also provides details on the processes of digital signatures, message authentication codes, and secure hash algorithms. Examples are given throughout to illustrate how these cryptographic techniques work.

Uploaded by

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

Network and System Security (TCS 619)

Unit II

B. Tech CSE VI Semester

Instructor:
Dr Mohammad Wazid
Associate Professor, Department of CSE
Graphic Era (Deemed to be University), Dehradun, India
Email: [email protected]
Homepage: https://sites.google.com/site/mwazidiiith/home
Unit-II
• Topics:
• Symmetric encryption principles, symmetric block encryption
algorithms, random and pseudorandom numbers, stream
ciphers and RC4, cipher block modes of operation.
• Approaches to message authentication, secure hash functions,
message authentication codes.
• Public-key cryptography principles, public-key cryptography
algorithms, digital signatures.
RSA digital signature
• RSA digital signature scheme applies the sender’s private key
to a message to generate a signature.
• The signature can then be verified by applying the
corresponding public key to the message and the signature
through the verification process.
• These two operations are there sign and verify.
RSA digital signature: process
RSA digital signature: process
RSA digital signature: process
RSA digital signature: process
RSA digital signature: correctness proof
RSA digital signature: process
Message authentication code (MAC)
• A message authentication code (often called MAC) is a
block of a few bytes that is used to authenticate a
message.
• The receiver can check this block and be sure that the
message hasn’t been modified by the third party.
• A MAC requires two inputs: a message and a secret key
known only to the originator of the message and its
intended recipient(s).
Message authentication code (MAC)
Uses:
• Message authentication codes (MACs) are commonly used in
electronic funds transfers (EFTs) to maintain information
integrity.
• They confirm that a message is authentic; that it really does
come, in other words, from the stated sender, and hasn’t
undergone any changes en route.
• A verifier who also possesses the key can use it to detect changes
to the content of the message if there.
Message authentication code (MAC)
• This allows the recipient of the message to verify its
integrity.
• MAC=C(M,K). MAC (authenticator) is fixed length of
code generated using original message M and key K.
Here, C is a function (algorithm) used to compute MAC.
Message authentication code (MAC)
Process:
Message authentication code (MAC)
Types:
Secure Hash Algorithms
• Secure Hash Algorithms, also known as SHA, are a
family of cryptographic functions designed to keep data
secured i.e., SHA256, MD5.
• It works by transforming the data using a hash function:
an algorithm that consists of bitwise operations, modular
additions, and compression functions.
Secure Hash Algorithms
• The hash function then produces a fixed-size string (hash
code-authenticator).
• These algorithms are designed to be one-way functions,
meaning that once they’re transformed into their
respective hash values, it’s impossible to transform them
back into the original data.
Secure Hash Algorithms
• A few algorithms of interest are SHA-1, SHA-2, and
SHA-3, each of which was successively designed with
increasingly stronger encryption in response to hacker
attacks.
• SHA-1, for instance, is now obsolete due to the widely
exposed vulnerabilities.
• A common application of SHA is to encrypting
passwords, as the server side only needs to keep track of a
specific user’s hash value, rather than the actual
password.
Secure Hash Algorithms
• This is helpful in case an attacker hacks the database, as
they will only find the hashed functions and not the actual
passwords.
• Additionally, SHAs exhibit the avalanche effect, where
the modification of very few letters being encrypted
causes a big change in output.
Secure Hash Algorithms: process
Original message M
Hash code x also called as authenticator
x=h(M)
Where h() is a hash function
Basic uses of hash function
a) For integrity checking of the
transmitted message (also achieve
secrecy)

b) For integrity checking of the


transmitted message, (No secrecy-
message is going in plaintext)

c) For integrity checking and


message authentication (No
secrecy)
Basic uses of hash function

c) For integrity checking and


message authentication. ( No
secrecy-Message is going in
plaintext. )
(S is a common secret of
sender and receiver).

d) For integrity checking and


message authentication. S is a
common secret of sender and
receiver. (Achieve secrecy-
Message is transmitted in
encrypted form).
Important references:
1. Textbook: Cryptography and Network Security: Principles
and Practice by William Stallings

You might also like