CRYPTOGRAPHY

RSA modular exponentiation relationship

shows the core mathematical relationship of RSA public and private key modular exponentiation.

c\equiv m^e\pmod n,\quad m\equiv c^d\pmod n

symbols, variables and units

n=pq: product of two prime numbers; e, d: reciprocal exponent, ed≡1 mod λ(n); m, c: integer.

applicable conditions and boundaries

Naked RSA is not secure; the actual encryption must use standard padding, such as OAEP.

formula source code

The following is a copyable LaTeX expression.

c\equiv m^e\pmod n,\quad m\equiv c^d\pmod n

Reference and Extended Learning

NIST · Cryptographic Standards and Guidelines ↗

is organized according to model definition and assumptions. Please check actual conditions and original literature before engineering, research and clinical use.

RSApublic key password