Lightweight Cryptographic Algorithms for Guessing Attack Protection in Complex Internet of Things Applications

Table 6

RSA key creation, encryption, and decryption.

Sender	Receiver
Key creation
Choose two secret prime numbers p and q. Choose encryption exponent e with GCD (e, (p − 1) (q − 1)) = 1. Publish N = pq, and e.
Encryption
	Choose plaintext m. Use Bobʼs public key (N, e) to compute c = m^e mod N. Send ciphertext c to Bob
Decryption
Compute d satisfying Ed = 1(mod (p − 1) (q − 1))
Complexity compute m′ = c^d mod N Then m′ equals the plaintext m.