Lectures related to Generator of a Group

Diffie-Hellman Cryptography: Key Exchange and Fields

Explores Diffie-Hellman key exchange, group orders, Z_p field, and cryptographic challenges.

Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.

Diffie-Hellman and ElGamal Cryptosystems

Explores Diffie-Hellman key exchange, ElGamal cryptosystem, and their security applications in cryptography.

Cryptography and Information Theory

Explores cryptography, perfect secrecy, group theory, and modern cryptographic milestones, emphasizing the trade-off between security and cost.

Diffie-Hellman Cryptography: Key Exchange and Attacks

Explores Diffie-Hellman key exchange, DDH problem, active attacks, and cryptographic protocol challenges.

Discrete Exponentiation Complexity

Explores discrete exponentiation complexity, cyclic groups, and practical cryptography, including popular algorithms like Diffie-Hellman and RSA.

Diffie-Hellman Cryptography: Key Exchange and ElGamal Encryption

Covers the Diffie-Hellman key exchange protocol and the ElGamal public-key cryptosystem.

Factoring Polynomials: Complexity and Algorithms

Delves into the complexity of factoring polynomials and the implications for security.

RSA Cryptography: Primality Testing and Quadratic Residues

Explores RSA cryptography, covering primality testing, quadratic residues, and cryptographic applications.

Prime Numbers and Algorithms

Covers prime numbers, primality testing algorithms, modular arithmetic, and efficient exponentiation methods.

Shor's factoring algorithm: Quantum Phase Estimation

Covers Shor's factoring algorithm and the link between order finding and factoring.

Public-Key Cryptography: Key Exchange and Signatures

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

Elements of computational complexity

Covers classical and quantum computational complexity concepts and implications.

Shor's Factoring Algorithm

Covers Shor's factoring algorithm, aiming to find integer factors efficiently using quantum computation.

Elementary Algebra: Numeric Sets

Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.

Cryptographic Primitives: Theory and Practice

Explores fundamental cryptographic primitives, security models, and the relationship between decryption security and key recovery security.

Distributed Randomness: Drand

Explores distributed randomness using Drand, covering cryptographic tools, key exchange, elliptic curve cryptography, and practical applications in blockchain systems.

Introduction to Cryptography: Fundamentals and Applications

Covers the fundamentals of cryptography, including symmetric encryption, digital signatures, and secure communication standards.

Algorithms for Big Numbers: Z_n and Orders

Covers algorithms for big numbers, Z_n, and orders in a group, explaining arithmetic operations and cryptographic concepts.

Groups and Numbers: Hidden Subgroup Problem

Explores groups and numbers, emphasizing the hidden subgroup problem and its complexities in classic and quantum algorithms.