How to introduce quadratic residues?

Click For Summary
SUMMARY

This discussion focuses on effectively introducing quadratic residues to first-year undergraduates in an elementary number theory course. Key applications include their role in cryptography, particularly in the Goldwasser–Micali cryptosystem, and their use in computing Legendre symbols and expressing numbers as sums of two squares. The conversation highlights the importance of polynomial congruences, specifically the equation x² = A (mod M), as a foundational concept for students who have already studied linear congruences and Diophantine equations. Additionally, the relevance of quadratic residues in solving polynomial equations over integers in mod N arithmetic is emphasized.

PREREQUISITES
  • Understanding of Diophantine equations
  • Knowledge of linear congruences
  • Familiarity with primitive roots
  • Basic concepts of cryptography, particularly the Goldwasser–Micali cryptosystem
NEXT STEPS
  • Research polynomial congruences, focusing on the equation x² = A (mod M)
  • Explore the computation of Legendre symbols in number theory
  • Study the applications of quadratic residues in cryptographic algorithms
  • Investigate the theory of solving polynomial equations over integers in mod N arithmetic
USEFUL FOR

This discussion is beneficial for mathematics educators, first-year undergraduate students in number theory, cryptography enthusiasts, and anyone interested in the applications of quadratic residues in both theoretical and practical contexts.

matqkks
Messages
283
Reaction score
6
What is the most motivating way to introduce quadratic residues? I would like some concrete examples which have an impact. This is for first year undergraduates doing an elementary number theory course. They have done Diophantine equations, solved linear congruences, primitive roots.
 
Mathematics news on Phys.org
Quadratic residues are used in the factorization of large numbers, so they have applications in cryptography ( pseudo random number generators, in encryption algorithms (for example https://en.wikipedia.org/wiki/Goldwasser–Micali_cryptosystem), ...)
In mathematics they are used for the computation of Legendre symbols and for the proof when a number is expressible as sum of two squares ...
Ssnow
 
matqkks said:
They have done Diophantine equations, solved linear congruences

If the class has studied linear congruences then purely mathematical curiosity leads to asking about polynomial congruences. The simplest example would be ##x^2 = A (mod\ M)## I haven't studied this topic. A blog by John Cook https://www.johndcook.com/blog/quadratic_congruences/ deals with it.

I wonder if any application of quadratic residues to a practical topic comes by way of needing to solve ##x^2 = A (mod \ M)##.

primitive roots.

The solutions to the quadratic equation ##x^2 = -1## play a crucial role in the theory of solving general polynomial equations over the real numbers. I wonder if the solutions to ##x^2 = A (mod\ N)## play a crucial role in the theory of solving general polynomial equations over the integers in mod N arithmetic. Can anybody comment on that?
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K