BC4012 Cryptanalysis Syllabus:
BC4012 Cryptanalysis Syllabus – Anna University PG Syllabus Regulation 2021
COURSE OBJECTIVES:
To understand the importance of cryptanalysis in our increasingly computer-driven world.
To understand the fundamentals of Cryptography
To understand the Lattice- based cryptanalysis and elliptic curves and pairings
To understand birthday- based algorithms for functions and attacks on stream ciphers
To apply the techniques for secure transactions in real world applications
UNIT I INTRODUCTION
Preliminaries, Defining Security in Cryptography, Monoalphabetic Ciphers: Using Direct Standard Alphabets, The Caesar Cipher, Modular arithmetic, Direct Standard alphabets, Solution of direct standard alphabets by completing the plain component, Solving direct standard alphabets by frequency considerations, Alphabets based on decimations of the normal sequence, Solution of decimated standard alphabets, Mono alphabets based on linear transformation. Polyalphabetic Substitution: Polyalphabetic ciphers, Recognition of polyalphabetic ciphers, Determination of number of alphabets, Solution of individual alphabets if standard, Polyalphabetic ciphers with a mixed plain sequence, Matching alphabets, Reduction of a polyalphabetic cipher to a monoalphabetic ciphers with mixed cipher sequences
UNIT II TRANSPOSITION
Columnar transposition, Solution of transpositions with Completely filled rectangles, Incompletely filled rectangles, Solution of incompletely filled rectangles – Probable word method, Incompletely filled rectangles general case, Repetitions between messages; identical length messages. Sieve algorithms: Introductory example: Eratosthenes’s sieve, Sieving for smooth composites
UNIT III BRUTE FORCE CRYPTANALYSIS
Introductory example: Dictionary attacks, Brute force and the DES, Algorithm, Brute force as a security mechanism, Brute force steps in advanced cryptanalysis, Brute force and parallel computers. The birthday paradox: Sorting or not?: Introductory example: Birthday attacks on modes of operation, Analysis of birthday paradox bounds, Finding collisions, Application to discrete logarithms in generic groups.
UNIT IV ALGORITHMS FOR FUNCTIONS
Birthday- based algorithms for functions: algorithmic aspects, analysis of random functions, number-theoretic applications, a direct cryptographic application in the context of block wise security, collisions in hash functions. attacks on stream ciphers: LFSR-based key stream generators, correlation attacks, noisy LFSR model, algebraic attacks, extension to some non- linear shift registers, the cube attack.
UNIT V LATTICE BASED CRYPTANALYSIS
Direct attacks using lattice reduction, Coppersmith’s small roots attacks. Elliptic curves and pairings: Introduction to elliptic curves, The Weil pairing, the elliptic curve factoring method.
COURSE OUTCOMES:
After the completion of this course, student will be able to
CO1: Apply cryptanalysis in system design to protect it from various attacks.
CO2: Identify and investigate vulnerabilities and security threats and the mechanisms to counter them.
CO3: Analyze security of cryptographic algorithm against brute force attacks, birthday attacks.
CO4: Design cryptographic algorithms for functions and carry out their implementation.
CO5: Understand the importance lattice based cryptanalysis
TOTAL: 45 PERIODS
REFERENCES
1. Elementary Cryptanalysis A Mathematical Approach by Abraham Sinkov, The mathematical Association of America (lnc).
2. Algorithmic Cryptanalysis, by Antoine joux, 1st Edition, CRC Press, 2009.
3. Algebraic Cryptanalysis, Bard Gregory, Springer, 2009
4. Cryptanalysis of Number Theoretic Ciphers, Sameul S. Wag staff, Chapman & Hall/CRC, 2002.
5. Cryptanalysis: A Study of Cipher and Their Solution, Helen F. Gaines,1989