Network security

FIT5044 – Network Security Week Addendum

A couple of useful python scripts I made from copying the explanations on wikipedia:

Extended Euclidean algorithm – Used in RSA for determining the public key, once the private is chosen (see wikipage)

Pollard’s rho algorithm – One method for factorizing (see wikipage), try creating a semi prime with 20 digits then one with 60 digits. Time how long it takes for each 😉

Helpful link with some prime numbers for testing


Click on the pic if you don't already have python 2.7


Leave a Reply

Your email address will not be published. Required fields are marked *