Activities

WORKSHOP ON
COMPUTATIONAL NUMBER THEORY
AND CRYPTOGRAPHY
April 16-17, 2005

Modern cryptography today is almost entirely based on computational number theory. It promises many research directions which cannot be pursued without building a sound foundation in number theory. 

 

CASM is organizing a workshop to encourage young mathematicians and theoretical computer scientists to study basic topics in Computational Number Theory and Cryptography. All interested are invited to register, preferably before April 9, 2005. Registration is free and participation is by invitation only. For further information, contact: Secretary, Workshop on Computational Number Theory and Cryptography (email: kashifi@lums.edu.pk).

 Resource Persons:

• Arif Zaman, Department of Mathematics, LUMS

• Sarmad Abbasi, Department of Computer Science, NUCES

Topics to be covered:

• Introduction to computational number theory and cryptography.

• Modular arithmetic, computing in Z_n, repeated squaring and the discrete log problem, solving linear equation in Z_n, theorems of Eular and Fermat.

• Basic public key cryptography: RSA, Diffie-Hellman, EIGamal and other cryptosystems, cryptographic protocols and attacks.

• Primality testing: Quadratic reciprocity, pseudo-primes, Euler pseudo-primes, strong pseudo-primes; generating random prime numbers; deterministic primality testing.

• Integer factoring and solving the discrete log problem.

• Galois fields, elliptic curves and elliptic curve cryptography.

Workshop Programme Details	Participants List of Workshop
Workshop Registration Form