sssa-ruby 0.0.1 → 0.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 3aecd0e42e5047d1532c46b18f66ec58a524bc18
-  data.tar.gz: 27e881caf6974a1fa15cd8193d17adf544a71195
+  metadata.gz: fd3e16a5c803de5268c6a029a45f74fe14624866
+  data.tar.gz: 14373c800240d29842118335d6191f025dfd3d18
 SHA512:
-  metadata.gz: 1af87f8d90b8f3424c7076398a04aeed005ccacfc96b8de5baef55de43ae34bb5b9bde7aee275a01745a884b7d88e1d982ec072f96213efe5826a6d96966139f
-  data.tar.gz: 487e533db0993f2ec11e29bd5cefe07703cc7e2394ac52ccd65617d872430f283613cd06ec80f52acd7c70878f3d5fd616a13bdb1c7d2a3cb8ad45e5cf6fd123
+  metadata.gz: 6b6b44262ac3afb47f64323dc4ab005d68b09df76a78cc86997582250b5c02d1f9a739627a0df8119f1131a45b14799665777bf00cb3c015d178f2edeb8ad118
+  data.tar.gz: 40b8a027c381ac44e9c10f3cf98c88be79c469103dc2f748dfd4c2bc593e286f22f6730c8da7e7b4583d2b5c8bc70a27452ccb2a53fb071e141d99d92f3cf4c6

data/lib/sssa.rb

@@ -1,9 +1,13 @@
 require_relative './utils.rb'
 
 module SSSA
-    @prime = 99995644905598542077721161034987774965417302630805822064337798850767846245779
-    @util = SSSA::Utils.new
+    @prime = 115792089237316195423570985008687907853269984665640564039457584007913129639747
+    @util = SSSA::Utils.new(@prime)
 
+    # Create a new array of Shamir's Shares with a minimum, total, and secret
+    # Note: output is an array of base64 strings, of length a multiple of 88,
+    # as each x, y point is a 256 bit (i.e., 44 base64 character) integer and
+    # each share is one pair, per number of integers secret must be split into
     def self.create(minimum, shares, raw)
         secret = @util.split_ints(raw)
         numbers = [0]
@@ -39,6 +43,9 @@ module SSSA
         return result
     end
 
+    # Takes a set of shares and combines them to a secret value using Shamir's
+    # Secret Sharing Algorithm. Each share must be a string of base-64 encoded
+    # shares of length modulo 88 base64 characters (512 bits in binary)
     def self.combine(shares)
         secrets = []
 

data/lib/utils.rb

@@ -5,46 +5,47 @@ module SSSA
     class Utils
         attr_accessor :prime
 
-        def initialize()
-            # 256-bit prime
-            @prime = 99995644905598542077721161034987774965417302630805822064337798850767846245779
+        def initialize(prime=115792089237316195423570985008687907853269984665640564039457584007913129639747)
+            @prime = prime
         end
 
+        # Returns a random number on 0 to @prime-1, inclusive.
         def random()
             return SecureRandom.random_number(@prime)
         end
 
+        # split_ints and merge_ints converts between string and integer array,
+        # where the integer is right-padded until it fits a 256 bit integer.
         def split_ints(secret)
             result = []
 
-            secret.scan(/.{1,32}/) do |part|
-                segment = part.split('').map do |x|
-                    if x.ord > 15
-                        x.ord.to_s(16)
-                    else
-                        "0" + x.ord.to_s(16)
-                    end
-                end
-                result.push (segment+["00"]*(32-segment.size)).join.hex
-            end
+            secret.split('').map { |x|
+                data = x.unpack("H*")[0]
+                "0"*(data.size % 2) + data
+            }.join("").scan(/.{1,64}/) { |segment|
+                result.push (segment+"0"*(64-segment.size)).hex
+            }
 
             return result
         end
 
         def merge_ints(secrets)
-            result = ""
+            result = []
 
-            secrets.each_with_index do |secret, index|
-                if index == secrets.size-1
-                    result += ("0"*(64-secret.to_s(16).size) + secret.to_s(16)).scan(/../).map{|x| x.hex.chr}.join.gsub(/\x00*$/, '')
-                else
-                    result += ("0"*(64-secret.to_s(16).size) + secret.to_s(16)).scan(/../).map{|x| x.hex.chr}.join
-                end
-            end
+            secrets.each { |int|
+                data = int.to_s(16)
+                ("0"*(64-data.size) + data).scan(/../) { |segment|
+                    result.push segment.hex
+                }
+            }
 
-            return result
+            return result.pack('C*').force_encoding("utf-8").gsub(/\u0000*$/, '')
         end
 
+        # This evaluates a polynomial with reversed coefficients at a given
+        # value. Namely, given the array [a, b, c, d], and x=value, the equation
+        # is:
+        # a + bx + cx^2 + dx^3
         def evaluate_polynomial(coefficients, value)
             result = 0
             coefficients.each_with_index do |coefficient, exponent|
@@ -59,6 +60,11 @@ module SSSA
             return result
         end
 
+        # The to_base64 and from_base64 converts between base 10 and base 64
+        # integers, with a left-zero-padded, fixed-size hex representation.
+        # This is cross-compatible with the go implementation, and by changing
+        # base versus encoding as a string, it reduces the size of the
+        # representation. Note: the output is always 44 characters.
         def to_base64(number)
             return Base64.urlsafe_encode64(("0"*(64-number.to_s(16).size) + number.to_s(16)).scan(/../).map{|x| x.hex.chr}.join)
         end
@@ -74,6 +80,11 @@ module SSSA
             return (segment+["00"]*(32-segment.size)).join.hex
         end
 
+        # Uses extended Euclidian algorithm to compute the GCD of a pair of
+        # numbers, and returns [gcd, x, y], such that gcd = ax+ by.
+        #
+        # Note: computing the GCD over a finite field with a = @prime means that
+        # GCD will always return 1.
         def gcd(a, b)
             if b == 0
                 return [a, 1, 0]
@@ -85,6 +96,9 @@ module SSSA
             end
         end
 
+        # Computes the multiplicitive inverse of the given number on the finite
+        # field. Note: number should never be less than zero; however, if it is,
+        # the inverse is inverted
         def mod_inverse(number)
             remainder = gcd(@prime, number % @prime)[2]
             if (number < 0)

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: sssa-ruby
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors:
 - Alexander Scheel
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-10-18 00:00:00.000000000 Z
+date: 2015-11-07 00:00:00.000000000 Z
 dependencies: []
 description: Helper cryptography module for Ruby
 email: alexander.m.scheel@gmail.com
@@ -28,17 +28,17 @@ require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.0.14
+rubygems_version: 2.4.5
 signing_key: 
 specification_version: 4
 summary: Shamir's Secret Sharing Algorithm