Blockchain use RSA which involves a public key and a private key. The public key can be known to everyone and is used for encrypting messages. Messages encrypted with the public key can only be decrypted using the private key. The keys for the RSA algorithm are generated the following way:

1. Choose two distinct large random prime numbers p and q

P = 5

Q = 7

2. Compute n=pq

5*7 = 35

n=35

n is used as the modulus for both the public and private keys

3. Compute the totient: .(n)= (p-1)(q-1) <----- I need help with

4. Choose an integer such that 1 < e<.(n), and e and .(n ) share no factors other than 1 (coprime) <------- I need help with

e is released as the public key exponent

5. Compute d to satisfy the congruence relation de=1 mod ((n )) ie: de = 1 +k.(n) for some integer k. <------ I need help with

d is kept as the private key exponent