Tanja Lange: Cryptology | Poke

Tanja Lange: Cryptology @UCtn5gh5LSZiNg7_2LnizUyA@youtube.com

454 subscribers - no pronouns :c

This is the channel for the course 2MMC10 - Cryptology at Ei

Videos Playlists

Recently Uploaded Popular Oldest

DL systems over finite fields IV- Example for index calculus attack

Pitch for Cryptology course

Post-quantum cryptography - Overview

Paillier's cryptosystem - Addtive homomorphic encryption

Elliptic-curve cryptography XIII - Security requirements

Pairings III - Supersingular curves

Pairings II - Pairing based protocols

Pairings I- Impact on security

Elliptic-curve cryptography XII - Speedups to Pollard rho for ECC

DL systems over finite fields III - Key sizes and DSA

DL systems over finite fields II - Index calculus attacks

DL systems over finite fields I - ElGamal encryption and KEM-DEM framework

RSA XI - LLL, Coppersmith/Howgrave-Graham, and stereotyped messages

RSA X - Coppersmith method

RSA IX - Bad randomness

RSA VIII - Number-field sieve

RSA VII - Q-sieve

RSA VI - Square roots mod n and Dixon's method of random squares

RSA V - p - 1, p + 1 methods and ECM

RSA IV - Factorization overview and Pollard rho

RSA III - Primality tests & primality proofs

RSA II - RSA signature, use in PGP, and RSA CRT

RSA I - Security notions and schoolbook RSA

Symmetric-key cryptography VII - Message authentication codes (MACs)

Symmetric-key cryptography VI - Example of cryptanalysis of block ciphers

Symmetric-key cryptography V - Example of block cipher

Elliptic-curve cryptography XI - Identification schemes and signatures

Elliptic-curve cryptography X - Signatures: definitions and properties

Cryptographic hash functions V - Sponge functions

Cryptographic hash functions IV - Proofs by reduction

Cryptographic hash functions III - Formal security notions

Cryptographic hash functions II - Pollard rho for collision search

Cryptographic hash functions I - Practical aspects and generic hardness

Short intro to Sage

Discrete logarithm problem VIII - Summary of DL systems

Discrete logarithm problem VII - Pohlig-Hellman attack

Discrete logarithm problem VI - Building up to Pohlig-Hellman attack

Discrete logarithm problem V - Paralel collision search

Discrete logarithm problem IV - Pollard's rho method

Discrete logarithm problem III - Random walks and cycle nding

Discrete logarithm problem II - Brute-force seach and BSGS

Discrete logarithm problem I - Hardness assumptions and usage

Elliptic-curve cryptography IX - Explicit formulas

Elliptic-curve cryptography VIII - Constant-time scalar multiplication

Elliptic-curve cryptography VII - Timing attacks and scalar multiplication

Elliptic-curve cryptography VI - Montgomery curves and birational equivalence

Elliptic-curve cryptography V - Weierstrass curves

Elliptic-curve cryptography IV - Edwards curves and twisted Edwards curves

Elliptic-curve cryptography III - Edwards curves

Elliptic-curve cryptography II -- Clocks over finite fields

Elliptic-curve cryptography I - Diffie-Hellman and clocks

Introduction - How all the pieces fit together