Key points of modular exponentiation
{"Image DocumentName": "Key points of modular exponentiation", "Image ImageDescription": "xm mod n can be efficiently calculated by expressing the exponent m in binary. Fermat\u2019s little theorem: Let p be a prime number and let x be an integer that is not divisible by p. Then, \ud835\udc65 \ud835\udc5d\u22121 \u22611 mod p. Euler\u2019s theorem: Let p and q be distinct prime numbers and let x be an integer that is not divisible by p or q. Then, \ud835\udc65 (\ud835\udc5d\u22121)(\ud835\udc5e\u22121) \u22611 \ud835\udc5a\ud835\udc5c\ud835\udc51 \ud835\udc5d\ud835\udc5e. \ud835\udc65 \ud835\udc5d\u22121 \ud835\udc5e\u22121 +1 \u2261\ud835\udc65 \ud835\udc5a\ud835\udc5c\ud835\udc51 \ud835\udc5d\ud835\udc5e. More generally, if m \u2261 1 mod (p-1)(q-1) then. \ud835\udc65 \ud835\udc5a \u2261\ud835\udc65 \ud835\udc5a\ud835\udc5c\ud835\udc51 \ud835\udc5d\ud835\udc5e.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}