Encryption-RSA | public-key cryptosystem for secure data transmission

Encryption-RSA is a Java library. Encryption-RSA has no bugs, it has no vulnerabilities and it has low support. However Encryption-RSA build file is not available. You can download it from GitHub.

step-1: choose two prime number p and q lets take p = 3 and q = 11. step-2: compute the value of n and \phi it is given as, n = p \times q and \phi = (p-1) \times (q-1). here in the example, n = 3 \times 11 = 33 \phi = (3-1) \times (11-1) = 2 \times 10 = 20. step-3: find the value of e (public key) choose e, such that e should be co-prime. co-prime means it should not multiply by factors of \phi and also not divide by \phi. factors of \phi are, 20 = 5 \times 4 = 5 \times 2 \times 2 so e should not multiply by 5 and 2 and should not divide by 20. so, primes are 3, 7, 11, 17, 19…, as 3 and 11 are taken choose e as 7. therefore, e = 7. step-4: compute the value of d (private key) the condition is given as, gcd(\phi, e) = \phi x +ey = 1 where y is the value of d. to compute the value of d,. form a table with four columns i.e., a, b, d, and k. initialize a = 1, b = 0, d = \phi, k = – in first