This repository implements the Caesar cipher and the Euclidean algorithm with javascript.
The caesar cipher algorithm can be used to encrypt a plain text into cipher text which can be decrypted back to the original plain text as long as you have or can guess the encrytion key.
The Euclidean algorithm can be used to find the greatest common divisor of two numbers. It comes in two flavors; gcdModVersion() and gcdSubractionVersion().
- Clone repo
$ gh repo clone raymondabiola/Algorithms-caesar-cipher-euclidean
- Run command below to encrypt plain text and decrypt cipher
$ npm start
- Run the command below to get the gcd of two values.
$ npm run gcd
Built with 🤍 by Raymond Abiola
Feel free to follow my Github account or fork this repo for learning and testing.