Asymmetric Cryptography

•Asymmetric cryptography, also known as public-key

cryptography, is a process that uses a pair of related keys -- one
public key and one private key -- to encrypt and decrypt a
message and protect it from unauthorized access or use.
•Each user has two keys: a public key and a private key.
•Both keys are mathematically related (both keys together are
called the key pair).
•The public key is made available to anyone. The private key is
kept secret.
•Both keys are required to perform an operation. For example, 
data encrypted with the private key is unencrypted with
the public key. Data encrypted with the public key is
unencrypted with the private key.

06/09/2023 Made By Sanawar And Shajar 1

HMAC
Hash-based Message Authentication
Code (HMAC) is a message authentication code that
uses a cryptographic key in conjunction with a hash
function.
 Hash-based message authentication code (HMAC)
provides the server and the client each with a private
key that is known only to that specific server and that
specific client.

06/09/2023 Made By Sanawar And Shajar 2

How HMAC Works?
Hash-based Message Authentication Code (HMAC) is
a message authentication code that uses
a cryptographic key in conjunction with a hash
function.
Hash-based message authentication code (HMAC)
provides the server and the client each with a private
key that is known only to that specific server and that
specific client.

06/09/2023 Made By Sanawar And Shajar 3

Cryptographic Keys
Cryptographic keys make encryption and decryption
possible. In SSL encryption, there are two keys, a
public key and a private key.
In cryptography, an encryption key is a variable value
that is applied using an algorithm to a string or
block of unencrypted text to produce encrypted
text or to decrypt encrypted text. 

06/09/2023 Made By Sanawar And Shajar 4

Hash Function
Hash functions (hashing algorithms) used in
computer cryptography are known as "cryptographic
hash functions". 
Examples of such functions are SHA-256 and SHA3-
256, which transform arbitrary input to 256-bit output.

06/09/2023 Made By Sanawar And Shajar 5

Secret Key
In symmetric cryptography a secret key (or “private
key”) is a piece of information or a framework that
is used to decrypt and encrypt messages.
Each party to a conversation that is intended to be
private possesses a common secret key.

06/09/2023 Made By Sanawar And Shajar 6

Algorithm
Cryptography algorithms are the means of altering
data from a readable form to a protected form and
back to the readable form.
 Cryptographic algorithms are used for important
tasks such as data encryption, authentication, and
digital signatures.

06/09/2023 Made By Sanawar And Shajar 7

Diffie Hellman Algorithm
The Diffie–Hellman (DH) Algorithm is a key-
exchange protocol that enables two parties
communicating over public channel to establish a
mutual secret without it being transmitted over
the Internet. 
DH enables the two to use a public key to encrypt and
decrypt their conversation or data using symmetric
cryptography.

06/09/2023 Made By Sanawar And Shajar 8

RSA
RSA is a public-key cryptosystem that is widely used
for secure data transmission. It is also one of the
oldest. 
The acronym "RSA" comes from the surnames of Ron
Rivest, Adi Shamir and Leonard Adleman, who
publicly described the algorithm in 1977.

06/09/2023 Made By Sanawar And Shajar 9

RSA Block Diagram

06/09/2023 Made By Sanawar And Shajar 10

RSA encryption algorithm:

RSA is the most common public-key algorithm,

named after its inventors Rivest, Shamir, and
Adelman (RSA).

06/09/2023 Made By Sanawar And Shajar 11

RSA algorithm uses the following procedure to generate
public and private keys:
 Select two large prime numbers, p and q.
 Multiply these numbers to find n = p x q, where n is called the modulus for
encryption and decryption.
 If n = p x q, then the public key is <e, n>. A plaintext message m is encrypted
using public key <e, n>. To find ciphertext from the plain text following
formula is used to get ciphertext C.
C = me mod n
Here, m must be less than n. A larger message (>n) is treated as a
concatenation of messages, each of which is encrypted separately.

06/09/2023 Made By Sanawar And Shajar 12

RSA algorithm uses the following procedure to generate
public and private keys:
 Choose a number e less than n, such that n is relatively prime to (p - 1)
x (q -1). It means that e and (p - 1) x (q - 1) have no common factor
except 1. Choose "e" such that 1<e < φ (n), e is prime to φ (n),
gcd (e,d(n)) =1
 To determine the private key, we use the following formula to calculate
the d such that:
De mod {(p - 1) x (q - 1)} = 1
Or
De mod φ (n) = 1
 The private key is <d, n>. A ciphertext message c is decrypted using
private key <d, n>. To calculate plain text m from the ciphertext c
following formula is used to get plain text m.
m = cd mod n

06/09/2023 Made By Sanawar And Shajar 13

Steps Of RSA
Step-1: Choose two prime number and. Lets take and.
Step-2: Compute the value of and. It is given as, ...
Step-3: Find the value of (public key) Choose , such
that should be co-prime. ...
Step-4: Compute the value of (private key) The
condition is given as, ...
Step-5: Do the encryption and decryption.

06/09/2023 Made By Sanawar And Shajar 14

Examples Of Asymmetric Algorithm
Rivest Shamir Adleman (RSA)
the Digital Signature Standard (DSS), which
incorporates the Digital Signature Algorithm (DSA)
Elliptical Curve Cryptography (ECC)
the Diffie-Hellman exchange method.
TLS/SSL protocol.

06/09/2023 Made By Sanawar And Shajar 15

Encryption And Decryption

06/09/2023 Made By Sanawar And Shajar 16