Abstract Algebra: Theory and Applications · Problem 6.5.8

Introduction to Cryptography — Thomas Judson

Mathematics — Abstract Algebra · fermats-little-theorem

Problem

Use Fermat's Little Theorem to show that if

p = 4n + 3

is prime, there is no solution to the equation

x^2 \equiv -1 \pmod{p}