[Retracted] The Impact of IoT on News Media in the Smart Age

Algorithm 1

Rivest-Shamir-Adelman algorithm.

	Step 1: Choose any two prime numbers p, t.
	Step 2: Determine m = p  t
	Step 3: Determine ∅ (m)=(p−1)   (t−1)
	Step 4: Choose an integer f such that GDC (∅(m), f) = 1; 1 < f < ∅(m)
	Step 5: Determine c such that it equals
	Step 6: PK = [f, m] is the public key
	Step 7: PS = γ_≤ c, m_(/e) private key
	Step 8: Consider the basic text N, N < m
	Step 9: Using D =  mod m, find the plain text cipher
	Step 10: Send the coded message to the recipient
	Step 11: using , get plain text from cipher by the receiver