flatulent 0.0.1 → 0.0.2

data/lib/flatulent/crypt/rijndael-tables.rb

@@ -0,0 +1,117 @@
+# rijndael-tables.rb  Richard Kernahan <kernighan_rich@rubyforge.org>
+
+module Crypt
+module RijndaelTables
+
+LogTable = [
+  0,   0,  25,   1,  50,   2,  26, 198,  75, 199,  27, 104,  51, 238, 223,   3, 
+100,   4, 224,  14,  52, 141, 129, 239,  76, 113,   8, 200, 248, 105,  28, 193, 
+125, 194,  29, 181, 249, 185,  39, 106,  77, 228, 166, 114, 154, 201,   9, 120, 
+101,  47, 138,   5,  33,  15, 225,  36,  18, 240, 130,  69,  53, 147, 218, 142, 
+150, 143, 219, 189,  54, 208, 206, 148,  19,  92, 210, 241,  64,  70, 131,  56, 
+102, 221, 253,  48, 191,   6, 139,  98, 179,  37, 226, 152,  34, 136, 145,  16, 
+126, 110,  72, 195, 163, 182,  30,  66,  58, 107,  40,  84, 250, 133,  61, 186, 
+ 43, 121,  10,  21, 155, 159,  94, 202,  78, 212, 172, 229, 243, 115, 167,  87, 
+175,  88, 168,  80, 244, 234, 214, 116,  79, 174, 233, 213, 231, 230, 173, 232, 
+ 44, 215, 117, 122, 235,  22,  11, 245,  89, 203,  95, 176, 156, 169,  81, 160, 
+127,  12, 246, 111,  23, 196,  73, 236, 216,  67,  31,  45, 164, 118, 123, 183, 
+204, 187,  62,  90, 251,  96, 177, 134,  59,  82, 161, 108, 170,  85,  41, 157, 
+151, 178, 135, 144,  97, 190, 220, 252, 188, 149, 207, 205,  55,  63,  91, 209, 
+ 83,  57, 132,  60,  65, 162, 109,  71,  20,  42, 158,  93,  86, 242, 211, 171, 
+ 68,  17, 146, 217,  35,  32,  46, 137, 180, 124, 184,  38, 119, 153, 227, 165, 
+103,  74, 237, 222, 197,  49, 254,  24,  13,  99, 140, 128, 192, 247, 112,   7
+]
+
+AlogTable = [
+  1,   3,   5,  15,  17,  51,  85, 255,  26,  46, 114, 150, 161, 248,  19,  53, 
+ 95, 225,  56,  72, 216, 115, 149, 164, 247,   2,   6,  10,  30,  34, 102, 170, 
+229,  52,  92, 228,  55,  89, 235,  38, 106, 190, 217, 112, 144, 171, 230,  49, 
+ 83, 245,   4,  12,  20,  60,  68, 204,  79, 209, 104, 184, 211, 110, 178, 205, 
+ 76, 212, 103, 169, 224,  59,  77, 215,  98, 166, 241,   8,  24,  40, 120, 136, 
+131, 158, 185, 208, 107, 189, 220, 127, 129, 152, 179, 206,  73, 219, 118, 154, 
+181, 196,  87, 249,  16,  48,  80, 240,  11,  29,  39, 105, 187, 214,  97, 163, 
+254,  25,  43, 125, 135, 146, 173, 236,  47, 113, 147, 174, 233,  32,  96, 160, 
+251,  22,  58,  78, 210, 109, 183, 194,  93, 231,  50,  86, 250,  21,  63,  65, 
+195,  94, 226,  61,  71, 201,  64, 192,  91, 237,  44, 116, 156, 191, 218, 117, 
+159, 186, 213, 100, 172, 239,  42, 126, 130, 157, 188, 223, 122, 142, 137, 128, 
+155, 182, 193,  88, 232,  35, 101, 175, 234,  37, 111, 177, 200,  67, 197,  84, 
+252,  31,  33,  99, 165, 244,   7,   9,  27,  45, 119, 153, 176, 203,  70, 202, 
+ 69, 207,  74, 222, 121, 139, 134, 145, 168, 227,  62,  66, 198,  81, 243,  14, 
+ 18,  54,  90, 238,  41, 123, 141, 140, 143, 138, 133, 148, 167, 242,  13,  23, 
+ 57,  75, 221, 124, 132, 151, 162, 253,  28,  36, 108, 180, 199,  82, 246,   1
+]
+
+S = [
+ 99, 124, 119, 123, 242, 107, 111, 197,  48,   1, 103,  43, 254, 215, 171, 118, 
+202, 130, 201, 125, 250,  89,  71, 240, 173, 212, 162, 175, 156, 164, 114, 192, 
+183, 253, 147,  38,  54,  63, 247, 204,  52, 165, 229, 241, 113, 216,  49,  21, 
+  4, 199,  35, 195,  24, 150,   5, 154,   7,  18, 128, 226, 235,  39, 178, 117, 
+  9, 131,  44,  26,  27, 110,  90, 160,  82,  59, 214, 179,  41, 227,  47, 132, 
+ 83, 209,   0, 237,  32, 252, 177,  91, 106, 203, 190,  57,  74,  76,  88, 207, 
+208, 239, 170, 251,  67,  77,  51, 133,  69, 249,   2, 127,  80,  60, 159, 168, 
+ 81, 163,  64, 143, 146, 157,  56, 245, 188, 182, 218,  33,  16, 255, 243, 210, 
+205,  12,  19, 236,  95, 151,  68,  23, 196, 167, 126,  61, 100,  93,  25, 115, 
+ 96, 129,  79, 220,  34,  42, 144, 136,  70, 238, 184,  20, 222,  94,  11, 219, 
+224,  50,  58,  10,  73,   6,  36,  92, 194, 211, 172,  98, 145, 149, 228, 121, 
+231, 200,  55, 109, 141, 213,  78, 169, 108,  86, 244, 234, 101, 122, 174,   8, 
+186, 120,  37,  46,  28, 166, 180, 198, 232, 221, 116,  31,  75, 189, 139, 138, 
+112,  62, 181, 102,  72,   3, 246,  14,  97,  53,  87, 185, 134, 193,  29, 158, 
+225, 248, 152,  17, 105, 217, 142, 148, 155,  30, 135, 233, 206,  85,  40, 223, 
+140, 161, 137,  13, 191, 230,  66, 104,  65, 153,  45,  15, 176,  84, 187,  22
+]
+
+Si = [
+ 82,   9, 106, 213,  48,  54, 165,  56, 191,  64, 163, 158, 129, 243, 215, 251, 
+124, 227,  57, 130, 155,  47, 255, 135,  52, 142,  67,  68, 196, 222, 233, 203, 
+ 84, 123, 148,  50, 166, 194,  35,  61, 238,  76, 149,  11,  66, 250, 195,  78, 
+  8,  46, 161, 102,  40, 217,  36, 178, 118,  91, 162,  73, 109, 139, 209,  37, 
+114, 248, 246, 100, 134, 104, 152,  22, 212, 164,  92, 204,  93, 101, 182, 146, 
+108, 112,  72,  80, 253, 237, 185, 218,  94,  21,  70,  87, 167, 141, 157, 132, 
+144, 216, 171,   0, 140, 188, 211,  10, 247, 228,  88,   5, 184, 179,  69,   6, 
+208,  44,  30, 143, 202,  63,  15,   2, 193, 175, 189,   3,   1,  19, 138, 107, 
+ 58, 145,  17,  65,  79, 103, 220, 234, 151, 242, 207, 206, 240, 180, 230, 115, 
+150, 172, 116,  34, 231, 173,  53, 133, 226, 249,  55, 232,  28, 117, 223, 110, 
+ 71, 241,  26, 113,  29,  41, 197, 137, 111, 183,  98,  14, 170,  24, 190,  27, 
+252,  86,  62,  75, 198, 210, 121,  32, 154, 219, 192, 254, 120, 205,  90, 244, 
+ 31, 221, 168,  51, 136,   7, 199,  49, 177,  18,  16,  89,  39, 128, 236,  95, 
+ 96,  81, 127, 169,  25, 181,  74,  13,  45, 229, 122, 159, 147, 201, 156, 239, 
+160, 224,  59,  77, 174,  42, 245, 176, 200, 235, 187,  60, 131,  83, 153,  97, 
+ 23,  43,   4, 126, 186, 119, 214,  38, 225, 105,  20,  99,  85,  33,  12, 125, 
+]
+
+IG = [
+[0x0e, 0x09, 0x0d, 0x0b], 
+[0x0b, 0x0e, 0x09, 0x0d], 
+[0x0d, 0x0b, 0x0e, 0x09], 
+[0x09, 0x0d, 0x0b, 0x0e] 
+]
+
+Rcon = [ 
+  0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 
+  0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 
+  0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 
+  0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 
+  0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91
+]
+
+Shifts = [
+  [
+     [0, 0],
+     [1, 3],
+     [2, 2],
+     [3, 1]
+  ], [  
+     [0, 0],
+     [1, 5],
+     [2, 4],
+     [3, 3]
+  ], [
+     [0, 0],
+     [1, 7],
+     [3, 5],
+     [4, 4]
+  ]
+]
+
+end
+end

data/lib/flatulent/crypt/rijndael.rb

@@ -0,0 +1,269 @@
+# rijndael.rb  Richard Kernahan <kernighan_rich@rubyforge.org>
+
+# Adapted from the reference C implementation:
+#   rijndael-alg-ref.c   v2.2   March 2002
+#   Reference ANSI C code
+#   authors: Paulo Barreto and Vincent Rijmen
+#   This code is placed in the public domain.
+
+module Crypt
+class Rijndael
+
+  require 'crypt/cbc'
+  include Crypt::CBC
+  
+  require 'crypt/rijndael-tables'
+  include Crypt::RijndaelTables
+  
+  
+  def initialize(userKey, keyBits = 256, blockBits = 128)
+    case keyBits
+      when 128 
+        @keyWords = 4
+      when 192 
+        @keyWords = 6
+      when 256
+        @keyWords = 8
+      else raise "The key must be 128, 192, or 256 bits long."
+    end
+    
+    case (keyBits >= blockBits) ? keyBits : blockBits
+      when 128 
+        @rounds = 10
+      when 192 
+        @rounds = 12
+      when 256
+        @rounds = 14
+      else raise "The key and block sizes must be 128, 192, or 256 bits long."
+    end
+   
+    case blockBits
+      when 128 
+        @blockSize = 16
+        @blockWords = 4
+        @shiftIndex = 0
+      when 192 
+        @blockSize = 24
+        @blockWords = 6
+        @shiftIndex = 1
+      when 256 
+        @blockSize = 32
+        @blockWords = 8
+        @shiftIndex = 2
+      else raise "The block size must be 128, 192, or 256 bits long."
+    end
+    
+    uk = userKey.unpack('C'*userKey.length)
+    maxUsefulSizeOfUserKey = (keyBits/8)
+    uk = uk[0..maxUsefulSizeOfUserKey-1]    # truncate
+    padding = 0
+    if (userKey.length < keyBits/8)
+      shortfallInUserKey = (keyBits/8 - userKey.length)
+      shortfallInUserKey.times { uk << padding }
+    end
+    @key = [[], [], [], []]
+    0.upto(uk.length-1) { |pos|
+      @key[pos % 4][pos / 4] = uk[pos]
+    }
+    @roundKeys = generate_key_schedule(@key, keyBits, blockBits)
+  end
+
+  
+  def block_size
+    return(@blockSize) # needed for CBC
+  end
+  
+  
+  def mul(a, b)
+    if ((a ==0) | (b == 0))
+      result = 0 
+    else
+      result = AlogTable[(LogTable[a] + LogTable[b]) % 255]
+    end
+    return(result)
+  end
+  
+  
+  def add_round_key(blockArray, roundKey)
+  0.upto(3) { |i|
+    0.upto(@blockWords) { |j|
+      blockArray[i][j] ^= roundKey[i][j]
+    }
+  }
+  return(blockArray)
+  end
+  
+  
+  def shift_rows(blockArray, direction)
+    tmp = []
+    1.upto(3) { |i|  # row zero remains unchanged
+      0.upto(@blockWords-1) { |j|
+        tmp[j] = blockArray[i][(j + Shifts[@shiftIndex][i][direction]) % @blockWords]
+      }
+      0.upto(@blockWords-1) { |j|
+        blockArray[i][j] = tmp[j]
+      }
+    }
+    return(blockArray)
+  end
+  
+  
+  def substitution(blockArray, sBox)
+    # replace every byte of the input with the byte at that position in the S-box
+    0.upto(3) { |i|
+      0.upto(@blockWords-1) { |j|
+        blockArray[i][j] = sBox[blockArray[i][j]]
+      }
+    }
+    return(blockArray)
+  end
+  
+  
+  def mix_columns(blockArray)
+    mixed = [[], [], [], []]
+    0.upto(@blockWords-1) { |j|
+      0.upto(3) { |i|
+        mixed[i][j] = mul(2,blockArray[i][j]) ^
+          mul(3,blockArray[(i + 1) % 4][j]) ^
+          blockArray[(i + 2) % 4][j] ^
+          blockArray[(i + 3) % 4][j]
+      }
+    }
+    return(mixed)
+  end
+  
+  
+  def inverse_mix_columns(blockArray)
+    unmixed = [[], [], [], []]
+    0.upto(@blockWords-1) { |j|
+      0.upto(3) { |i|
+        unmixed[i][j] = mul(0xe, blockArray[i][j]) ^
+          mul(0xb, blockArray[(i + 1) % 4][j]) ^                
+          mul(0xd, blockArray[(i + 2) % 4][j]) ^
+          mul(0x9, blockArray[(i + 3) % 4][j])
+      }
+    }
+     return(unmixed)
+  end
+  
+  
+  def generate_key_schedule(k, keyBits, blockBits)
+    tk = k[0..3][0..@keyWords-1]  # using slice to get a copy instead of a reference
+    keySched = []
+    (@rounds + 1).times { keySched << [[], [], [], []] }
+    t = 0
+    j = 0
+    while ((j < @keyWords) && (t < (@rounds+1)*@blockWords))
+      0.upto(3) { |i|
+        keySched[t / @blockWords][i][t % @blockWords] = tk[i][j]
+      }
+      j += 1
+      t += 1
+    end
+    # while not enough round key material collected, calculate new values
+    rconIndex = 0
+    while (t < (@rounds+1)*@blockWords) 
+      0.upto(3) { |i|
+        tk[i][0] ^= S[tk[(i + 1) % 4][@keyWords - 1]]
+      }
+      tk[0][0] ^= Rcon[rconIndex]
+      rconIndex = rconIndex.next
+      if (@keyWords != 8)
+        1.upto(@keyWords - 1) { |j|
+          0.upto(3) { |i|
+            tk[i][j] ^= tk[i][j-1];
+          }
+        }
+      else
+        1.upto(@keyWords/2 - 1) { |j|
+          0.upto(3) { |i|
+            tk[i][j] ^= tk[i][j-1]
+          }
+        }
+        0.upto(3) { |i|
+          tk[i][@keyWords/2] ^= S[tk[i][@keyWords/2 - 1]]
+        }
+        (@keyWords/2 + 1).upto(@keyWords - 1) { |j|
+          0.upto(3) { |i| 
+            tk[i][j] ^= tk[i][j-1] 
+          }
+        }
+      end
+      j = 0
+      while ((j < @keyWords) && (t < (@rounds+1) * @blockWords))
+        0.upto(3) { |i|
+          keySched[t / @blockWords][i][t % @blockWords] = tk[i][j]
+        }
+        j += 1
+        t += 1
+      end
+    end
+    return(keySched)
+  end
+  
+  
+  def encrypt_byte_array(blockArray)
+    blockArray = add_round_key(blockArray, @roundKeys[0])
+    1.upto(@rounds - 1) { |round|
+      blockArray = substitution(blockArray, S)
+      blockArray = shift_rows(blockArray, 0)
+      blockArray = mix_columns(blockArray)
+      blockArray = add_round_key(blockArray, @roundKeys[round])
+    }
+    # special round without mix_columns
+    blockArray = substitution(blockArray,S)
+    blockArray = shift_rows(blockArray,0)
+    blockArray = add_round_key(blockArray, @roundKeys[@rounds])
+    return(blockArray)
+  end
+  
+  
+  def encrypt_block(block)
+    raise "block must be #{@blockSize} bytes long" if (block.length() != @blockSize)
+    blockArray = [[], [], [], []]
+    0.upto(@blockSize - 1) { |pos|
+      blockArray[pos % 4][pos / 4] = block[pos]
+    }
+    encryptedBlock = encrypt_byte_array(blockArray)
+    encrypted = ""
+    0.upto(@blockSize - 1) { |pos|
+      encrypted << encryptedBlock[pos % 4][pos / 4]
+    }
+    return(encrypted)
+  end
+  
+  
+  def decrypt_byte_array(blockArray)
+    # first special round without inverse_mix_columns
+    # add_round_key is an involution - applying it a second time returns the original result
+    blockArray = add_round_key(blockArray, @roundKeys[@rounds]) 
+    blockArray = substitution(blockArray,Si)   # using inverse S-box
+    blockArray = shift_rows(blockArray,1)
+    (@rounds-1).downto(1) { |round|
+      blockArray = add_round_key(blockArray, @roundKeys[round])
+      blockArray = inverse_mix_columns(blockArray)
+      blockArray = substitution(blockArray, Si) 
+      blockArray = shift_rows(blockArray, 1)
+    }
+    blockArray = add_round_key(blockArray, @roundKeys[0])
+    return(blockArray)
+  end
+  
+  
+  def decrypt_block(block)
+    raise "block must be #{@blockSize} bytes long" if (block.length() != @blockSize)
+    blockArray = [[], [], [], []]
+    0.upto(@blockSize - 1) { |pos|
+      blockArray[pos % 4][pos / 4] = block[pos]
+    }
+    decryptedBlock = decrypt_byte_array(blockArray)
+    decrypted = ""
+    0.upto(@blockSize - 1) { |pos|
+      decrypted << decryptedBlock[pos % 4][pos / 4]
+    }
+    return(decrypted)
+  end
+  
+  
+end
+end

data/lib/flatulent/crypt/stringxor.rb

@@ -0,0 +1,27 @@
+# stringxor.rb  Richard Kernahan <kernighan_rich@rubyforge.org>
+
+module Crypt
+module StringXor
+  
+  
+  def ^(aString)
+    a = self.unpack('C'*(self.length))
+    b = aString.unpack('C'*(aString.length))
+    if (b.length < a.length)
+      (a.length - b.length).times { b << 0 }
+    end
+    xor = ""
+    0.upto(a.length-1) { |pos|
+      x = a[pos] ^ b[pos]
+      xor << x.chr()
+    }
+    return(xor)
+  end
+  
+  
+end
+end
+
+class String
+  include Crypt::StringXor
+end