Pinned Repositories
Module-Calculator-App
This Calculator helps you out in calculating the result of a [(x)^y] mod p type of function. It can be used to solve Cryptography Diffie-Hellman excercises. By the way do you prefer M&M's or Snickers? Comment and Share with your friends.
RSA
This program solves RSA Cryptography excercises. Just give q, p and e as inputs and you' ll get as output d.
albo415's Repositories
albo415/Module-Calculator-App
This Calculator helps you out in calculating the result of a [(x)^y] mod p type of function. It can be used to solve Cryptography Diffie-Hellman excercises. By the way do you prefer M&M's or Snickers? Comment and Share with your friends.
albo415/RSA
This program solves RSA Cryptography excercises. Just give q, p and e as inputs and you' ll get as output d.