ntc-rcrypto 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 97cbd390dc90ba8f2b7dbe0c0b9c62b2c98be41eb8dfa95bcb0755f537a06727
+  data.tar.gz: 860aa0358088f78f5b872629f13dd2e764d5c4c3b38f7b20a50b316a95594cac
+SHA512:
+  metadata.gz: e7af25f256f43b6fcc6e3d0cccdd5e6bfaf19bf5a99a2b01056257595b2a239df08e9258133eacb3ae475248189e46742cdbeff608c0cfdc9a984dcefbc8d28e
+  data.tar.gz: 7d4e992779c28b52a66075daba8f2e7426c34df9205b41e38ab1b1ea7d374d47165c7f21a36134468fa48a3f2082b3c59a36f66500d0e129e520560cb1e41d65

data/.gitignore

@@ -0,0 +1,65 @@
+/.bundle/
+/.yardoc
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+
+*.gem
+*.rbc
+/.config
+/coverage/
+/InstalledFiles
+/pkg/
+/spec/reports/
+/spec/examples.txt
+/test/tmp/
+/test/version_tmp/
+/tmp/
+
+# Used by dotenv library to load environment variables.
+# .env
+
+# Ignore Byebug command history file.
+.byebug_history
+
+## Specific to RubyMotion:
+.dat*
+.repl_history
+build/
+*.bridgesupport
+build-iPhoneOS/
+build-iPhoneSimulator/
+
+## Specific to RubyMotion (use of CocoaPods):
+#
+# We recommend against adding the Pods directory to your .gitignore. However
+# you should judge for yourself, the pros and cons are mentioned at:
+# https://guides.cocoapods.org/using/using-cocoapods.html#should-i-check-the-pods-directory-into-source-control
+#
+# vendor/Pods/
+
+## Documentation cache and generated files:
+/.yardoc/
+/_yardoc/
+/doc/
+/rdoc/
+
+## Environment normalization:
+/.bundle/
+/vendor/bundle
+/lib/bundler/man/
+
+# for a library or gem, you might want to ignore these files since the code is
+# intended to run in multiple environments; otherwise, check them in:
+# Gemfile.lock
+# .ruby-version
+# .ruby-gemset
+
+# unless supporting rvm < 1.11.0 or doing something fancy, ignore this:
+.rvmrc
+
+# Used by RuboCop. Remote config files pulled in from inherit_from directive.
+# .rubocop-https?--*

data/.travis.yml

@@ -0,0 +1,6 @@
+---
+language: ruby
+cache: bundler
+rvm:
+  - 2.7.0
+before_install: gem install bundler -v 2.1.4

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,74 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+In the interest of fostering an open and welcoming environment, we as
+contributors and maintainers pledge to making participation in our project and
+our community a harassment-free experience for everyone, regardless of age, body
+size, disability, ethnicity, gender identity and expression, level of experience,
+nationality, personal appearance, race, religion, or sexual identity and
+orientation.
+
+## Our Standards
+
+Examples of behavior that contributes to creating a positive environment
+include:
+
+* Using welcoming and inclusive language
+* Being respectful of differing viewpoints and experiences
+* Gracefully accepting constructive criticism
+* Focusing on what is best for the community
+* Showing empathy towards other community members
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery and unwelcome sexual attention or
+advances
+* Trolling, insulting/derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or electronic
+  address, without explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Our Responsibilities
+
+Project maintainers are responsible for clarifying the standards of acceptable
+behavior and are expected to take appropriate and fair corrective action in
+response to any instances of unacceptable behavior.
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+## Scope
+
+This Code of Conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community. Examples of
+representing a project or community include using an official project e-mail
+address, posting via an official social media account, or acting as an appointed
+representative at an online or offline event. Representation of a project may be
+further defined and clarified by project maintainers.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting the project team at congnghia0609@gmail.com. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. The project team is
+obligated to maintain confidentiality with regard to the reporter of an incident.
+Further details of specific enforcement policies may be posted separately.
+
+Project maintainers who do not follow or enforce the Code of Conduct in good
+faith may face temporary or permanent repercussions as determined by other
+members of the project's leadership.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
+available at [https://contributor-covenant.org/version/1/4][version]
+
+[homepage]: https://contributor-covenant.org
+[version]: https://contributor-covenant.org/version/1/4/

data/Gemfile

@@ -0,0 +1,7 @@
+source "https://rubygems.org"
+
+# Specify your gem's dependencies in rcrypto.gemspec
+gemspec
+
+gem "rake", "~> 12.1"
+gem "minitest", "~> 5.10"

data/Gemfile.lock

@@ -0,0 +1,21 @@
+PATH
+  remote: .
+  specs:
+    ntc-rcrypto (0.0.1)
+
+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/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2020 nghiatc
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

data/README.md

@@ -0,0 +1,51 @@
+# ntc-rcrypto
+ntc-rcrypto is module ruby cryptography.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'ntc-rcrypto'
+```
+
+And then execute:
+```ruby
+bundle install
+```
+
+Or install it yourself as:
+```ruby
+gem install ntc-rcrypto
+```
+
+## Usage
+**Use encode/decode Hex**  
+```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)
+# puts arr
+
+# 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
+```
+
+## License
+This code is under the [Apache Licence v2](https://www.apache.org/licenses/LICENSE-2.0).  

data/Rakefile

@@ -0,0 +1,10 @@
+require "bundler/gem_tasks"
+require "rake/testtask"
+
+Rake::TestTask.new(:test) do |t|
+  t.libs << "test"
+  t.libs << "lib"
+  t.test_files = FileList["test/**/*_test.rb"]
+end
+
+task :default => :test

data/bin/console

@@ -0,0 +1,14 @@
+#!/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

@@ -0,0 +1,8 @@
+#!/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

data/lib/main.rb

@@ -0,0 +1,91 @@
+require './rcrypto'
+
+sss = Rcrypto::SSS.new
+
+# # Dev1: random_number
+# for i in 0...10
+#   puts sss.random_number
+# end
+
+# # Dev2: extended gcd
+# puts sss.modinv(67356225285819719212258382314594931188352598651646313425411610888829358649431, 115792089237316195423570985008687907853269984665640564039457584007913129639747)
+# #=> 66304286696287781344919781629879750902445808730247479812988635671630372079315
+
+# # Dev3: hexlify
+# puts sss.hexlify('nghiatc')
+
+# # Dev4: encode & decode
+# number = 67356225285819719212258382314594931188352598651646313425411610888829358649431
+# puts number
+# b64data = sss.to_base64(number)
+# puts b64data.length
+# puts b64data
+# hexdata = sss.to_hex(number)
+# puts hexdata.length
+# puts hexdata
+# numb64decode = sss.from_base64(b64data)
+# puts numb64decode
+# numhexdecode = sss.from_hex(hexdata)
+# puts numhexdecode
+
+# # Dev5: split & merge
+# s = "nghiatcxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx"
+# puts s
+# puts s.length
+# arr = sss.split_secret_to_int(s)
+# puts(arr)
+# puts(sss.in_numbers(arr, 49937119214509114343548691117920141602615245118674498473442528546336026425464))
+# rs = sss.merge_int_to_string(arr)
+# puts(rs)
+# puts(rs.length)
+
+# 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
+
+# # Test2
+# s = "nghiatcxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx"
+# puts s
+# puts s.length
+# # creates a set of shares
+# arr = [
+#     "cac78fd8a2491872833bf9049cb91f706ae7c6619c8dcd11d2b93db1a42610c8d16221744779f7d1df1152d128f1c4e665fcc7d5f9c5da8c5a3954795d14e7fa882ede5e95cc86c133369f0069086a84e7dfa36a8004f6365eebc798ac467f988c5063932ea32066270dc4c18da124f7593ef71491c9e6d7b838f33524449f47c64902a4bd32d020691044daa01dbbfdc7b3a5e8fb20d546e3eac08986e50449ef4340426e494113245e49f672151e86b9da58e122673665a807cc1c04dbe7bc0151a94de40f618b470d73f90b93ede1b7d1611b6f6cb020d9ec12cd7d7bfd471f108d6caa60e3e4c933c78863ed9b8672a37270909ceca95f16e6d3f3dde55f",
+#     "173a962eac9997a9cbd24fa9f664c7a4e90134985344d80332d52b099fa7dfb16ada3209a95af9732b197b1b9bd9067b5f8a0053635a4bc538d60d626576fb1d2ceb4145d68125447c7716a72db869abbe56d649f53e47316bcf9ce165008a93c03ca42840f92ff5c35433375ddf3bbcbf2a8cdffdd475c9c20733b278121adec6d35a0bc80bee9311f814bea1d9783981e042f210d459e8818df76f8b541a72825274df2d5ac29e0074396e7922849d663acdd84919e113dad867a8257d571d3f8e3644dfe790f6f0192fcad5c8735ee4658de1ae03285d721d92119aafc77ffcd9bc7e80da7b47c12ae8cfc730f397cd8533889d4fc96e7f0d4d5fc49d3db9",
+#     "d64848bb07b603d7f882017750c260b4c9fc067dbe97bc49903e7e9a80314dd5d77398b0adcc2e6dbba02e166f93cc15f5b0cdf982abe0879ba1f530d70c9aae0e2fd6764b88616a92c5a3e1b470c19ae94b34284343a106482c15a19381a164bdd3952c55576ad95687100c59dc857b78dfc436ce7f8525420ae273ca58619df6f952772b2e0a785a10c24b77791208bcb6d0ab8c874e7b3f53e522b50855d01566b9f20d4a69136afd25f6cbf127c34650552bf1e1b2885b83fc8fe42bbbc5c3be42dec0b98b4d72a6ff118ca4c49a3055b4bdf7b1e251f7ee61d94fc04bd6d7562dd210d806911ba055ff1f5100808cf350922d4d527058112ac36ea098a2",
+#     "18ad9f41e1a4076fa139da699624686a32b9388cd8931c0f9278ae705ef6693c072d1d4885034672127061f2ce28e3af65c0bcd45024420adaa9df15f6ecee61cf586adcdc7a18981d85ca0ffbd58ad4b82ab15dabf0729aa7d99ce0b4013f3b7318d191cd1450fbea27488e0c4043ba2dfcfc484bdab19cb72b389bcc947c38a1d8cabe59f8f6ce7e878a4c250996835806a354fb4a177510f6a5f2a603686f3e3e9b6c82a8073ad96f49ea5ca470ef6e560a55e74699221df3953ce8747ea461ec0d9d7435eb9526a9a73e5181873c8a05b6711314902af4cf0a9bc69336e818684510273d27752ff0b2b2977f46573033a95b77fe99e004f726633070d1b8",
+#     "188fd844683b4f1f3b65f03ae4624166a7f7378129c946ed9bbcb5cc23c6b77e5325340b89656394711c25c5500bcc789105ee4bbc9f1c8a3a90d261d8c29feda7647cdf1f88c918a4a4afe5af0e8820c779b3b98540571a2f8603996a0dfb8c1bce6440a7f07288fedc9fa66f86548b8ca521efd3df208fe8a3118b929ebed88db91d5a85d54974742764b7a3709699aad5c3933b9b769bc02f8d27f25ea2df5d73c4607dad720b57e07454f58327e6bf55a833fa5f012a6b7012ef5d0cd4ab7ca9871107ac2a17235d925dd7fd767aa0115d4c5c7b73fe165718895401cf58ec830f95dd4af709064a1c5737b9378775f95c41d078aca3701d50296df1a0af",
+#     "5d486655b69532b179d825639fe8648cfe468719211f52d35fc9facd8c8572b33e6206aeb819dd96b22f6ade3533f502e1015ca765a236e7ddedf8b5a95bb7f4fa5b1fce132f7ca624a4d4f2adf14e7c31487a35a4685552e2ab149510c4c11a8c6bb5fa21b058b7de597abbe9ddbb178f293ddd07ee15304618b4855696e180e1afae690e15b623941bf719289ea5e72fa597aeb77b133ce409c5cca4e2a5125f1d7e8f085eb5341ba5eab68f80e7382d52a3145dd3c357ddcf2f883e4acf3324a5ab08ad2fb76d22500581d2aa496938ef650f52af5fbb7aae4779f436101a950953cf77433cb6fafa8c0346c716d456e988b4e05861a239bf643860a7340a",
+# ]
+# # 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

data/lib/rcrypto.rb

@@ -0,0 +1,9 @@
+require "./rcrypto/version"
+require 'awesome_print' if ENV['USE_AWESOME_PRINT'] == 'true'
+
+module Rcrypto
+  require './rcrypto/sss'
+  require './rcrypto/base_error'
+  extend self
+end
+

data/lib/rcrypto/base_error.rb

@@ -0,0 +1,16 @@
+module Rcrypto
+  class BaseError < StandardError
+    def initialize(error, cause = nil)
+      @error = error
+      @cause = cause
+    end
+
+    def to_s
+      if !!@cause
+        JSON[error: @error, cause: @cause] rescue {error: @error, cause: @cause}.to_s
+      else
+        JSON[@error] rescue @error
+      end
+    end
+  end
+end

data/lib/rcrypto/sss.rb

@@ -0,0 +1,364 @@
+require 'base64'
+
+module Rcrypto
+  class SSS
+    # The largest PRIME 256-bit big.Int
+    # https://primes.utm.edu/lists/2small/200bit.html
+    # PRIME = 2^n - k = 2^256 - 189
+    @@prime = 115792089237316195423570985008687907853269984665640564039457584007913129639747
+
+    # Returns a random number from the range (0, PRIME-1) inclusive
+    def random_number
+      rand(1...@@prime)
+    end
+
+    # extended gcd
+    def egcd(a, b)
+      if a == 0
+        return b, 0, 1
+      else
+        g, y, x = egcd(b % a, a)
+        return g, x - (b / a) * y, y
+      end
+    end
+
+    # Computes the multiplicative inverse of the number on the field PRIME.
+    def modinv(a, m)
+      g, x, y = egcd(a, m)
+      if g != 1
+        raise Exception('modular inverse does not exist')
+      else
+        return x % m
+      end
+    end
+
+    # Convert string to hex.
+    def hexlify(s)
+      a = []
+      if s.respond_to? :each_byte
+        s.each_byte { |b| a << sprintf('%02X', b) }
+      else
+        s.each { |b| a << sprintf('%02X', b) }
+      end
+      a.join.downcase
+    end
+
+    # Convert hex to string.
+    def unhexlify(s)
+      s.split.pack('H*')
+    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)
+      hexdata = number.to_s(16)
+      n = 64 - hexdata.length
+      i = 0
+      while i < n
+        hexdata = '0' + hexdata
+        i += 1
+      end
+      b64data = Base64.urlsafe_encode64(hexdata)
+      b64data
+    end
+
+    # Returns the number base64 in base 10 Int representation; note: this is
+    # 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)
+      rs = hexdata.to_i(16)
+      rs
+    end
+
+    # Returns the Int number base10 in Hex representation; note: this is
+    # not a string representation; the Hex output is exactly 256 bits long.
+    def to_hex(number)
+      hexdata = number.to_s(16)
+      # puts hexdata
+      n = 64 - hexdata.length
+      i = 0
+      while i < n
+        hexdata = '0' + hexdata
+        i += 1
+      end
+      hexdata
+    end
+
+    # Returns the number Hex in base 10 Int representation; note: this is
+    # not coming from a string representation; the Hex input is exactly 256
+    # bits long, and the output is an arbitrary size base 10 integer.
+    def from_hex(number)
+      rs = number.to_i(16)
+      rs
+    end
+
+    # Evaluates a polynomial with coefficients specified in reverse order:
+    #  evaluatePolynomial([a, b, c, d], x):
+    #  		return a + bx + cx^2 + dx^3
+    #  Horner's method: ((dx + c)x + b)x + a
+    def evaluate_polynomial(polynomial, part, value)
+      last = polynomial[part].length - 1
+      result = polynomial[part][last]
+      s = last - 1
+      while s >= 0
+        result = (result * value + polynomial[part][s]) % @@prime
+        s -= 1
+      end
+      result
+    end
+
+    # Converts a byte array into an a 256-bit Int, array based upon size of
+    # the input byte; all values are right-padded to length 256, even if the most
+    # significant bit is zero.
+    def split_secret_to_int(secret)
+      result = []
+      hex_data = hexlify(secret)
+      count = (hex_data.length / 64.0).ceil
+      i = 0
+      while i < count
+        if (i + 1) * 64 < hex_data.length
+          subs = hex_data[i * 64...(i + 1) * 64]
+          result.append(subs.to_i(16))
+        else
+          last = hex_data[i * 64...hex_data.length]
+          n = 64 - last.length
+          j = 0
+          while j < n
+            last += '0'
+            j += 1
+          end
+          result.append(last.to_i(16))
+        end
+        i += 1
+      end
+      result
+    end
+
+    def trim_right(s)
+      i = s.length - 1
+      while i >= 0 && s[i] == '0'
+        i -= 1
+      end
+      rs = s[0..i]
+      rs
+    end
+
+    # Converts an array of Ints to the original byte array, removing any
+    # least significant nulls.
+    def merge_int_to_string(secrets)
+      hex_data = ""
+      for s in secrets
+        tmp = to_hex(s)
+        hex_data += tmp
+      end
+      hex_data = unhexlify(trim_right(hex_data))
+      hex_data
+    end
+
+    # 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
+        end
+      end
+      return false
+    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)
+      result = []
+
+      # 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 > shares
+        raise Exception('cannot require more shares then existing')
+      end
+
+      # Convert the secrets to its respective 256-bit Int representation.
+      secrets = split_secret_to_int(secret)
+
+      # List of currently used numbers in the polynomial
+      numbers = [0]
+
+      # Create the polynomial of degree (minimum - 1); that is, the highest
+      # order term is (minimum-1), though as there is a constant term with
+      # order 0, there are (minimum) number of coefficients.
+      #
+      # However, the polynomial object is a 2d array, because we are constructing
+      # a different polynomial for each part of the secrets.
+      #
+      # polynomial[parts][minimum]
+      polynomial = []
+      for i in 0...secrets.length
+        subpoly = []
+        subpoly.push(secrets[i])
+        j = 1
+        while j < minimum
+          # Each coefficient should be unique
+          number = random_number()
+          while in_numbers(numbers, number)
+            number = random_number()
+          end
+
+          numbers.append(number)
+          subpoly.push(number)
+          j += 1
+        end
+        polynomial.push(subpoly)
+      end
+
+      # Create the points object; this holds the (x, y) points of each share.
+      # Again, because secrets is an array, each share could have multiple parts
+      # over which we are computing Shamir's Algorithm. The last dimension is
+      # always two, as it is storing an x, y pair of points.
+      #
+      # 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()
+          end
+          x = number
+          y = evaluate_polynomial(polynomial, j, number)
+          arrxy.push(x)
+          arrxy.push(y)
+          s += to_hex(x)
+          s += to_hex(y)
+          arrsh.push(arrxy)
+        end
+        points.push(arrsh)
+        result.push(s)
+      end
+      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
+
+      # 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)
+      # puts points
+
+      # Use Lagrange Polynomial Interpolation (LPI) to reconstruct the secrets.
+      # For each part of the secrets (clearest to iterate over)...
+      secrets = []
+      for j in 0...(points[0]).length
+        secrets.append(0)
+        # and every share...
+        for i in 0...shares.length  # LPI sum loop
+          # remember the current x and y values.
+          ax = points[i][j][0]  # ax
+          ay = points[i][j][1]  # ay
+          numerator = 1  # LPI numerator
+          denominator = 1  # LPI denominator
+          # and for every other point...
+          for k in 0...shares.length  # LPI product loop
+            if k != i
+              # combine them via half products.
+              # x=0 ==> [(0-bx)/(ax-bx)] * ...
+              bx = points[k][j][0]  # bx
+              negbx = -bx  # (0 - bx)
+              axbx = ax - bx  # (ax - bx)
+
+              numerator = (numerator * negbx) % @@prime  # (0 - bx) * ...
+              denominator = (denominator * axbx) % @@prime  # (ax - bx) * ...
+            end
+          end
+          # LPI product: x=0, y = ay * [(x-bx)/(ax-bx)] * ...
+          # multiply together the points (ay)(numerator)(denominator)^-1 ...
+          fx = ay
+          fx = (fx * numerator) % @@prime
+          fx = (fx * modinv(denominator, @@prime)) % @@prime
+
+          # LPI sum: s = fx + fx + ...
+          secrets[j] = (secrets[j] + fx) % @@prime
+        end
+      end
+      rs = merge_int_to_string(secrets)
+      rs
+    end
+
+  end
+end

data/lib/rcrypto/version.rb

@@ -0,0 +1,4 @@
+module Rcrypto
+  VERSION = "0.0.1"
+end
+

data/rcrypto.gemspec

@@ -0,0 +1,33 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'rcrypto/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "ntc-rcrypto"
+  spec.version       = Rcrypto::VERSION
+  spec.authors       = ["nghiatc"]
+  spec.email         = ["congnghia0609@gmail.com"]
+
+  spec.summary       = %q{ntc-rcrypto ruby cryptography.}
+  spec.description   = %q{ntc-rcrypto is module ruby cryptography.}
+  spec.homepage      = "https://github.com/congnghia0609/ntc-rcrypto"
+  spec.license       = 'Apache-2.0'
+  spec.required_ruby_version = Gem::Requirement.new(">= 2.3.0")
+
+  # spec.metadata["allowed_push_host"] = "TODO: Set to 'http://mygemserver.com'"
+
+  spec.metadata["homepage_uri"] = spec.homepage
+  spec.metadata["source_code_uri"] = "https://github.com/congnghia0609/ntc-rcrypto"
+  spec.metadata["changelog_uri"] = "https://github.com/congnghia0609/ntc-rcrypto"
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  # spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
+  #   `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  # end
+  spec.files = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+end

metadata

@@ -0,0 +1,62 @@
+--- !ruby/object:Gem::Specification
+name: ntc-rcrypto
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- nghiatc
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2020-03-17 00:00:00.000000000 Z
+dependencies: []
+description: ntc-rcrypto is module ruby cryptography.
+email:
+- congnghia0609@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".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
+- lib/rcrypto/sss.rb
+- lib/rcrypto/version.rb
+- rcrypto.gemspec
+homepage: https://github.com/congnghia0609/ntc-rcrypto
+licenses:
+- Apache-2.0
+metadata:
+  homepage_uri: https://github.com/congnghia0609/ntc-rcrypto
+  source_code_uri: https://github.com/congnghia0609/ntc-rcrypto
+  changelog_uri: https://github.com/congnghia0609/ntc-rcrypto
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.3.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.1.2
+signing_key: 
+specification_version: 4
+summary: ntc-rcrypto ruby cryptography.
+test_files: []