Course: Cryptography Code: (C$21104) Branch: M.Tech -1 Semester Lecture — |: Introduction and Overview Faculty & Coordinator : Dr. J Sathish Kumar (JSK) Department of Computer Science and Engineering Motilal Nehru National Institute of Technology Allahabad, Prayagraj-211004Course Objectives: 1. Provide a comprehensive overview of the history and fundamental principles of eryptog- raphy. 2. Understand the mathematical foundations essential for modem eryptographie systems. 3. Analyze the mechanisms of symmetric and asymmetric key encryption algorithms 4. Explore techniques for ensuring message integrity and authentication, 5. Introduce advanced cryptographic topics, including ECC and quantum cryptography. ‘Course Outcomes: 1. Explain the differences between various symmetrickey encryption algorithms like AES and DES. 2. Apply number theory concepts to the implementation of public-key cryptography, such as RSA. 3. Implement and analyze collision-resistant hashing for message integrity. 4. Understand the mechanisms and applications of digital signatures. 5. Deseribe the principles behind advanced concepts like DNA cryptography and digital watermarking Preparedty Dr.) Satish Kumar CSED, MNNITAlshabadCourse Outline (To be covered in 40 lectures): Unit 1: Introduction History and overview of cryptography, Probability and randomized algorithms, Number Theory. Unit 2: Basic Symmetric-Key Encryption One time pad and stream ciphers, Block ciphers, Attacks on block ciphers. AES, DES and other symmetric algorithms. Unit 3: Public Key Cryptography Arithmetic modulo primes, Cryptography using arithmetic modulo primes, Arithmetic modulo composites, RSA. ‘Unit 4: Message Integrity and Authentication Protocols Definition and applications, Collision resistant hashing, authenticated encryption: security against active attacks, Digital Signature. Unit 5: Advanced Topics ECC, DNA cryptography, quantum cryptography, Digital Watermarking and Steganography etc. Preparedty Dr.) Satish Kumar CSED, MNNITAlshabadText Book: 1. Introduction to Modern Cryptography by J. Katz and Y.Lindell. 2. Handbook of Applied Cryptography by A. Menezes, P. Van Oorschot, S.Vanstone 3. Cryptography and Network Security: Principles and Practice ~ William Stallings Preparedty Dr.) Satish Kumar CSED, MNNITAlshabadEvaluation Process sl. [Course ‘Mid Semester | Teachers End Semester No. Assessment 1 Theory 25% 25% 50% 2 Practical/Seminar/ - 50% * 50% ** Project/ Internship /Thesis| * This component has to be exclusively from the thesis supervisor. ** This component has to be from the examination board. Teachers’ assessment marks shall be awarded on the basis of attendance, tutorials, events, etc. quizzes, assignments, surprise tests, competition in national levelJoin in Moodle Class ID * Class Name and Code For Students: * Purpose: * Name - Cryptography-M.Tech-CS21104- * Assignment Submissions Odd-2025-26 * PPTs and Materials aa A ibili * Key for Joining the class:Mtech20251S-C eee * Feedback * http://172.31.100.110/Lets Get Started !!!!History and Overview of Cryptography * The Concise Oxford English Dictionary defines cryptography as “the art of writing or solving codes.” * Cryptography: The Science of creating coded messages * Cryptanalysis: The art of breaking coded messages * Clear text/Plaintext: The original Message * Cipher text: The encoded message * Key: Input to the cryptographic algorithm * “Cryptography: Practice of the enciphering and deciphering of messages in secret code in order to render them unintelligible to all but the intended receiverHistory and Overview of Cryptography * But cryptography nowadays encompasses much more than this: it deals with * mechanisms for ensuring integrity, * techniques for exchanging secret keys, * protocols for authenticating users, * electronic auctions and elections, * digital cash, and more. * Modern cryptography involves the study of mathematical techniques for securing digital information, systems, and distributed computations against adversarial attacks.Early Cryptography * 3500 BC: Sumerians: Cuneiform writings Source: InternetEarly Cryptography * 1900 BC: Egypt: First known use of cryptography Source: InternetEarly Cryptography * 500 — 600 BC: ATBASH Cipher * Used by Hebrew scribes — Substitution cipher (reversed alphabet) Source: Internet Preparedty OcEarly Cryptography * 486 BC: Greece * okUTGAN — skytale Source: InternetEarly Cryptography * 60-50 BC: Julius Caesar — substitution cipher — Shift letters by X positions: ° E.g.X=3:A->D,B->E,C-> * Weakness? * Frequency analysis (1000 AD) Source: Internet PreparEarly Cryptography * Mono-alphabetic substitution * letters of the plain text alphabet are mapped on to unique letters throughout the entire message text * cipher can be trivially broken because i. The language of the plain text is easily recognizable. (frequency distribution- unigram statistics- next slide) ii. There are only s= |A| keys (e.g. for Roman alphabet, only 25 keys — 1 to 25) to search exhaustively * Exhaustive key search is always possible Frequency of single characters in English text ABCD FF GMbdibRotNN. GoM RSA UVWX YZMedieval Cryptography Cipher Vigeneére * Polyalphabetic: * 1587 one to many relationship * Example ° ° a ¢ i 2 LToBEORNOTTOB ey: coat fur esr eeu nnrei Medieval Cryptography Iesoge "What fot ese meal be” Vigenére Cipher Keyword: Puck planter: WHATF OOLST HESEM ORTAL SBE key: Pucke ucKkeu cKkPUC KPUCK PUC Example: Message: LECDU IQVHN JOHYO YGNCV HVG Keyword: Puck PuckP UCKPU CKPUC KPUCK PUC ciphertext: L BCDU IT QVHN JOHYO YGNCV HVGModern Cryptography a N Bate ° * 1845: Morse Code — epee - * Representation by code signal po Q * States (on and off) composed E R into 5 symbols Foo = c= T 4 uv tos v i w ko x Lo Y ope, as zModern Cryptography ¢ 1863: Friedrich Kasiski breaks Vigenere: — * By examining repeated strings of characters in the cipher text, which could indicate the length of the secret key. * Find length of keyword * Once the length of the secret key is known, the cipher text is rewritten into a corresponding number of columns, with a column for each letter of the key. * Each column is then made up of plaintext that’s been encrypted by one Caesar cipher. * Use frequency analysis to solve theseModern Cryptography * 1918: ADFGVX Cipher — Used in the German army in WWI Encrypt the plaintext "attack at 1200am" using keywords 147 regiment and privacy aj{t}]t}aj{c}k]{/a}]t}1]/2]0/0|ajim DIFIG DV | DG | DG| DV | FA | FX | DV} DG| AA| XA | VX | VX | DV| DD ain PIRI IIVIA|ClY DlElH 4/5/3/6/1/2/7 ola eyelets jw} XY DIG/A/A|X|A|V 3/5/6 X/|V}X/|D]V}| DDModern Cryptography * 1918: ADFGVX Cipher — Used in the German army in WWI Decrypt the ciphertext "ADDDF DDAXF XAGGF DXXAX FGXFG G" which was encrypted using keywords monkeys and zebras By reading off each row we get the intermediate text "GXFGAX XFDFDA FXDDDX GAAXDF GG". Z/E|B/RIA/S 6/3|2/4]1|5 A|D/F|G|xX G|X|FI|G/A|Xx A|M/O|N/KIE 7 . Ieretoretotal The plaintext is then retrieved as DIYIS|A|BIC| "the way is clear". #1 DDD IX FlolFle[H[t G{ala[x]o] 6[t[Plal[R|t G|G See xfulviwhxlzModern Cryptography * 1918: The Enigma -— Arthur Scherbius * Business: confidential docs * No codebooks * Rotors -> multi substitution * Wireing changes as-youtype * German forces in WWIIModern Cryptography: The Enigma Enigma Encipherment Stages er woeett Wheat Wei Whea Scrambler Plopboors ZPHNMSWCETYTG@EDOBLRFKUVGKIA ABCDEFGHIJKLMNOPQRSTUVWKXYZ Keyoous Lanobows YYOOVOGODO| |PVO@DSVDO YOVOOOOG GOOD DD® QBYYOVYOHOO| |OVGOVODO Baa ‘© 2006. by Louise DadeModern Cryptography * 1949: Shannon:— * Communication Theory of Secret Systems * Proved: One time pad unbreakableModern Cryptography The DES (Data Encryption Standard) algorithm is a symmetric-key block cipher created in the early 1970s by an IBM team and adopted by the National Institute of Standards and Technology (NIST). 1976: Diffie - Hellman Key Exchange Public Key Crypto — + Key exchange problem — Asymmetric key algorithm — E.g: RSA, MIT, 1977 * Pojumasy common publi-key algorthm Is the RSA eryptosystem, named forts Inventors Rivest, Shami, and Elliptic Curve Cryptography (ECC) was discovered in 1985 by Victor Miller (IBM) and Neil Koblitz (University of Washington) as an alternative mechanism for implementing public-key cryptography. MDS - Ronald Rivest, founder of RSA Data Security and professor in MIT, 1991. The Advanced Encryption Standard (AES) was published on November 26, 2001 SHA-512-2001Assignment #0 *Watch Movie “The Imitation Game”