What is RSA (Rivest–Shamir–Adleman) in Hindi

RAS एक ऐसी पहली practical public-key cryptosystem है जिसे data transmission को secure करने के लिए use किया जाता है, इस cryptosystem मे encryption key से different ओर secret रहती है RSA practical clifficultyहै जिसमे दो layer prime नंबर के product का factoring किया जाता है

RSA एसके developer के surnames से बना है

Ron Rivest, Adi Shamir, and Leonard Adleman है

एसे सर्व प्रथम 1977 मे publicly describe किया गया था

Key sizes: 1,024 to 4,096 bit typical

First published: 1977

Rounds: 1

Algorithm:-

1. Generate two large random primes, p p, and q q, of an approximately equal size such that their product n=pqn=pq is of the required bit length, e.g. 1024 bits.

2. Compute n=pqn=pq and ϕ=(p−1)(q−1)ϕ=(p−1)(q−1).

3. Choose an integer ee, 1<e<ϕ1<e<ϕ, such that gcd(e,ϕ)=1gcd(e,ϕ)=1.

4. Compute the secret exponent dd, 1<d<ϕ1<d<ϕ, such that ed≡1modϕed≡1modϕ.

5. The public key is (n,e)(n,e) and the private key (d,p,q)(d,p,q). Keep all the values d, p, q, and ϕϕ secret. [Sometimes the private key is written as (n,d)(n,d) because you need the value of n when using d. Other times we might write the key pair as ((N,e),d)((N,e),d).]

• n is known as the modulus.
• e is known as the public exponent or encryption exponent or just the exponent.
• d is known as the secret exponent or decryption exponent