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
Chinese remainder theorem
Pairwise coprime moduli give a unique combined congruence class modulo their product.
Explore concept graph · Explore connected videos
Different ways to understand it
No reviewed video yet. Explore the concept in a map or suggest a resource. Suggest a video
More concepts to explore
Cryptographic security models
Security depends on defined adversary capabilities, assumptions and failure probability.
Modular inverses
An integer has an inverse modulo n exactly when it is coprime to n.
Prime factorization
Every integer greater than one factors uniquely into primes up to their order.
Cryptographic hashes
Cryptographic hashes aim at preimage and collision resistance; hashing alone is not encryption.
Diffie–Hellman key agreement
Parties derive a shared secret through group exponentiation; authentication is needed against interception.
Knowledge connections
- Modular inverses · Related · Map context
- Cryptographic security models · Related · Map context
- Modular inverses · Related · Map context
- Prime factorization · Related · Map context
Appears in these maps
Number Theory
Explore divisibility and congruences; arithmetic functions and equations; prime distribution and advanced connections. Concepts and connections are available independently of video coverage.