Completed
Complexity analysis of Euclidian Algorithm and RSA Cryptosystem square and multiply algorithm
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Introduction to Cryptology
Automatically move to the next video in the Classroom when playback concludes
- 1 Introduction Caeser cipher
- 2 Modular arithmetic, shift cipher
- 3 Affine Cipher, Vigenere Cipher
- 4 Prefect secrecy, Application of Shift Cipher
- 5 Problem Discussion on Affine cipher and Perfect Secrecy
- 6 Product Cipher, Block Cipher, Modes of Operation for Block Cipher
- 7 Substitution Permutation network, Fiestel Cipher
- 8 S-Box Theory
- 9 Cryptanalysis and its Variants, Linear Attack
- 10 Problem Discussion
- 11 Public Key Cryptology Introduction RSA Cryptosystem
- 12 Complexity analysis of Euclidian Algorithm and RSA Cryptosystem square and multiply algorithm
- 13 Primality testing: Miler-Rabin Algorithm, Legendre Symbol and Jacobi Symbol
- 14 Efficien Computation of Jacobi Symbol Primality Testing:Solovay-Stassen Algorithm
- 15 Problem Discussion on Jacobi Symbol Calculation and RSA Cryptosystem
- 16 Cryptographic hash function: Introduction
- 17 Random Oracle model, Security of hash functions
- 18 Randomized Algorithm and its application on Preimage resistance and collision resistance
- 19 Iterated Hash Functions
- 20 Problem Discussionn
