How to implement a rot13 cipher in JavaScript

In this tutorial, you'll learn how to implement a rot13 cipher in JavaScript. Get my free 32 page eBook of JavaScript HowTos ? https://bit.ly/2ThXPL3

Follow me on Twitter: https://www.twitter.com/codebubb
Facebook: https://www.facebook.com/juniordevelopercentral/
Blog: https://www.juniordevelopercentral.com/

So what is rot13? It's a simple substitution cipher which takes some plain text and moves it 13 positions along the English alphabet.

For example, abcd === nopq.

The great thing about rot13 is that the encoding and decoding process or algorithm is exactly the same. So once you've written your rot13 JavaScript function it works for both encoding and decoding.

In the video, i'll discuss a couple of ways to implement a rot13 cipher in JavaScript.

The first is probably the more 'traditional' way of doing things whereby two alphabets are stored in variables, one being the 'input' and the second the 'output'.

You'll see with this approach that it's simply a matter of looping through a string and finding each character in the 'input' alphabet and noting its position and then adding the character in the same position to from the 'output' alphabet to the final output.

The other method we'll look at is using JavaScript array methods to loop through the string as an array and pick out the individual character codes (as numbers) from the String and shift them by 13 places either up or down the alphabet, depending on whether the character is in the first or second half of the alphabet.

So you're going to be learning how to encode rot13 JavaScript text and also how to decode rot13 JavaScript text.

Enjoy this Junior Developer Central JavaScript HowTo!

#JavaScript #JavaScriptHowtos #rot13 Channel Handle @codebubb