Arnab Chakraborty's cryptography tutorial: page 0 of 11

cwave.eu5.org
Also see: http://www.angelfire.com/dragon/letstry
cwave04 at yahoo dot com

Last updated on Fri May 21 11:50:22 IST 2010.

modular multiplication, modula exponentiation, Jacobi symbol, Solovay-Strassen algorithm, Primality testing, cryptography

This tutorial is a very elementary introduction to computational number theory for cryptography.

Contents: This page.
Laboratory: A cryptography calculator.
Modular multiplication: This page explains how to compute ab (mod m) efficiently when a, b and m are all large integers.
Modular multiplication (contd): Continues the discussion from the last page.
Modular exponentiation: This page discusses efficient computation of a^b (mod m), when a, b and m are all large integers.
Jacobi symbol: This page discusses the Jacobi symbol that is used the Solovay-Strassen primality testing alogrithm..
Solovay-Strassen algo: Discussion of the Solovay-Strassen algo.
Extended Euclid's algo: This page talks about the extended Euclid's algo.