What is RSA Algorithm and its

applicability in daily life?

About RSA Algorithm

1. It is an algorithm used to send data over the

internet securely using encrytion.
2. It is named after its founders, Ron Rivest, Adi
Shamir, and Leornard Adleman who invented this
in the year of 1977.
3. It is a public-key algorithm using a public to
encrypt the data and the private key to decrypt the
data.
4. The public key is shared to everyone but the
private is used individually to decrypt the data
more securely.

Daily life applicability

5. Used in email system wherein the sender uses
the public key of the recipient for encryption, and
then the reciever uses their private key to decrypt
the data.
6. Used in secure messaging applications: Here the
RSA Algorithm is used to encrypt and decrypt the
messages and not be read by third-party.
Basic Principles of symmeteric and
asymmeteric algorithms.

1. Symmeteric Algorithms: Here a single key is used

to both encrypt and decrypt the data.

Examples of the algorithms are: AES (Advanced

Encryption Standard), DES(Data Encryption
Standard). The basic principles of this are:
1. Confidentiality: This maintains confidentiality
as long as the key is secret amongst the
sender and reciever. If the key is secret then
the basis of confidentiality is maintained.
2. Effieciency: These are faster as they use the
same key for both encryption and decrytion.
3. Key Management: The key used here must
be kept secure and be periodically changed
to maintain the security.
2. Asymmeteric Algorithm: Here two different keys
are used to encrypt and decryot the data. The
public is shared to others while the private is kept
secured with oneself.The basis of this principle
are:
1. Confidentiality:Here confidentiality is
maintained as the intended reviever only
reciveve the data using the private key.
 2. Integrity and authenticity: Asymmetric
encryption algorithms also provide integrity
and authenticity by allowing the sender to
create a digital signature using their private
key. The recipient can then verify the
signature using the sender's public key to
ensure that the data has not been tampered
with and that it originated from the sender.
3. Key management: Asymmetric encryption
algorithms require careful key management,
as the private key must be kept secure and
the public key must be shared widely.

Data Encryption Standard and

examples

It is an symmeteric encryption system developed by

IBM in 1970s, and later used by the US Gov as a
standard to secure sensitive data.

Examples of DES are:

1. Single DES: It uses a 56-bit key to encrypt and

decrypt the data, this is no longer used as it is
proved to be insecure.
2. 3DES: Also known as Triple DES. In this example
two or three keys are used,and the key length is
 of either 112 or 168 bts. It is more secure than
SDES but is more time-consuming than it.
3. Blowfish: It is an alternative to DES which is more
faster and secure than it. It uses key having
lenghts upto 448 bits and faster encrytion-
decryption rate.

Data encryption standards and

examples (eg AES).

Data encryption standards refer to a set of protocols

and algorithms used to encode digital data for secure
transmission and storage. The following are some
common examples of data encryption standards:

1. Advanced Encryption Standard (AES): AES is one

of the most widely used encryption standards,
which is a symmetric encryption algorithm. It uses
a 128-bit, 192-bit or 256-bit key to encrypt data.
AES is commonly used in securing sensitive
information such as financial transactions, military,
and government data.
2. Data Encryption Standard (DES): DES is a
symmetric key algorithm that uses a 56-bit key to
encrypt data. It was widely used in the past but
 has been replaced by the more secure AES
algorithm.
3. Triple Data Encryption Standard (3DES): 3DES is
an enhanced version of DES that uses three
iterations of the encryption algorithm, making it
more secure than DES. It uses a 168-bit key and
is commonly used in securing online transactions.

Blowfish, RC5, RC4.

Blowfish: Blowfish is a symmetric encryption

algorithm that uses a variable-length key between
32 and 448 bits. It is a popular encryption
algorithm in the open-source community.
RSA: RSA is an asymmetric encryption algorithm
that uses a public key and a private key. The
public key is used to encrypt data, while the
private key is used to decrypt data. RSA is
commonly used in securing email communication
and online transactions.

EI gamel cryptop systems

is a public-key encryption algorithm invented by Taher

Elgamal in 1985.
1. ElGamal Cryptosystem is a public-key encryption
algorithm that allows two parties to communicate
securely without having to share a secret key
beforehand.
2. It is based on the computational difficulty of
computing discrete logarithms in a finite field.
3. The algorithm involves generating a public key
and a private key for each party.
4. The public key consists of a prime number, a
generator of a multiplicative group of integers
modulo the prime, and a power of the generator
that is kept secret.
5. The private key is a random number chosen by
the party.
6. To encrypt a message, the sender uses the
recipient's public key to generate a ciphertext.
7. To decrypt the ciphertext, the recipient uses their
private key to compute the discrete logarithm of
the ciphertext with respect to the secret power of
the generator in the public key.
8. ElGamal Cryptosystem provides confidentiality
and integrity of messages, as well as non-
repudiation (i.e., the sender cannot deny having
sent the message).
 9. It is used in various applications, such as secure
communication, digital signatures, and electronic
voting.

Elliptic curve crptosystem

It is mostly used to encrypt the internet traffic.

Is a type of public-key cryptography.

Both the ECC and RSA are very similiar in nature but
these two points give more advantage to ECC over
RSA.

1. The 256-bit key in ECC offers about the same

security as a 3072-bit key using RSA.
2. It uses ~10% of resources as compared to RSA,
thus making it more usable in resource
constrained devices like embedded systems and
mobile phones etc.

The trapdoor function used by ECC can be

considered equivalent to the "mathematic game of
pool".

It goes as below: Diagram:

Starting at A :
A dot B = -C (Draw a line from A to B and it
intersects at -C)
Reflect across the X-axis from -C to C
A dot C = -D (Draw a line from A to C and it
intersects -D)
Reflect across the X-axis from -D to D
A dot D = -E (Draw a line from A to D and it
intersects -E)
 Reflect across the X-axis from -E to E

Digital signatures, applicability in day

to day life.EI Gamel digital signature
scheme

Digital signatures are a cryptographic tool used to

verify the authenticity, integrity, and non-
repudiation of digital documents and
communications.
They are useful in day-to-day life for secure
communication and identity verification in
situations such as online banking, e-commerce,
and contracts.
The ElGamal digital signature scheme is a
specific example of a digital signature scheme
that uses a public key and a private key to
generate and verify signatures.

KNAPSACK Algorithm system.

The knapsack algorithm is a type of cryptographic

algorithm used for encryption and decryption of data. It
is also known as the Merkle-Hellman knapsack
algorithm and was developed by Ralph Merkle and
Martin Hellman in 1978.

Here are the key points about the knapsack algorithm:

The algorithm is based on the mathematical

problem of the knapsack or subset sum problem.
In the knapsack algorithm, the sender first creates
a public key by generating a superincreasing
sequence of numbers and a multiplier that is
relatively prime to the sum of the sequence.
The plaintext message is then converted into
binary form and encrypted using the public key.
The receiver can decrypt the message using a
private key that corresponds to the public key.
The knapsack algorithm is considered secure
because solving the subset sum problem is
computationally difficult, making it hard for an
attacker to decrypt the message without the
private key.

The knapsack algorithm was widely used in the

1980s for secure communications and digital
signatures. However, it was later found to be
vulnerable to attacks

Creation of digital signature