Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Web of trust wikipedia , lookup
Japanese cryptology from the 1500s to Meiji wikipedia , lookup
Public-key cryptography wikipedia , lookup
Block cipher wikipedia , lookup
One-time pad wikipedia , lookup
Factorization of polynomials over finite fields wikipedia , lookup
Quantum key distribution wikipedia , lookup
Digital signature wikipedia , lookup
Diffie–Hellman key exchange wikipedia , lookup
Cryptography wikipedia , lookup
History of cryptography wikipedia , lookup
IT662 Cryptography and Coding Theory L – T – P: 3 – 0 – 0 Credit: 3 Objectives: The objective of the course is to provide detail knowledge of cryptography and Coding Theory Pre-requisite: Cryptography knowledge of under grad level. Outcome: Should have earned knowledge of several cryptographic algorithms and their usage in application development. UNIT I Lectures: 8 Overview: Secure Communications. Cryptographic Applications. Classical Cryptosystems: Shift Ciphers. Affine Ciphers. The Vingenere Cipher. Substitution Ciphers. Sherlock Holmes. The Playfair and ADFGX Ciphers. Block Ciphers. Binary Numbers and ASCII. One-Time Pads. Pseudo-random Bit Generation. Linear Feedback Shift Register Sequences. Enigma. Basic Number Theory: Basic Notions. Solving ax + by = d. Congruences. The Chinese Remainder Theorem. Modular Exponentiation. Fermat and Euler. Primitive Roots. Inverting Matrices Mod n. Square Roots Mod n. Finite Fields. UNIT II Lectures: 8 The Data Encryption Standard: Introduction. A Simplified DES-Type Algorithm. Differential Cryptoanalysis. DES. Modes of Operation. Breaking DES. Password Security. AES: Rijndael. The Basic Algorithm. The Layers. Decryption. Design Considerations. The RSA Algorithm: The RSA Algorithm. Attacks on RSA. Primality Testing. Factoring. The RSA Challenge. An Application to Treaty Verification. The Public Key Concept. UNIT III Lectures: 8 Discrete Logarithms: Discrete Logarithms. Computing Discrete Logs. Bit Commitment. The ElGamal Public Key Cryptosystem. Digital Signatures: RSA Signatures. The ElGamal Signature Scheme. Hash Functions. Birthday Attacks. The Digital Signature Algorithm. E-Commerce and Digital Cash: Secure Electronic Transaction. Digital Cash.Secret Sharing Schemes: Secret Splitting. Threshold Schemes. Exercises. UNIT IV Lectures: 8 Games: Flipping Coins over the Telephone. Poker over the Telephone. Zero Knowledge Techniques: The Basic Setup. Feige-Fiat-Shamir Identification Scheme.Key Establishment Protocols: Key Agreement Protocols. Key Pre-distribution. Key Distribution. Public Key Infrastructures (PKI). Information Theory: Probability Theory. Entropy. Huffman Codes. Perfect Secrecy. The Entropy of English. UNIT V Lectures: 10 Elliptic Curves: The Addition Law. Elliptic Curves Mod n. Factoring with Elliptic Curves. Elliptic Curves in Characteristic 2. Elliptic Curve Cryptosystems. Error Correcting Codes: Introduction. Error Correcting Codes. Bounds on General Codes. Linear Codes. Hamming Codes. Golay Codes. Cyclic Codes. BCH Codes. Reed-Solomon Codes. The McEliece Cryptosystem. Other Topics. Quantum Cryptography: A Quantum Experiment. Quantum Key Distribution. Shor's Algorithm.