saunack/Cryptography-using-ECC-and-RSA-over-polynomial-and-prime-fields

Used algorithms for prime generation/check (Fermat's test and Miler Rabin's test) to implement discrete logarithm (BSGS), and inverse and exponentiation (Extended Euclid's algorithm). Refer to readme.txt for more details.