The complete cyclic structure of the RSA cryptosystem

H. Suzuki, H. Yasuoka & K. Matsushita · 2015

RSA (Rivest-Shamir-Adleman) cryptosystem (Rivest 1978b) appeared at MIT in 1977 as a method of public key encryption and digital signature. RSA encryption and decryption processes are C = Me mod n and M = Cd mod n, respectively, with a plaintext M, the corresponding ciphertext C, a public modulus key n, a public exponent key e and a private exponent key d where e and d must hold e · d ≡ 1(mod λ (n)) or e · d ≡ 1(mod ϕ (n)).

Read the paper · More papers on PaperTik