Still no participant
Still no reviews
Covers fundamental algorithms for integer arithmetic, greatest common divisor calculation, modular arithmetic, and other number-theoretic computations. Algorithms are derived, implemented, and analyzed for primality testing and integer factorization. Applications to cryptography are explored including symmetric and public-key cryptosystems. A cryptosystem will be implemented and methods of attack investigated. To be able to implement and analyze algorithms for integer factorization and primality testing. To be able to use a system like Maple to explore concepts and theorems from number theory. To understand fundamental algorithms from symmetric-key and public-key cryptography.
NUMBER THEORY: Introduction-Divisibility-Greatest common divisor -Prime numbers - Fundamental theorem of arithmetic - Mersenne primes -Fermat numbers - Euclidean algorithm -
Fermat’s theorem - Euler totient function - Euler’s theorem. Congruences: Definition - Basic properties of congruences - Residue classes - Chinese remainder theorem.
ALGEBRAIC STRUCTURES: Groups - Cyclic groups, Cosets, Modulo groups -Primitive roots - Discrete logarithms. Rings – Sub rings, ideals and quotient rings, Integral domains. Fields - Finite fields – GF(Pn), GF(2n) - Classification -Structure of finite fields. Lattice, Lattice as Algebraic system, sub lattices, some special lattices.
PROBABILITY THEORY: Introduction – Concepts of Probability – Conditional Probability - Baye’s Theorem - Random Variables – discrete and continuous central Limit Theorem-Stochastic Process Markov Chain.
CODING THEORY: Introduction - Basic concepts: codes, minimum distance, equivalence of codes, Linear codes - Linear codes - Generator matrices and parity check matrices - Syndrome decoding – Hamming codes - Hadamard Code –Goppa codes.
PSEUDORANDOM NUMBER GENERATION: Introduction and examples -
Indistinguishability of Probability Distributions - Next Bit Predictors - The Blum
Blum-Shub Generator – Security of the BBS Generator.