Toggle navigation
About us
Courses
Contact us
Courses
Computer Science and Engineering
Computational Number Theory & Cryptography (Web)
Syllabus
Co-ordinated by :
IIT Guwahati
Available from :
2013-01-02
Lec :
1
Modules / Lectures
Computational Complexity
Complexity of Computation & Complexity Classes
Encoding Scheme
GCD Computation
Elementary Number-Theory
Euclid's Algorithm
Finite Groups
Modular Arithmetic Groups
Subgroups
Primitive Roots
Generator Computation
Modular Arithmetic
Solving modular linear equations
Modular exponentiation
Chinese Remainder Theorem
Discrete Logarithm Problem
Quadratic Residues
Key Exchange
Diffie Hellman key Exchange
Cryptosystems Based on Discrete Log
Public Key Cryptosystem
Public Key Cryptosystem & RSA
Choice of the Public Key
Attacks on RSA & Remedies
Rabin Cryptosystem
Factorization
Pollard-Rho Method
Pollard Rho Analysis
Current state of the art
Large prime variant
Dixon's factorization method
Quadratic-Sieve Factoring
Primality Testing
Primality Testing
Fermat Primality Test
AKS PRIMALITY TEST
Eliptic curves Cryptography
Elliptic Curve Cryptography
Zero Knowledge Proof
Elliptic Curves
Elliptic Curves(contd.) and Finite Fields
ECDLP
Hash Function & Digital Signatures
Elgamal Digital Signature Scheme
Blind & Prony Signature
Short signature scheme I
Short signature scheme II
Cryptographic Hash Function
Stream Ciphers
Video Data Cippers
Web Content
loading...
Module Name
Download