BY- ARUSH SAXENA (HOTBURN)

Review

of Cryptography and its terms -

What

oEncryption, oDecryption, oAuthentication, oDigital signature.

Key Generation Algorithm Encryption Decryption

Usage

is RSA ?

of RSA RSA Security Implementation Tools

message

encryption algorithm

encryption key

Transmission Channel

decryption key

decryption algorithm

message

unreadable by anyone is known as encryption. Decryption: It is the opposite of encryption. It may require secret decryption key. Authentication: Authentication in a digital setting is a process whereby the receiver of a digital message can be confident of the identity of the sender and/or the integrity of the message. Authentication protocols can be based on either conventional secret-key cryptosystems like DES or on public-key systems like RSA; authentication in public-key systems uses digital signatures. Digital Signature: It is an unforgeable piece of data asserting that a named person wrote or otherwise agreed to the document to which the signature is attached.

Encryption: The transformation of data into a form

 Public

Key algorithm invented in 1977 by Ron Rivest, Adi Shamir and Leonard Adleman (RSA). Supports Encryption and Digital Signature. Most Widely used public Key Algorithm. Gets its security from integer factorization Problem. Relatively easy to understand and implement.

public encryption method that relies on a public encryption algorithm, a public decryption algorithm, and a public encryption key. Using the public key and encryption algorithm, everyone can encrypt a message. The decryption key is known only to authorized parties.

and q are two prime numbers. n = pq pi = (p-1)(q-1) Choose e is such that 1 < e < pi and gcd(pi,e) = 1. Compute d is such that d=e-1 mod(pi). The public key is (n, e) and the private key is (n, d).

Sender A does the following: Obtains the public key (n, e).
Represents the plaintext message as a positive

integer m. Computes the ciphertext c = me mod n. Sends the ciphertext c to B.

Recipient B does the following: Uses his private key (n, d) to compute

m = cd mod n. Extracts the plaintext from the message representative m.

RSA is used in security protocols such as:

-IPSEC -- IP Data Security -TLS/SSL -- transport data security (web) -PGP -- email security -SSH -- terminal connection security -SILC -- conferencing service security

RSA gets its security from factorization problem. Difficulty of factoring large numbers is the basis of security of RSA. Over 1000 bits long numbers are used. Integer factorization problem (finding number's prime factors):

o Positive integer n, find its prime factors: n = p1 p2 ... pi

where, pi is positive distinct prime number. Example: 257603 = 41 * 61 * 103 o Factorization algorithms can be used to factor faster than brute forcing: Trial division, Pollard's rho, Pollard's p-1, Quadratic sieve, elliptic curve factorization, Random square factoring, Number field sieve, etc.

In order to implement RSA one requires

Arbitrary Precision Arithmetic
Pseudo Random Number Generator(PRNG)

Prime Number Generator