Skip to content

FOLLOW AN IDEA

Cryptographic security models

Security depends on defined adversary capabilities, assumptions and failure probability.

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.

  • Diffie–Hellman key agreement

    Parties derive a shared secret through group exponentiation; authentication is needed against interception.

  • Digital signatures

    A private signing key and public verification key authenticate messages under security assumptions.

Back to the complete concept index →

Knowledge connections

Appears in these maps

LEARNING MAP

Cryptography

Explore arithmetic and security models; encryption and authentication; groups, signatures and hashes. Concepts and connections are available independently of video coverage.

Scope reference