Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Cryptanalysis: Public-Key & The Power of Interaction

Related lectures (31)

Interactive Proofs: The Power of Interaction

Explores interactive proofs, zero-knowledge, parallel composition, and cryptographic protocols.

The Power of Interaction: Zero-Knowledge Construction

Explores zero-knowledge construction, setup models, and the power of interaction in cryptographic protocols, including Sigma Protocol and NP Zero-Knowledge Proofs.

Cryptanalysis: Public-Key

Explores cryptanalysis in public-key cryptography, covering attacks, algorithms, and security models.

Complex Systems: Critical Phenomena

Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.

Cryptanalysis: The Power of Interaction

Explores the power of interaction in cryptographic primitives and conventional cryptanalysis techniques.

Public-Key Cryptography: Key Exchange and Signatures

Explores public-key cryptography, key exchange, and digital signatures, discussing practical applications and security mechanisms.

Theory of Computability: Solvability and Complexity

Explores the theory of computability, decision problems, complexity classes, and the 'P vs. NP' conundrum.

P vs NP: Complexity Theory

Delves into complexity theory, focusing on the P vs NP problem and the classification of computational problems based on efficiency.

Computational Complexity: Theory and Applications

Explores computational complexity, NP-completeness, and polynomial reductions in theoretical computer science.

Complexity Classes: P and NP

Explores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.

Elements of Computational Complexity

Introduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.

Cryptographic Security Fundamentals

Covers cryptographic security fundamentals, including collision search algorithms, public-key cryptography, and risks of underestimating collision attacks.

Cryptographic Security Models

Explores Cryptographic Security Models, including Diffie-Hellman and ElGamal Security, RSA, and practical encryption problems.

Elements of Computational Complexity

Covers quantum algorithms, complexity classes, Grover's algorithm, and quantum information in computational complexity.

Density Operator Formalism

Covers the density operator formalism, polynomial time, NP problems, BPP, QMA, and probabilistic algorithms.

Theory of Computation: NP Complexity

Delves into oracles, certificates, and the NP complexity class, raising the fundamental P versus NP question.

RSA Encryption: Principles and Applications

Explores RSA encryption principles, factorization challenges, and practical applications in data security.

Public-Key Cryptography: Standards and Applications

Discusses public-key cryptography, focusing on standards like RSA, DSA, and AES, and their applications in secure communications.

Cryptography basics: Quantum Systems

Covers the basics of cryptography, encryption, decryption, error detection, and the impact of quantum computing.

RSA: Privacy and Signatures

Explores RSA encryption for privacy and digital signatures, covering keys generation, decoding, possible attacks, hash functions, and cryptographic standards.