Encryption, Post Quantum Cryptography, Optical Computing, Cryptography.
of the message m. We can see this in the image above, where (2⁴)² mod(5)≡2⁸ mod(5). Because c ≡ mᵉ mod (N), raising c to the power of d is the same as writing (mᵉ)ᵈ mod (N) ≡ m mod(N). Exploiting the properties of congruence and modular exponentiation is what allows us to both encrypt and decrypt