crypt19-rb 1.2.1 → 1.2.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 642bbab526866578e06c0e06654c51fc88be89eb
-  data.tar.gz: 67efa313253fc737a330bda5c6d7ec55623cec2a
+  metadata.gz: 4a9f3b81613ed54c16adf3a776b71a2eea6f0aac
+  data.tar.gz: cb6d1a9558c0e5e92852e226348a59d97b8af978
 SHA512:
-  metadata.gz: 838a590fdf6b85b58d323dfcd703bff6b088993b45245dd337195335e2076d836e634f1e7cd33453e22d50ffcdf78b303ee5dd610aab60c7c448d0d5d9c5974b
-  data.tar.gz: 54063059f98b42d761ff5082c55288008c76300cf35fe0504b135c45c1042ba02832dab46b6c0c67157274399cb05b8e7d3714b5293c6f7e5e5419ae099531a3
+  metadata.gz: 28e0676f55f90ee1f2290ef59b9b624f565340a8970f2f9921feea0168d6e337ab228280f77e84c846d85c5bcfc7fcf262a63dc7bf5fc919017bd33b1f1ed3be
+  data.tar.gz: d822bd479b2a300b53382b48427d6a8105462168a1397c1fd9198deb4663f9912c82989eeffa82c28661096b06daee76c9a95ddc52a3638ef18049f8e5c81c94

data/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    crypt19-rb (1.2.1)
+    crypt19-rb (1.2.2)
 
 GEM
   remote: https://rubygems.org/

data/VERSION

@@ -1 +1 @@
-1.2.1
+1.2.2

data/lib/crypt/blowfish-tables.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 module Crypt
   module BlowfishTables
 

data/lib/crypt/blowfish.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 #  Blowfish algorithm by Bruce Schneider
 #  Ported from the reference C code
 

data/lib/crypt/bytes-compat.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 class String
   if RUBY_VERSION =~ /1\.8/
     def getbyte(index)

data/lib/crypt/cbc.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 require 'stringio'
 require 'crypt/stringxor'
 

data/lib/crypt/gost.rb

@@ -1,138 +1,139 @@
-# adapted from C++ code written by Wei Dai 
-# of the Crypto++ project http://www.eskimo.com/~weidai/cryptlib.html
-
-require 'crypt/cbc'
-
-module Crypt
-  class Gost
-
-    include CBC
-  
-    ULONG   = 0x100000000
-  
-    def block_size
-      return(8)
-    end
-  
-  
-    def initialize(user_key)
-  
-      # These are the S-boxes given in Applied Cryptography 2nd Ed., p. 333
-      @sBox = [
-        [4, 10, 9, 2, 13, 8, 0, 14, 6, 11, 1, 12, 7, 15, 5, 3],
-        [14, 11, 4, 12, 6, 13, 15, 10, 2, 3, 8, 1, 0, 7, 5, 9],
-        [5, 8, 1, 13, 10, 3, 4, 2, 14, 15, 12, 7, 6, 0, 9, 11],
-        [7, 13, 10, 1, 0, 8, 9, 15, 14, 4, 6, 12, 11, 2, 5, 3],
-        [6, 12, 7, 1, 5, 15, 13, 8, 4, 10, 9, 14, 0, 3, 11, 2],
-        [4, 11, 10, 0, 7, 2, 1, 13, 3, 6, 8, 5, 9, 12, 15, 14],
-        [13, 11, 4, 1, 3, 15, 5, 9, 0, 10, 14, 7, 6, 8, 2, 12],
-        [1, 15, 13, 0, 5, 7, 10, 4, 9, 2, 3, 14, 6, 11, 8, 12]
-      ]
-
-      # These are the S-boxes given in the GOST source code listing in Applied
-  	  # Cryptography 2nd Ed., p. 644.  They appear to be from the DES S-boxes
-      # [13,  2,  8,  4,  6, 15, 11,  1, 10,  9,  3, 14,  5,  0, 12,  7 ],
-      # [ 4, 11,  2, 14, 15,  0,  8, 13,  3, 12,  9,  7,  5, 10,  6,  1 ],
-      # [12,  1, 10, 15,  9,  2,  6,  8,  0, 13,  3,  4, 14,  7,  5, 11 ],
-      # [ 2, 12,  4,  1,  7, 10, 11,  6,  8,  5,  3, 15, 13,  0, 14,  9 ],
-      # [ 7, 13, 14,  3,  0,  6,  9, 10,  1,  2,  8,  5, 11, 12,  4, 15 ],
-      # [10,  0,  9, 14,  6,  3, 15,  5,  1, 13, 12,  7, 11,  4,  2,  8 ],
-      # [15,  1,  8, 14,  6, 11,  3,  4,  9,  7,  2, 13, 12,  0,  5, 10 ],
-      # [14,  4, 13,  1,  2, 15, 11,  8,  3, 10,  6, 12,  5,  9,  0,  7 ] 
-    
-      # precalculate the S table
-      @s_table = precalculate_s_table()
-    
-      # derive the 32-byte key from the user-supplied key
-      user_key_length = user_key.length
-      @key = user_key[0..31].unpack('C'*32)
-      if (user_key_length < 32)
-        user_key_length.upto(31) { @key << 0 }
-      end
-    end
-  
-  
-    def precalculate_s_table()
-      s_table = [[], [], [], []]
-      0.upto(3) { |i|
-        0.upto(255) { |j|
-          t = @sBox[2*i][j % 16] | (@sBox[2*i+1][j/16] << 4)
-          u = (8*i + 11) % 32
-          v = (t << u) | (t >> (32-u))
-          s_table[i][j] = (v % ULONG)
-        } 
-      }
-      return(s_table)
-    end
-  
-  
-    def f(long_word)
-      long_word = long_word % ULONG
-      a, b, c, d = [long_word].pack('L').unpack('CCCC')
-      return(@s_table[3][d] ^ @s_table[2][c] ^ @s_table[1][b] ^ @s_table[0][a])
-    end
-  
-  
-    def encrypt_pair(xl, xr)
-      3.times {
-        xr ^= f(xl+@key[0])
-        xl ^= f(xr+@key[1])
-        xr ^= f(xl+@key[2])
-        xl ^= f(xr+@key[3])
-        xr ^= f(xl+@key[4])
-        xl ^= f(xr+@key[5])
-        xr ^= f(xl+@key[6])
-        xl ^= f(xr+@key[7])
-      }
-      xr ^= f(xl+@key[7])
-      xl ^= f(xr+@key[6])
-      xr ^= f(xl+@key[5])
-      xl ^= f(xr+@key[4])
-      xr ^= f(xl+@key[3])
-      xl ^= f(xr+@key[2])
-      xr ^= f(xl+@key[1])
-      xl ^= f(xr+@key[0])
-      return([xr, xl])
-    end
-  
-  
-    def decrypt_pair(xl, xr)
-      xr ^= f(xl+@key[0])
-      xl ^= f(xr+@key[1])
-      xr ^= f(xl+@key[2])
-      xl ^= f(xr+@key[3])
-      xr ^= f(xl+@key[4])
-      xl ^= f(xr+@key[5])
-      xr ^= f(xl+@key[6])
-      xl ^= f(xr+@key[7])
-      3.times {
-        xr ^= f(xl+@key[7])
-        xl ^= f(xr+@key[6])
-        xr ^= f(xl+@key[5])
-        xl ^= f(xr+@key[4])
-        xr ^= f(xl+@key[3])
-        xl ^= f(xr+@key[2])
-        xr ^= f(xl+@key[1])
-        xl ^= f(xr+@key[0])
-      }
-      return([xr, xl])
-    end
-  
-  
-    def encrypt_block(block)
-      xl, xr = block.unpack('NN')
-      xl, xr = encrypt_pair(xl, xr)
-      encrypted = [xl, xr].pack('NN')
-      return(encrypted)
-    end
-  
-  
-    def decrypt_block(block)
-      xl, xr = block.unpack('NN')
-      xl, xr = decrypt_pair(xl, xr)
-      decrypted = [xl, xr].pack('NN')
-      return(decrypted)
-    end
-
-  end
+# coding: ASCII
+# adapted from C++ code written by Wei Dai
+# of the Crypto++ project http://www.eskimo.com/~weidai/cryptlib.html
+
+require 'crypt/cbc'
+
+module Crypt
+  class Gost
+
+    include CBC
+
+    ULONG   = 0x100000000
+
+    def block_size
+      return(8)
+    end
+
+
+    def initialize(user_key)
+
+      # These are the S-boxes given in Applied Cryptography 2nd Ed., p. 333
+      @sBox = [
+        [4, 10, 9, 2, 13, 8, 0, 14, 6, 11, 1, 12, 7, 15, 5, 3],
+        [14, 11, 4, 12, 6, 13, 15, 10, 2, 3, 8, 1, 0, 7, 5, 9],
+        [5, 8, 1, 13, 10, 3, 4, 2, 14, 15, 12, 7, 6, 0, 9, 11],
+        [7, 13, 10, 1, 0, 8, 9, 15, 14, 4, 6, 12, 11, 2, 5, 3],
+        [6, 12, 7, 1, 5, 15, 13, 8, 4, 10, 9, 14, 0, 3, 11, 2],
+        [4, 11, 10, 0, 7, 2, 1, 13, 3, 6, 8, 5, 9, 12, 15, 14],
+        [13, 11, 4, 1, 3, 15, 5, 9, 0, 10, 14, 7, 6, 8, 2, 12],
+        [1, 15, 13, 0, 5, 7, 10, 4, 9, 2, 3, 14, 6, 11, 8, 12]
+      ]
+
+      # These are the S-boxes given in the GOST source code listing in Applied
+  	  # Cryptography 2nd Ed., p. 644.  They appear to be from the DES S-boxes
+      # [13,  2,  8,  4,  6, 15, 11,  1, 10,  9,  3, 14,  5,  0, 12,  7 ],
+      # [ 4, 11,  2, 14, 15,  0,  8, 13,  3, 12,  9,  7,  5, 10,  6,  1 ],
+      # [12,  1, 10, 15,  9,  2,  6,  8,  0, 13,  3,  4, 14,  7,  5, 11 ],
+      # [ 2, 12,  4,  1,  7, 10, 11,  6,  8,  5,  3, 15, 13,  0, 14,  9 ],
+      # [ 7, 13, 14,  3,  0,  6,  9, 10,  1,  2,  8,  5, 11, 12,  4, 15 ],
+      # [10,  0,  9, 14,  6,  3, 15,  5,  1, 13, 12,  7, 11,  4,  2,  8 ],
+      # [15,  1,  8, 14,  6, 11,  3,  4,  9,  7,  2, 13, 12,  0,  5, 10 ],
+      # [14,  4, 13,  1,  2, 15, 11,  8,  3, 10,  6, 12,  5,  9,  0,  7 ]
+
+      # precalculate the S table
+      @s_table = precalculate_s_table()
+
+      # derive the 32-byte key from the user-supplied key
+      user_key_length = user_key.length
+      @key = user_key[0..31].unpack('C'*32)
+      if (user_key_length < 32)
+        user_key_length.upto(31) { @key << 0 }
+      end
+    end
+
+
+    def precalculate_s_table()
+      s_table = [[], [], [], []]
+      0.upto(3) { |i|
+        0.upto(255) { |j|
+          t = @sBox[2*i][j % 16] | (@sBox[2*i+1][j/16] << 4)
+          u = (8*i + 11) % 32
+          v = (t << u) | (t >> (32-u))
+          s_table[i][j] = (v % ULONG)
+        }
+      }
+      return(s_table)
+    end
+
+
+    def f(long_word)
+      long_word = long_word % ULONG
+      a, b, c, d = [long_word].pack('L').unpack('CCCC')
+      return(@s_table[3][d] ^ @s_table[2][c] ^ @s_table[1][b] ^ @s_table[0][a])
+    end
+
+
+    def encrypt_pair(xl, xr)
+      3.times {
+        xr ^= f(xl+@key[0])
+        xl ^= f(xr+@key[1])
+        xr ^= f(xl+@key[2])
+        xl ^= f(xr+@key[3])
+        xr ^= f(xl+@key[4])
+        xl ^= f(xr+@key[5])
+        xr ^= f(xl+@key[6])
+        xl ^= f(xr+@key[7])
+      }
+      xr ^= f(xl+@key[7])
+      xl ^= f(xr+@key[6])
+      xr ^= f(xl+@key[5])
+      xl ^= f(xr+@key[4])
+      xr ^= f(xl+@key[3])
+      xl ^= f(xr+@key[2])
+      xr ^= f(xl+@key[1])
+      xl ^= f(xr+@key[0])
+      return([xr, xl])
+    end
+
+
+    def decrypt_pair(xl, xr)
+      xr ^= f(xl+@key[0])
+      xl ^= f(xr+@key[1])
+      xr ^= f(xl+@key[2])
+      xl ^= f(xr+@key[3])
+      xr ^= f(xl+@key[4])
+      xl ^= f(xr+@key[5])
+      xr ^= f(xl+@key[6])
+      xl ^= f(xr+@key[7])
+      3.times {
+        xr ^= f(xl+@key[7])
+        xl ^= f(xr+@key[6])
+        xr ^= f(xl+@key[5])
+        xl ^= f(xr+@key[4])
+        xr ^= f(xl+@key[3])
+        xl ^= f(xr+@key[2])
+        xr ^= f(xl+@key[1])
+        xl ^= f(xr+@key[0])
+      }
+      return([xr, xl])
+    end
+
+
+    def encrypt_block(block)
+      xl, xr = block.unpack('NN')
+      xl, xr = encrypt_pair(xl, xr)
+      encrypted = [xl, xr].pack('NN')
+      return(encrypted)
+    end
+
+
+    def decrypt_block(block)
+      xl, xr = block.unpack('NN')
+      xl, xr = decrypt_pair(xl, xr)
+      decrypted = [xl, xr].pack('NN')
+      return(decrypted)
+    end
+
+  end
 end

data/lib/crypt/idea.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 # IDEA (International Data Encryption Algorithm) by
 # Xuejia Lai and James Massey (1992).  Refer to license info at the end of this file.
 

data/lib/crypt/noise.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 # add_noise - take a message and intersperse noise to make a new noisy message of given byte-length
 # remove_noise - take a noisy message and extract the message
 

data/lib/crypt/rc6.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 #  RC6 symmetric key block cipher
 #  RC6 is a patented encryption algorithm (U.S. Patent 5,724,428 and U.S. Patent 5,835,600)
 #  Ported by Alexey Lapitsky <lex.public@gmail.com> (2009)

data/lib/crypt/rijndael-tables.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 module Crypt
   module RijndaelTables
 

data/lib/crypt/rijndael.rb

@@ -1,3 +1,4 @@
+# coding: ASCII-8BIT
 # Adapted from the reference C implementation:
 #   rijndael-alg-ref.c   v2.2   March 2002
 #   Reference ANSI C code by Paulo Barreto and Vincent Rijmen

data/lib/crypt/stringxor.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 module Crypt
   module StringXor
 

data/lib/crypt/version.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 module Crypt
-  VERSION = "1.2.1"
+  VERSION = "1.2.2"
 end

data/test/blowfish_test.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 require 'test/unit'
 require 'crypt/blowfish'
 require 'crypt/cbc'

data/test/gost_test.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 require 'test/unit'
 require 'crypt/gost'
 require 'fileutils'
@@ -37,7 +38,7 @@ class TestGost < Test::Unit::TestCase
     decrypted_block = gost.decrypt_block(encrypted_block)
     assert_equal(block, decrypted_block)
   end
-	
+
   def test_string
     length = 25 + rand(12)
     userkey = ""

data/test/idea_test.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 require 'test/unit'
 require 'crypt/idea'
 require 'fileutils'
@@ -36,7 +37,7 @@ class TestIdea < Test::Unit::TestCase
     decrypted_block = idea_de.decrypt_block(encrypted_block)
     assert_equal(block, decrypted_block)
   end
-	
+
   def test_string
     length = 25 + rand(12)
     userkey = ""

data/test/rc6_test.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 require 'test/unit'
 require 'crypt/rc6'
 require 'fileutils'

data/test/rijndael_test.rb

@@ -1,3 +1,4 @@
+# coding: ASCII
 require 'test/unit'
 require 'crypt/rijndael'
 require 'fileutils'
@@ -32,7 +33,7 @@ class TestRijndael < Test::Unit::TestCase
       encrypted_block = rijndael.encrypt_block(block)
     }
   end
-	
+
   def test_string
     rijndael = Crypt::Rijndael.new("Who is this John Galt guy, anyway?")
     string = "This is a string which is not a multiple of 8 characters long"

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: crypt19-rb
 version: !ruby/object:Gem::Version
-  version: 1.2.1
+  version: 1.2.2
 platform: ruby
 authors:
 - Jonathan Rudenberg
@@ -10,7 +10,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-02-26 00:00:00.000000000 Z
+date: 2013-07-30 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rake
@@ -79,7 +79,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.0.0
+rubygems_version: 2.0.3
 signing_key: 
 specification_version: 4
 summary: Crypt is a pure-ruby implementation of a number of popular encryption algorithms.