Lab 4­

Venue : Makmal Sistem, Building FTMK.
Date : 13-8-2009
Time : 10.00 a.m. – 11.50 a.m.

The title for the lab session this week was “Modern Cryptography”. According to the contents, there are two types of cryptography will be learnt by us and they are RSA algorithm and DES algorithm. For this week, we have learnt about RSA Algorithm. RSA algorithm is one of the algorithms that used to find private and public key. There are several steps need to be gone through according to the lab manual. The most important step for this algorithm is to find modulo numbers with the formulae d = e-1 mod n. Owing to the power of -1for the e value, it could not be solved using the ordinary method. Mr. Zaki taught us the method to calculate it. However, there is still one thing I am not very understand, that is I could not get the same answer for modulo numbers by using calculator. After Mr. Zaki has explained a bit about that, I understood a bit, but I think I still need some time to digest it… …