Abstract Algebra: Theory and Applications · Problem 7.4.12

Algebraic Coding Theory — Thomas Judson

Mathematics — Abstract Algebra · rsa-fixed-point

Problem

Find integers nn, EE, and XX such that XE≡X(modn).X^E \equiv X \pmod{n}. Is this a potential problem in the RSA cryptosystem?

Related theory

Browse the problem library