ntc-rcrypto 0.0.3 → 0.0.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 243e0fde6cd3e97ded29cd60402d3696ee6105b7e0fdbf11a04e9fae5f4d8649
-  data.tar.gz: f8a443a0e246e9337008698181768a4213b1647b6f042f8e78a0668abc597a5e
+  metadata.gz: d418af6ae2b5279365489c245007dec3863765e7268bab4481074926a0dc5e3f
+  data.tar.gz: c32826acf84e80db1a30611c4196dac565116588ec257da008ee5658501ed6d6
 SHA512:
-  metadata.gz: 6e92ee8bf8b6a58b0e328f419ae243405092bfee3a518dd0370a14ad7cb18bf8ab001199f32b3997c6adb6906938ca0fa815cfa3cbfe8b3344dd8698bea3f354
-  data.tar.gz: efc7129b572d4078556074fd42cc5a339c5c104b71ba1088081644e5a46499b253eabe7f8ff2b5f9a66f0b746f85a68b8bcae5fc8abf16930dfe91101701b4fa
+  metadata.gz: 1e4ec45b5a06df1eb2eef30e5f151a6474a26ac35248cee058c15f2dfd501d7690509c783dc4c6ef369ff66de47f49f2ecac607699e0ca9b97f6bd254c93db39
+  data.tar.gz: 89688e0525dc327f04e2f1006c058f469ccf313c2e94bf1c21065beb90f7b1b2ad49b71fe3b9d37777ca4e0ce4254b5ed9e387d07528115b60271bb20c376c61

data/.gitignore

@@ -18,6 +18,9 @@
 /test/tmp/
 /test/version_tmp/
 /tmp/
+.idea
+.rakeTasks
+Gemfile.lock
 
 # Used by dotenv library to load environment variables.
 # .env

data/README.md

@@ -21,6 +21,34 @@ gem install ntc-rcrypto
 
 ## 1. An implementation of Shamir's Secret Sharing Algorithm 256-bits in Ruby
 ### Usage
+
+**Use encode/decode Base64Url**  
+```ruby
+require 'rcrypto'
+
+sss = Rcrypto::SSS.new
+
+s = "nghiatcxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx"
+puts s
+puts s.length
+# creates a set of shares
+arr = sss.create(3, 6, s, true)
+# puts arr
+
+# combines shares into secret
+s1 = sss.combine(arr[0...3], true)
+puts s1
+puts s1.length
+
+s2 = sss.combine(arr[3...6], true)
+puts s2
+puts s2.length
+
+s3 = sss.combine(arr[1...5], true)
+puts s3
+puts s3.length
+```
+
 **Use encode/decode Hex**  
 ```ruby
 require 'rcrypto'
@@ -31,22 +59,22 @@ s = "nghiatcxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
 puts s
 puts s.length
 # creates a set of shares
-arr = sss.create(3, 6, s)
+arr = sss.create(3, 6, s, false)
 # puts arr
 
 # combines shares into secret
-s1 = sss.combine(arr[0...3])
+s1 = sss.combine(arr[0...3], false)
 puts s1
 puts s1.length
 
-s2 = sss.combine(arr[3...6])
+s2 = sss.combine(arr[3...6], false)
 puts s2
 puts s2.length
 
-s3 = sss.combine(arr[1...5])
+s3 = sss.combine(arr[1...5], false)
 puts s3
 puts s3.length
 ```
 
 ## License
-This code is under the [Apache Licence v2](https://www.apache.org/licenses/LICENSE-2.0).  
+This code is under the [Apache License v2](https://www.apache.org/licenses/LICENSE-2.0).  

data/lib/main.rb

@@ -1,3 +1,5 @@
+# Run Terminal: /bin/bash -c "env RBENV_VERSION=2.7.0 ~/.rbenv/libexec/rbenv exec bundle exec ruby ./lib/main.rb"
+
 require 'rcrypto'
 
 sss = Rcrypto::SSS.new
@@ -18,11 +20,15 @@ sss = Rcrypto::SSS.new
 # number = 67356225285819719212258382314594931188352598651646313425411610888829358649431
 # puts number
 # b64data = sss.to_base64(number)
-# puts b64data.length  # 88
-# puts b64data  # OTRlYTQ1YzMyYzI5MDllNTQwNzBhZDNmMmNlMjg2Zjk4YjU2ZWY1YzcyOGY1NmQ3ZDNhMDljNWJiNTU5MzA1Nw==
+# puts b64data.length
+# puts b64data
+# # 88
+# # OTRlYTQ1YzMyYzI5MDllNTQwNzBhZDNmMmNlMjg2Zjk4YjU2ZWY1YzcyOGY1NmQ3ZDNhMDljNWJiNTU5MzA1Nw==
+# # 44
+# # lOpFwywpCeVAcK0_LOKG-YtW71xyj1bX06CcW7VZMFc=
 # hexdata = sss.to_hex(number)
-# puts hexdata.length  # 64
-# puts hexdata  # 94ea45c32c2909e54070ad3f2ce286f98b56ef5c728f56d7d3a09c5bb5593057
+# puts hexdata.length # 64
+# puts hexdata # 94ea45c32c2909e54070ad3f2ce286f98b56ef5c728f56d7d3a09c5bb5593057
 # numb64decode = sss.from_base64(b64data)
 # puts numb64decode
 # numhexdecode = sss.from_hex(hexdata)
@@ -39,27 +45,27 @@ sss = Rcrypto::SSS.new
 # puts rs
 # puts rs.length  # 109
 
-# Test1
-s = "nghiatcxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx"
-puts s
-puts s.length
-# creates a set of shares
-arr = sss.create(3, 6, s)
-# puts "================== arr"
-# puts arr
-# puts "=================="
-# combines shares into secret
-s1 = sss.combine(arr[0...3])
-puts s1
-puts s1.length
-
-s2 = sss.combine(arr[3...6])
-puts s2
-puts s2.length
-
-s3 = sss.combine(arr[1...5])
-puts s3
-puts s3.length
+# # Test1
+# s = "nghiatcxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx"
+# puts s
+# puts s.length
+# # creates a set of shares
+# arr = sss.create(3, 6, s, false)
+# # puts "================== arr"
+# # puts arr
+# # puts "=================="
+# # combines shares into secret
+# s1 = sss.combine(arr[0...3], false)
+# puts s1
+# puts s1.length
+#
+# s2 = sss.combine(arr[3...6], false)
+# puts s2
+# puts s2.length
+#
+# s3 = sss.combine(arr[1...5], false)
+# puts s3
+# puts s3.length
 
 
 # # Test2
@@ -79,14 +85,67 @@ puts s3.length
 # # puts arr
 # # puts "=================="
 # # combines shares into secret
-# s1 = sss.combine(arr[0...3])
+# s1 = sss.combine(arr[0...3], false)
+# puts s1
+# puts s1.length
+#
+# s2 = sss.combine(arr[3...6], false)
+# puts s2
+# puts s2.length
+#
+# s3 = sss.combine(arr[1...5], false)
+# puts s3
+# puts s3.length
+
+
+# # Test3
+# s = "nghiatcxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx"
+# puts s
+# puts s.length
+# # creates a set of shares
+# arr = sss.create(3, 6, s, true)
+# # puts "================== arr"
+# # puts arr
+# # puts "=================="
+# # combines shares into secret
+# s1 = sss.combine(arr[0...3], true)
+# puts s1
+# puts s1.length
+#
+# s2 = sss.combine(arr[3...6], true)
+# puts s2
+# puts s2.length
+#
+# s3 = sss.combine(arr[1...5], true)
+# puts s3
+# puts s3.length
+
+
+# # Test4
+# s = "nghiatcxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx"
+# puts s
+# puts s.length
+# # creates a set of shares
+# arr = [
+#     "3yHo_uVUBRJJ8AiBL-3SS2OAFoe8A0lYF9PVsylFpfU=hFNCvpl0Vo9pESdgVuQs88bna5lMFgfVsixJEjT38EU=rnqFtyOaWu6ROU7LqegKRBG3hnr75Uwa3xTLRTD_Ahs=HeD7Nh0314-9m6YAaAiLKv5QiPToYd_PpSOveTPf-08=VLnVwLvMoEy19oHz7F1RuQjexvNdBB9Z_0VBFpz3-tw=FVJFrnO0LyhswtULPNUQr3j-rwPVrruAp-SrU-JDQcU=6dUlv2kHgZNYlV0ZiVhtQ_E-Vdt5Qu_74_ur8hLkTaM=oOyKYNhTd98bif9cEOVxPQCJjOh7haA63COMtGVLGDA=",
+#     "coKbKOpKsucIF0hLgL6r2dOJpQ52TXnqU4Y4Znc26aU=Byrn3KrQn8Rq8-F49THePjAxy1fkixnjf7H-Q82tlNY=C-17nZaq6PPDfHCDPIpmVa928rUYAXxkhop-1dhyEqg=kn_fIXrpRCh1WluMW2EQddz9Vlj7m4SlUWnSAupD6yQ=yrT7uX2bF0AEdOUFQx1sd-SAYBj4vY0wLQaXkilp9LQ=65RU1AOhohmmN5dmKChFipsCdCraLIu1I0tlfUCdtdQ=_oHtNTo71hjx5RO_BaDJq2hiZTvpQjN6-O4n6zf8F_M=bd5XjTzbwgZIoXDCeqX_lGbCAIW1kepA-j6xRChI5Co=",
+#     "O7As77L_0wcYIjvuL-Uod9WNAWWsB1W3iFjSVPDfgDE=bfOMBFU6n6dcMTmD7Vp67xwyUMQDLMVv3dkJfU0-GAE=N7rOnWAcjXG_SA0UZyfTi4Rv17ja5_8otHG4nbnYsUE=xhfjU2E_Zc3ldk5S5vUS3nUbHcWP_8Co0ROXF_542T8=3_XtNGxPNC_ZPRydvGdeGomiHRU1alWEFbfYPE4TFPg=hUA48-h2u6gJs4g5wDmvQzbTXQlAagBG3VjBQYGgjDI=AZHs5DhgW27YC5Tw0bW4wkbwpq7l13JNyEpR6m6PM0s=ZLA7GzYugrD-ii2h0f9kx0F8dS0TJQEJgcM1sg4KxHQ=",
+#     "1qi-z1_JzZq1pPaQlajigXK7ZLD49o9uEbAG0i2JPRE=F_-WklezDbbn5TwLzwgTH7y4CrdtgzHkRnoT7yGvlOc=L2ydfKaeEZAdO99MEW5z2_G73Cw17GKSjrFBrtlv91w=AVDKhDGyMJjcslpMKP796I6gMAs7Y3B5Oqqo0abpTSo=Jk2aKW6g1Ol88MXn2mZcRE7o_mjlK4L4rm7Mn-1xW4Y=PTxmdcCnxcI30aqkf1vmC96CmGovnH2G_RvtRaudmoE=vlw4fz5CHvoUteCz1KiQ4VvS_AmZqJUbMC1qIh4TTbU=uNF3vO6B7Q9nA29FFoDg5XnryRJAWPf0Fyn5-qNgorg=",
+#     "BvCmwKngaukEhX9PbO_mbs-kVXJZasFnCTbG1BU4uy8=D5R_MinicWA4MSUYlurfxKeMqHjXcsnB8fe6eGlWl2Q=4EqtWUErsPDEupb-lyrFBcrsDVmutZao3u7NMM0j-eE=atF3vl9wmfzGWsPtaYgmMA3K6VbEctYO0PvxLYEqhPs=yWvAcAYRiz7N08AxR7gS6FUkw5K9Fufb0TUvv6sn0Go=QnYDo7XCF0A_q4zdKLgrzSuwGxdACySdy_YyvbQXKFU=zoJeB5fBh-_JZXZh_e9_lI0VYZfj2sSmn0QU5rbDzjw=RJW7Ip7iy2E5bzLFmA0MRluWRBI_unyVeCIrxSFgnr0=",
+#     "H7L3h0FeMRJhlOjb4P7ujl8TU62V6BR-3hmrgeZSsqY=YIgcyaTE2i9cjWGy2KYwXG-Bihe5tVqwTDvfpGG0bjc=HaQPRVj61WadfsKTNQ_nz8Ysmuw8kbTTdtTUq4pr8ow=mral1sUzGfHO7wqBG5OjpieS8OQVcfWUGMefSmoePwM=hTgwBQUnnz5NpUjq-f5ZmFLeraoWqAUXu3FvpN2InoY=_O78YvsYo8BdIVwlixp889NAACSo1fnHjXwZ06X8LIQ=D_gDXhWQ4efiIxJPn-80PiCE1qRt89bh_IK0ZOZt9Ew=tYgTQLKfnvNrlq8fMyPnKWJ165zEuvu3lOpWnw8_Qiw="
+# ]
+# # puts "================== arr"
+# # puts arr
+# # puts "=================="
+# # combines shares into secret
+# s1 = sss.combine(arr[0...3], true)
 # puts s1
 # puts s1.length
 #
-# s2 = sss.combine(arr[3...6])
+# s2 = sss.combine(arr[3...6], true)
 # puts s2
 # puts s2.length
 #
-# s3 = sss.combine(arr[1...5])
+# s3 = sss.combine(arr[1...5], true)
 # puts s3
 # puts s3.length

data/lib/rcrypto/sss.rb

@@ -48,6 +48,32 @@ module Rcrypto
       s.split.pack('H*')
     end
 
+    # Return Uint8Array binary representation of hex string.
+    def hex_to_u8b(hex)
+      u8 = []
+      hex = '0' + hex if hex.length.odd?
+      len = hex.length / 2
+      i = 0
+      j = 0
+      while i < len
+        u8.append((hex[j...j + 2]).to_i(16))
+        j += 2
+        i += 1
+      end
+      # uint8_t
+      u8b = u8.pack('C*')
+      u8b
+    end
+
+    # Return hex string representation of Uint8Array binary.
+    def u8b_to_hex(u8b)
+      u8 = u8b.unpack('C*')
+      hex = u8.map do |v|
+        v.to_s(16).rjust(2, '0')
+      end.join
+      hex
+    end
+
     # Returns the Int number base10 in base64 representation; note: this is
     # not a string representation; the base64 output is exactly 256 bits long.
     def to_base64(number)
@@ -58,7 +84,8 @@ module Rcrypto
         hexdata = '0' + hexdata
         i += 1
       end
-      b64data = Base64.urlsafe_encode64(hexdata)
+      u8b = hex_to_u8b(hexdata)
+      b64data = Base64.urlsafe_encode64(u8b)
       b64data
     end
 
@@ -66,7 +93,8 @@ module Rcrypto
     # not coming from a string representation; the base64 input is exactly 256
     # bits long, and the output is an arbitrary size base 10 integer.
     def from_base64(number)
-      hexdata = Base64.urlsafe_decode64(number)
+      u8b = Base64.urlsafe_decode64(number)
+      hexdata = u8b_to_hex(u8b)
       rs = hexdata.to_i(16)
       rs
     end
@@ -147,7 +175,7 @@ module Rcrypto
     # Converts an array of Ints to the original byte array, removing any
     # least significant nulls.
     def merge_int_to_string(secrets)
-      hex_data = ""
+      hex_data = ''
       for s in secrets
         tmp = to_hex(s)
         hex_data += tmp
@@ -159,17 +187,129 @@ module Rcrypto
     # in_numbers(numbers, value) returns boolean whether or not value is in array
     def in_numbers(numbers, value)
       for n in numbers
-        if n == value
-          return true
+        return true if n == value
+      end
+      false
+    end
+
+    # Takes a string array of shares encoded in Base64Url created via Shamir's
+    # Algorithm; each string must be of equal length of a multiple of 88 characters
+    # as a single 88 character share is a pair of 256-bit numbers (x, y).
+    def decode_share_base64(shares)
+      # Recreate the original object of x, y points, based upon number of shares
+      # and size of each share (number of parts in the secret).
+      secrets = []
+
+      # For each share...
+      for i in 0...shares.length
+        # ensure that it is valid.
+        unless is_valid_share_base64(shares[i])
+          raise Exception('one of the shares is invalid')
         end
+
+        # find the number of parts it represents.
+        share = shares[i]
+        count = share.length / 88
+        arrsh = []
+        # and for each part, find the x,y pair...
+        for j in 0...count
+          cshare = share[j * 88...(j + 1) * 88]
+          arrxy = []
+          # decoding from Base64.
+          x = from_base64(cshare[0...44])
+          y = from_base64(cshare[44...88])
+          arrxy.push(x)
+          arrxy.push(y)
+          arrsh.push(arrxy)
+        end
+        secrets.push(arrsh)
+      end
+      secrets
+    end
+
+    # Takes in a given string to check if it is a valid secret
+    #
+    # Requirements:
+    #  	Length multiple of 88
+    # 	Can decode each 44 character block as Bas64Url
+    #
+    # Returns only success/failure (bool)
+    def is_valid_share_base64(candidate)
+      return false if candidate.length == 0 || candidate.length % 88 != 0
+
+      count = candidate.length / 44
+      j = 0
+      while j < count
+        part = candidate[j * 44...(j + 1) * 44]
+        decode = from_base64(part)
+        return false if decode <= 0 || decode >= @@prime
+
+        j += 1
       end
-      return false
+      true
+    end
+
+    # Takes a string array of shares encoded in Hex created via Shamir's
+    # Algorithm; each string must be of equal length of a multiple of 128 characters
+    # as a single 128 character share is a pair of 256-bit numbers (x, y).
+    def decode_share_hex(shares)
+      # Recreate the original object of x, y points, based upon number of shares
+      # and size of each share (number of parts in the secret).
+      secrets = []
+
+      # For each share...
+      for i in 0...shares.length
+        # ensure that it is valid.
+        unless is_valid_share_hex(shares[i])
+          raise Exception('one of the shares is invalid')
+        end
+
+        # find the number of parts it represents.
+        share = shares[i]
+        count = share.length / 128
+        arrsh = []
+        # and for each part, find the x,y pair...
+        for j in 0...count
+          cshare = share[j * 128...(j + 1) * 128]
+          arrxy = []
+          # decoding from Hex.
+          x = from_hex(cshare[0...64])
+          y = from_hex(cshare[64...128])
+          arrxy.push(x)
+          arrxy.push(y)
+          arrsh.push(arrxy)
+        end
+        secrets.push(arrsh)
+      end
+      secrets
+    end
+
+    # Takes in a given string to check if it is a valid secret
+    #
+    # Requirements:
+    #  	Length multiple of 128
+    # 	Can decode each 64 character block as Hex
+    #
+    # Returns only success/failure (bool)
+    def is_valid_share_hex(candidate)
+      return false if candidate.length == 0 || candidate.length % 128 != 0
+
+      count = candidate.length / 64
+      j = 0
+      while j < count
+        part = candidate[j * 64...(j + 1) * 64]
+        decode = from_hex(part)
+        return false if decode <= 0 || decode >= @@prime
+
+        j += 1
+      end
+      return true
     end
 
     # Returns a new array of secret shares (encoding x,y pairs as Base64 or Hex strings)
     # created by Shamir's Secret Sharing Algorithm requiring a minimum number of
     # share to recreate, of length shares, from the input secret raw as a string.
-    def create(minimum, shares, secret)
+    def create(minimum, shares, secret, is_base64 = false)
       result = []
 
       # Verify minimum isn't greater than shares; there is no way to recreate
@@ -236,8 +376,13 @@ module Rcrypto
           y = evaluate_polynomial(polynomial, j, number)
           arrxy.push(x)
           arrxy.push(y)
-          s += to_hex(x)
-          s += to_hex(y)
+          if is_base64
+            s += to_base64(x)
+            s += to_base64(y)
+          else
+            s += to_hex(x)
+            s += to_hex(y)
+          end
           arrsh.push(arrxy)
         end
         points.push(arrsh)
@@ -246,79 +391,22 @@ module Rcrypto
       result
     end
 
-    # akes a string array of shares encoded in Hex created via Shamir's
-    # Algorithm; each string must be of equal length of a multiple of 128 characters
-    # as a single 128 character share is a pair of 256-bit numbers (x, y).
-    def decode_share_hex(shares)
-      # Recreate the original object of x, y points, based upon number of shares
-      # and size of each share (number of parts in the secret).
-      secrets = []
-
-      # For each share...
-      for i in 0...shares.length
-        # ensure that it is valid.
-        unless is_valid_share_hex(shares[i])
-          raise Exception('one of the shares is invalid')
-        end
-
-        # find the number of parts it represents.
-        share = shares[i]
-        count = share.length / 128
-        arrsh = []
-        # and for each part, find the x,y pair...
-        for j in 0...count
-          cshare = share[j * 128...(j + 1) * 128]
-          arrxy = []
-          # decoding from Base64.
-          x = from_hex(cshare[0...64])
-          y = from_hex(cshare[64...128])
-          arrxy.push(x)
-          arrxy.push(y)
-          arrsh.push(arrxy)
-        end
-        secrets.push(arrsh)
-      end
-      secrets
-    end
-
-    # Takes in a given string to check if it is a valid secret
-    #
-    # Requirements:
-    #  	Length multiple of 128
-    # 	Can decode each 64 character block as Hex
-    #
-    # Returns only success/failure (bool)
-    def is_valid_share_hex(candidate)
-      if candidate.length == 0 || candidate.length % 128 != 0
-        return false
-      end
-      count = candidate.length / 64
-      j = 0
-      while j < count
-        part = candidate[j * 64...(j + 1) * 64]
-        decode = from_hex(part)
-        if decode <= 0 || decode >= @@prime
-          return false
-        end
-        j += 1
-      end
-      return true
-    end
-
     # Takes a string array of shares encoded in Base64 or Hex created via Shamir's Algorithm
     #     Note: the polynomial will converge if the specified minimum number of shares
     #           or more are passed to this function. Passing thus does not affect it
     #           Passing fewer however, simply means that the returned secret is wrong.
-    def combine(shares)
-      if shares.empty?
-        raise Exception('shares is NULL or empty')
-      end
+    def combine(shares, is_base64 = false)
+      raise Exception('shares is NULL or empty') if shares.empty?
 
       # Recreate the original object of x, y points, based upon number of shares
       # and size of each share (number of parts in the secret).
       #
       # points[shares][parts][2]
-      points = decode_share_hex(shares)
+      points = if is_base64
+                 decode_share_base64(shares)
+               else
+                 decode_share_hex(shares)
+               end
       # puts points
 
       # Use Lagrange Polynomial Interpolation (LPI) to reconstruct the secrets.

data/lib/rcrypto/version.rb

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

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ntc-rcrypto
 version: !ruby/object:Gem::Version
-  version: 0.0.3
+  version: 0.0.4
 platform: ruby
 authors:
 - nghiatc
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2020-03-23 00:00:00.000000000 Z
+date: 2020-05-25 00:00:00.000000000 Z
 dependencies: []
 description: ntc-rcrypto is module ruby cryptography.
 email:
@@ -21,12 +21,9 @@ files:
 - ".travis.yml"
 - CODE_OF_CONDUCT.md
 - Gemfile
-- Gemfile.lock
 - LICENSE
 - README.md
 - Rakefile
-- bin/console
-- bin/setup
 - lib/main.rb
 - lib/rcrypto.rb
 - lib/rcrypto/base_error.rb

data/Gemfile.lock

@@ -1,21 +0,0 @@
-PATH
-  remote: .
-  specs:
-    ntc-rcrypto (0.0.3)
-
-GEM
-  remote: https://rubygems.org/
-  specs:
-    minitest (5.13.0)
-    rake (12.3.3)
-
-PLATFORMS
-  ruby
-
-DEPENDENCIES
-  minitest (~> 5.10)
-  ntc-rcrypto!
-  rake (~> 12.1)
-
-BUNDLED WITH
-   2.1.4

data/bin/console

@@ -1,14 +0,0 @@
-#!/usr/bin/env ruby
-
-require "bundler/setup"
-require "rcrypto"
-
-# You can add fixtures and/or initialization code here to make experimenting
-# with your gem easier. You can also use a different console, if you like.
-
-# (If you use this, don't forget to add pry to your Gemfile!)
-# require "pry"
-# Pry.start
-
-require "irb"
-IRB.start(__FILE__)

data/bin/setup

@@ -1,8 +0,0 @@
-#!/usr/bin/env bash
-set -euo pipefail
-IFS=$'\n\t'
-set -vx
-
-bundle install
-
-# Do any other automated setup that you need to do here