ntc-rcrypto 0.0.4 → 0.1.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: d418af6ae2b5279365489c245007dec3863765e7268bab4481074926a0dc5e3f
-  data.tar.gz: c32826acf84e80db1a30611c4196dac565116588ec257da008ee5658501ed6d6
+  metadata.gz: 014b37d0b14bd5a1bc2472553a24f4e9096dae19961305e7a86bca2494ac88e0
+  data.tar.gz: f6b09ae301d179227725b6a98ac22b37fd0a81a188c49a64f4c7d11fdbe16497
 SHA512:
-  metadata.gz: 1e4ec45b5a06df1eb2eef30e5f151a6474a26ac35248cee058c15f2dfd501d7690509c783dc4c6ef369ff66de47f49f2ecac607699e0ca9b97f6bd254c93db39
-  data.tar.gz: 89688e0525dc327f04e2f1006c058f469ccf313c2e94bf1c21065beb90f7b1b2ad49b71fe3b9d37777ca4e0ce4254b5ed9e387d07528115b60271bb20c376c61
+  metadata.gz: b816de8c6bdbf36c91925ff3f33cb9e10456088743242c2c36fb41415d802dc35d33fe0dc479269ff109f6996f339910c4ea85beecd50a71c2ad0412fe2dc8a3
+  data.tar.gz: 83fbb70f907106e4f25e56e360061d410cf75bd0d0b8af0067083888043f82e0825e0988534e8af2e1f1ddf97459fd9ffb07df33fab0a69977feb3e76b6780ea

data/lib/rcrypto/sss.rb

@@ -163,6 +163,7 @@ module Rcrypto
       result
     end
 
+    # Remove right character '0'
     def trim_right(s)
       i = s.length - 1
       while i >= 0 && s[i] == '0'
@@ -315,9 +316,13 @@ module Rcrypto
       # Verify minimum isn't greater than shares; there is no way to recreate
       # the original polynomial in our current setup, therefore it doesn't make
       # sense to generate fewer shares than are needed to reconstruct the secrets.
+      if minimum <= 0 || shares <= 0
+        raise Exception('minimum or shares is invalid')
+      end
       if minimum > shares
         raise Exception('cannot require more shares then existing')
       end
+      raise Exception('secret is NULL or empty') if secret.empty?
 
       # Convert the secrets to its respective 256-bit Int representation.
       secrets = split_secret_to_int(secret)
@@ -340,13 +345,13 @@ module Rcrypto
         j = 1
         while j < minimum
           # Each coefficient should be unique
-          number = random_number()
-          while in_numbers(numbers, number)
-            number = random_number()
+          x = random_number()
+          while in_numbers(numbers, x)
+            x = random_number()
           end
 
-          numbers.append(number)
-          subpoly.push(number)
+          numbers.append(x)
+          subpoly.push(x)
           j += 1
         end
         polynomial.push(subpoly)
@@ -359,23 +364,15 @@ module Rcrypto
       #
       # Note: this array is technically unnecessary due to creating result
       # in the inner loop. Can disappear later if desired.
-      #
-      # points[shares][parts][2]
-      points = []
       for i in 0...shares
         s = ''
-        arrsh = []
         for j in 0...secrets.length
-          arrxy = []
           # generate a new x-coordinate.
-          number = random_number()
-          while in_numbers(numbers, number)
-            number = random_number()
+          x = random_number()
+          while in_numbers(numbers, x)
+            x = random_number()
           end
-          x = number
-          y = evaluate_polynomial(polynomial, j, number)
-          arrxy.push(x)
-          arrxy.push(y)
+          y = evaluate_polynomial(polynomial, j, x)
           if is_base64
             s += to_base64(x)
             s += to_base64(y)
@@ -383,9 +380,7 @@ module Rcrypto
             s += to_hex(x)
             s += to_hex(y)
           end
-          arrsh.push(arrxy)
         end
-        points.push(arrsh)
         result.push(s)
       end
       result

data/lib/rcrypto/version.rb

@@ -1,4 +1,4 @@
 module Rcrypto
-  VERSION = "0.0.4"
+  VERSION = "0.1.0"
 end
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ntc-rcrypto
 version: !ruby/object:Gem::Version
-  version: 0.0.4
+  version: 0.1.0
 platform: ruby
 authors:
 - nghiatc
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2020-05-25 00:00:00.000000000 Z
+date: 2020-05-26 00:00:00.000000000 Z
 dependencies: []
 description: ntc-rcrypto is module ruby cryptography.
 email: