Introduction
Number Theory
Modular Arithmetic
Euclid's Algorithm
Extended Euclid's Algorithm
Fermat's Little Theorem
Classical Ciphers
Shift Cipher
Affine Cipher
Substitution Cipher
Substitution Cryptanalysis
Transposition Cipher
Hill Cipher
Vigenere Cipher
Vigenere Cryptanalysis
Enigma Machine
Simplified DES
Simplified AES
Hashing
Public Key Cryptography
Diffie-Hellman Key Exchange
R.S.A
ElGamal
Cryptography
Computer Science & Statistics at University of Rhode Island
Toggle Sidebar
Description
Enter a Prime (29 < P < 55000)
Enter a Prime (29 < Q < 55000)
Calculate M (P*Q) and N (P-1)*(Q-1)
E (Relatively prime to N)
Calculate D (E*D = 1 mod N)
Text
Encode
Encoded Text
Encoded Plaintext
Encrypt ->
<- Decrypt
Encoded Ciphertext
Encoded Text
Decode
Text