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
Modular inverses
An integer has an inverse modulo n exactly when it is coprime to n.
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
Chinese remainder theorem
Pairwise coprime moduli give a unique combined congruence class modulo their product.
Modular arithmetic
Congruence identifies integers with the same remainder modulo a positive integer.
Cryptographic hashes
Cryptographic hashes aim at preimage and collision resistance; hashing alone is not encryption.
Cryptographic security models
Security depends on defined adversary capabilities, assumptions and failure probability.
Diffie–Hellman key agreement
Parties derive a shared secret through group exponentiation; authentication is needed against interception.
Knowledge connections
- Modular arithmetic · Related · Map context
- Chinese remainder theorem · Related · Map context
- Modular arithmetic · Prerequisite · Map context
- Modular arithmetic · Related · Map context
- Chinese remainder theorem · 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.