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.
saunack / cryptography-using-ecc-and-rsa-over-polynomial-and-prime-fields Goto Github PK
View Code? Open in Web Editor NEWUsed 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.
License: GNU General Public License v3.0