The Key Points discussed in this User Authentication Chapter is as Follows:
- Mutual authentication protocols enable communicating parties to satisfy themselves mutually about each other’s identity and to exchange session keys.
- Kerberos is an authentication service designed for use in a distributed environment.
- Kerberos provides a trusted third-party authentication service that enables clients and servers to establish authenticated communication.
Chapter 15 User Authentication PPT
Chapter 15 User Authentication Notes
The Key Points Discussed in this Digital Signature Chapter is as Follows:
- A digital signature is an authentication mechanism that enables the creator of a message to attach a code that acts as a signature. Typically the signature is formed by taking the hash of the message and encrypting the message with the creator’s private key. The signature guarantees the source and integrity of the message.
- The digital signature standard (DSS) is an NIST standard that uses the secure hash algorithm (SHA).
Download Chapter 13 Digital Signature Notes
Download Chapter 13 Digital Signature PPT
The Following Points are Discussed in this Message Authentication Codes Chapter:
- Message authentication is a mechanism or service used to verify the integrity of a message. Message authentication assures that data received are exactly as sent by (i.e., contain no modification, insertion, deletion, or replay) and that the purported identity of the sender is valid.
- Symmetric encryption provides authentication among those who share the secret key.
- A message authentication code (MAC) is an algorithm that requires the use of a secret key. A MAC takes a variable-length message and a secret key as input and produces an authentication code. A recipient in possession of the secret key can generate an authentication code to verify the integrity of the message.
- One means of forming a MAC is to combine a cryptographic hash function in some fashion with a secret key.
- Another approach to constructing a MAC is to use a symmetric block cipher in such a way that it produces a fixed-length output for a variable-length input.
Download Chapter 12 Message Authentication Codes Notes
Download Chapter 12 Message Authentication Codes PPT
The Key Points Discussed in This Key management & Distribution Chapter is as Follows:
- A hash function maps a variable-length message into a fixed-length hash value, or message digest.
- Virtually all cryptographic hash functions involve the iterative use of a compression function.
- The compression function used in secure hash algorithms falls into one of two categories: a function specifically designed for the hash function or an algorithm based on a symmetric block cipher. SHA and Whirlpool are examples of these two approaches, respectively.
Download MD5 Hash Algorithm PDF
Download CSE 405 Chapter 11 Cryptographic Hash Functions PPT
Download CSE 405 Chapter 11 Cryptographic Hash Functions Notes
The Key Points Discussed in Key Key Management & Distribution is as Follows:
- Key distribution is the function that delivers a key to two parties who wish to exchange secure encrypted data. Some sort of mechanism or protocol is needed to provide for the secure distribution of keys.
- Key distribution often involves the use of master keys, which are infrequently used and are long lasting, and session keys, which are generated and distributed for temporary use between two parties.
- Public-key encryption schemes are secure only if the authenticity of the public key is assured. A public-key certificate scheme provides the neces-sary security.
- X.509 defines the format for public-key certificates. This format is widelyused in a variety of applications.
Download CSE 405 Chapter 14 Key management & Distribution PPT
Download CSE 405 Chapter 14 Key management Distribution Notes
The Key points Discussed in this Chapter is as Follows:
- Public-key encryption schemes are secure only if the authenticity of the public key is assured.
- A Public-key certificate scheme provides the necessary security.
- A simple public-key algorithm is Diffie-Hellman key exchange. This protocol enables two users to establish a secret key using a public-key scheme based on discrete logarithms.
- The protocol is secure only if the authenticity of the two participants can be established.
Download CSE 405 chapter-10 Other Public Key Cryptosystems PPT
Download CSE 405 chapter-10 Other Public Key Cryptosystems Notes
The Key Points Discussed in This Chapter is as Follows:
- A prime number is an integer that can only be divided without remainder by positive and negative values of itself and 1. Prime numbers play a critical role both in number theory and in cryptography.
- Two theorems that play important roles in public-key cryptography are Fermat’s theorem and Euler’s theorem.
- Asymmetric encryption is a form of cryptosystem in which encryption and decryption are performed using the different keys—one a public key and one a private key. It is also known as public-key encryption.
- Asymmetric encryption transforms plaintext into ciphertext using a one of two keys and an encryption algorithm. Using the paired key and a decryp-tion algorithm, the plaintext is recovered from the ciphertext.
- Asymmetric encryption can be used for confidentiality, authentication,or both.
- The most widely used public-key cryptosystem is RSA. The difficulty of attacking RSA is based on the difficulty of finding the prime factors of a composite number
Download CSE 405 chapter-8 Number Theory PPT
Download CSE 405 chapter-9 Public Key Cryptography and RSA PPT
Download CSE 405 chapter-9 Public Key Cryptography and RSA Notes