Merge remote-tracking branch 'upstream/gh-pages'

Author: duaraghav8@gmail

algorithm/category.json

@@ -11,6 +11,12 @@
       "bridges": "Find-Bridges"
     }
   },
+  "cryptography": {
+    "name": "Cryptography",
+    "list": {
+      "caesar_cipher": "Caesar Cipher"
+    }
+  },
   "mst": {
     "name": "Minimum Spanning Tree",
     "list": {

algorithm/cryptography/caesar_cipher/basic/code.js

@@ -0,0 +1,60 @@
+function getPosUp(pos) {
+  return (pos === alphabet.length - 1) ? 0 : pos + 1;
+}
+
+function getPosDown(pos) {
+  return (pos === 0) ? alphabet.length - 1 : pos - 1;
+}
+
+function getNextChar(currChar, direction) {
+  var pos = alphabetMap[currChar];
+  var nextPos = direction === 'up' ? getPosUp(pos) : getPosDown(pos);
+  var nextChar = alphabet.charAt(nextPos);
+  
+  logger._print(currChar + ' -> ' + nextChar);
+  return nextChar;
+}
+
+function cipher(str, rotation, direction, cipherTracer) {
+  if (!str) return '';
+
+  for (var i = 0; i < str.length; i++) {
+
+    cipherTracer._wait();
+    
+    var currChar = str.charAt(i);
+    var r = rotation;
+
+    logger._print('Rotating ' + currChar + ' ' + direction + ' ' + rotation + ' times');
+    cipherTracer._notify(i)._wait();
+
+    // perform given amount of rotations in the given direction
+    while (--r > 0) {
+      currChar = getNextChar(currChar, direction);
+      cipherTracer._notify(i, currChar)._wait();
+    }
+    
+    str = str.substring(0, i) + currChar + str.substring(i + 1);
+    logger._print('Current result: ' + str);
+  }
+
+  cipherTracer._select(0, i);
+  return str;
+}
+
+function encrypt(str, rotation) {
+  logger._print('Encrypting: ' + str);
+  return cipher(str, rotation, 'down', encryptTracer);
+}
+
+function decrypt(str, rotation) {
+  logger._print('Decrypting: ' + str);
+  return cipher(str, rotation, 'up', decryptTracer);
+}
+
+var encrypted = encrypt(string, rotation);
+logger._print('Encrypted result: ' + encrypted);
+
+decryptTracer._setData(encrypted);
+var decrypted = decrypt(encrypted, rotation);
+logger._print('Decrypted result: ' + decrypted);

algorithm/cryptography/caesar_cipher/basic/data.js

@@ -0,0 +1,16 @@
+var string = 'secret';
+var rotation = 5;
+var alphabet = 'abcdefghijklmnopqrstuvwxyz';
+// create a map of char -> position to improve run time
+// otherwise we would have to search the alphabet each 
+// time to find the character position
+var alphabetMap = alphabet.split('').reduce(function(map, curr, idx) {
+  map[curr] = idx;
+  return map;
+}, {});
+
+var logger = new LogTracer();
+var encryptTracer = new Array1DTracer('Encryption');
+var decryptTracer = new Array1DTracer('Decryption');
+
+encryptTracer._setData(string);

algorithm/cryptography/caesar_cipher/desc.json

@@ -0,0 +1,16 @@
+{
+  "Caesar Cipher": "In cryptography, a Caesar cipher, also known as Caesar's cipher, the shift cipher, Caesar's code or Caesar shift, is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a left shift of 3, D would be replaced by A, E would become B, and so on. The method is named after Julius Caesar, who used it in his private correspondence.",
+  "Applications": [
+    "Often incorporated as part of more complex schemes, such as the Vigenère cipher"
+  ],
+  "Complexity": {
+    "time": "best O(N * #ofRotations), worst O(N * #ofRotations * alphabetSize)",
+    "space": "best O(1), worst O(alphabetSize)"
+  },
+  "References": [
+    "<a href='https://en.wikipedia.org/wiki/Caesar_cipher'>Wikipedia</a>"
+  ],
+  "files": {
+    "basic": "Encrypting and Decrypting a string using character rotation"
+  }
+}