Scribd
Upload
7 views3 pages

Mod Iii

The document provides an overview of asymmetric key cryptography, detailing its definition, usage, advantages, and examples like RSA and ECC. It explains the RSA algorithm, including key generation, encryption, and applications, as well as the concept of hybrid cryptography that combines symmetric and asymmetric techniques. Additionally, it covers digital signatures, message digests, hash functions, and the SHA-512 algorithm, outlining their properties and applications.

Uploaded by

kolkedoyal88
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views3 pages

Mod Iii

The document provides an overview of asymmetric key cryptography, detailing its definition, usage, advantages, and examples like RSA and ECC. It explains the RSA algorithm, including key generation, encryption, and applications, as well as the concept of hybrid cryptography that combines symmetric and asymmetric techniques. Additionally, it covers digital signatures, message digests, hash functions, and the SHA-512 algorithm, outlining their properties and applications.

Uploaded by

kolkedoyal88
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Asymmetric Key Algorithm & Authen ca on and Hash Func on

Asymmetric Key Algorithm


1. Overview of Asymmetric Key Cryptography:
 Defini on: A cryptographic system using two keys: a public key (shared) and a private key
(kept secret).
 Usage:
 Public key: Used for encryp on or verifying signatures.
 Private key: Used for decryp on or crea ng signatures.
 Advantages:
 Eliminates the need for secure key distribu on.
 Enables authen ca on and non-repudia on.
 Examples: RSA, Ellip c Curve Cryptography (ECC).

RSA Algorithm
1. Introduc on to RSA:
 RSA is one of the most widely used asymmetric encryp on algorithms.
 Named a er its inventors: Rivest, Shamir, and Adleman.
 Relies on the computa onal difficulty of factoring large composite numbers.
2. Steps in RSA:
 Key Genera on:
 Choose two large prime numbers p and q.
 Compute n=p×q (modulus) and ϕ(n)=(p−1)(q−1) (Euler’s to ent).
 Select a public key e such that 1<e<ϕ(n) and gcd(e,ϕ(n))=1.
 Compute the private key d such that (e×d)modϕ(n)=1.
 Encryp on:

 Decryp on:

3. Applica ons:
 Secure data transmission.
 Digital signatures.
Symmetric & Asymmetric Key Cryptography Together
 Hybrid Cryptography:

 Combines symmetric and asymmetric techniques to op mize security and efficiency.


 Example:
 Asymmetric cryptography (e.g., RSA) is used to securely exchange a symmetric key.
 The symmetric key is then used for encryp ng large amounts of data.

Digital Signature
1. Defini on:
 A digital signature is a cryptographic technique for verifying the authen city and integrity of
a digital message or document.
2. Steps in Digital Signature Process:
 Signing:

 Generate a hash of the message.


 Encrypt the hash using the sender's private key.
 Verifica on:
 Decrypt the signature using the sender's public key to obtain the hash.
 Recompute the hash of the message and compare it with the decrypted hash.
3. Features:
 Ensures authen ca on, data integrity, and non-repudia on.

Message Digest and Hash Func on


1. Basic Concepts:

 A message digest is a fixed-size output (hash) derived from input data.


 A hash func on processes data to produce a message digest.
 Proper es:
 Determinis c: Same input always produces the same output.
 Pre-image Resistance: Difficult to reverse the hash to obtain the original data.
 Collision Resistance: Hard to find two inputs that produce the same hash.
2. Applica ons:
 Digital signatures.
 Data integrity verifica on.
 Password storage.
Secure Hash Algorithm (SHA-512)

1. Logic of SHA-512:
 Part of the SHA-2 family.
 Produces a 512-bit hash output.
 Processes data in 1024-bit blocks.
2. SHA-512 Round Func on:
 Message Preprocessing:
 Padding: Extend the message length to a mul ple of 1024 bits.
 Parsing: Divide the padded message into 1024-bit blocks.
 Ini alize hash values and constants.
 Compression Func on:
 Applies 80 rounds of opera ons.
 Each round uses logical func ons (AND, OR, XOR), modular addi on, and bitwise shi s.
 Finaliza on:
 Combines intermediate hash values to produce the final 512-bit digest.

You might also like