Cryptography
Explore arithmetic and security models; encryption and authentication; groups, signatures and hashes. Concepts and connections are available independently of video coverage.
FOLLOW AN IDEA
Congruence identifies integers with the same remainder modulo a positive integer.
Explore concept graph · Explore connected videos
No reviewed video yet. Explore the concept in a map or suggest a resource. Suggest a video
Security depends on defined adversary capabilities, assumptions and failure probability.
The Euclidean algorithm computes a greatest common divisor by repeated division with remainder. Replacing (a,b) by (b,r) preserves the common divisors, and the strictly smaller nonnegative remainders force termination.
Coprime residues satisfy power congruences controlled by prime moduli or Euler's totient.
A group has an associative operation, an identity and an inverse for every element.
An integer has an inverse modulo n exactly when it is coprime to n.
Explore arithmetic and security models; encryption and authentication; groups, signatures and hashes. Concepts and connections are available independently of video coverage.
Connect functions and counting with elementary number theory, graph structures and algorithmic reasoning. Shared concepts and reviewed map connections organize the path; video explanations are added as resources pass review.
Explore divisibility and congruences; arithmetic functions and equations; prime distribution and advanced connections. Concepts and connections are available independently of video coverage.