secret_sharing 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 7d1f9dc3ed57b5e31acda563d2a75bb39f17cda8
+  data.tar.gz: 38914666ac426bcdd7765ab4d04b9cd4209e48aa
+SHA512:
+  metadata.gz: 05149dab9a3f6afceb1d52a72f15742bd4d5de9a06580d7abb8389d40b96a5de5af908c207e11cd5dc3c66f8c525fcf7c240a3882a1cf2a183327dd87e21b946
+  data.tar.gz: 1c6b21a99d780e527b9de6858a9f8bd9a3d3480904d8bc108b99d05dae446583157569be5d15f1da9c507600feb5748b92736aa1064bb2429a25409386003ac8

data/.gitignore

@@ -0,0 +1,22 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log
+:w

data/.rspec

@@ -0,0 +1,2 @@
+--color
+--require spec_helper

data/.rubocop.yml

@@ -0,0 +1,8 @@
+Style/AsciiComments:
+  Enabled: false # not to comment in another language than english but to be
+                 # able to write tests for non ascii characters
+
+Documentation:
+  Enabled: false # this is handled by yard and it is annoying since rubocop does
+                 # not notice if a top level class documentation has already
+                 # been created (https://github.com/bbatsov/rubocop/issues/691)

data/.travis.yml

@@ -0,0 +1,5 @@
+language: ruby
+rvm:
+  - 2.1.3
+bundler_args: --without development
+cache: bundler

data/.yardops

@@ -0,0 +1 @@
+lib/**/*.rb --no-private --markup markdown - README.md LICENSE

data/Gemfile

@@ -0,0 +1,10 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in secret_sharing.gemspec
+gem 'bundler', '~> 1.6'
+gem 'rake',  group: [:development, :test]
+gem 'rspec', group: [:development, :test]
+gem 'yard',  group: :development
+gem 'rubocop',   require: false, group: :development
+gem 'simplecov', require: false, group: [:development, :test]
+gem 'coveralls', require: false, group: [:development, :test]

data/Gemfile.lock

@@ -0,0 +1,68 @@
+GEM
+  remote: https://rubygems.org/
+  specs:
+    ast (2.0.0)
+    astrolabe (1.3.0)
+      parser (>= 2.2.0.pre.3, < 3.0)
+    coveralls (0.7.1)
+      multi_json (~> 1.3)
+      rest-client
+      simplecov (>= 0.7)
+      term-ansicolor
+      thor
+    diff-lcs (1.2.5)
+    docile (1.1.5)
+    mime-types (2.4.2)
+    multi_json (1.10.1)
+    netrc (0.8.0)
+    parser (2.2.0.pre.5)
+      ast (>= 1.1, < 3.0)
+      slop (~> 3.4, >= 3.4.5)
+    powerpack (0.0.9)
+    rainbow (2.0.0)
+    rake (10.3.2)
+    rest-client (1.7.2)
+      mime-types (>= 1.16, < 3.0)
+      netrc (~> 0.7)
+    rspec (3.1.0)
+      rspec-core (~> 3.1.0)
+      rspec-expectations (~> 3.1.0)
+      rspec-mocks (~> 3.1.0)
+    rspec-core (3.1.7)
+      rspec-support (~> 3.1.0)
+    rspec-expectations (3.1.2)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.1.0)
+    rspec-mocks (3.1.3)
+      rspec-support (~> 3.1.0)
+    rspec-support (3.1.2)
+    rubocop (0.26.1)
+      astrolabe (~> 1.3)
+      parser (>= 2.2.0.pre.4, < 3.0)
+      powerpack (~> 0.0.6)
+      rainbow (>= 1.99.1, < 3.0)
+      ruby-progressbar (~> 1.4)
+    ruby-progressbar (1.6.0)
+    simplecov (0.9.1)
+      docile (~> 1.1.0)
+      multi_json (~> 1.0)
+      simplecov-html (~> 0.8.0)
+    simplecov-html (0.8.0)
+    slop (3.6.0)
+    term-ansicolor (1.3.0)
+      tins (~> 1.0)
+    thor (0.19.1)
+    tins (1.3.3)
+    yard (0.8.7.4)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler (~> 1.6)
+  coveralls
+  rake
+  rspec
+  rubocop
+  simplecov
+  yard

data/LICENSE

@@ -0,0 +1,22 @@
+Copyright (c) 2014 flower-pot
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,55 @@
+[![Build Status](https://travis-ci.org/duse-io/secret_sharing_ruby.svg?branch=master)](https://travis-ci.org/duse-io/secret_sharing_ruby)
+[![Coverage Status](https://img.shields.io/coveralls/duse-io/secret_sharing_ruby.svg)](https://coveralls.io/r/duse-io/secret_sharing_ruby)
+[![Code Climate](https://codeclimate.com/github/duse-io/secret_sharing_ruby/badges/gpa.svg)](https://codeclimate.com/github/duse-io/secret_sharing_ruby)
+
+# SecretSharing
+
+> **Warning:** This implementation has not been tested in production nor has it
+> been examined by a security audit. All uses are your own responsibility.
+
+A ruby implementation of shamir's secret sharing.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'secret_sharing'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install secret_sharing
+
+## Usage
+
+	require 'secret_sharing'
+	shares = SecretSharing.split_secret('secret', 2, 3) # => [...]
+	length = shares.length # => 3
+	secret = SecretSharing.recover_secret(shares[0..1]) # => 'my secret'
+
+This implementation can also handle non-ascii characters, however, the charset
+will be visible in the calculated shares. Thus splitting ascii only strings is
+"more" secure. (but always remember, shamir's secret sharing alone is not
+secure)
+
+## Compatible libraries
+
+Since this implementation is special in some ways most [Shamir’s Secret
+Sharing](http://de.wikipedia.org/wiki/Shamir%E2%80%99s_Secret_Sharing)
+libraries are not compatible. The only library that is compatible as of now is
+[duse-io/secret-sharing-dart](https://github.com/duse-io/secret-sharing-dart).
+
+We do have [integration
+tests](https://github.com/duse-io/lib-integration-tests) that make sure the
+libraries work with each other.
+
+## Contributing
+
+1. Fork it ( https://github.com/duse-io/secret_sharing/fork )
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create a new Pull Request

data/Rakefile

@@ -0,0 +1,8 @@
+require 'bundler/gem_tasks'
+begin
+  require 'rspec/core/rake_task'
+  RSpec::Core::RakeTask.new(:spec)
+  task default: :spec
+rescue LoadError
+  puts 'rspec tasks could not be loaded'
+end

data/lib/secret_sharing.rb

@@ -0,0 +1,55 @@
+require 'secret_sharing/version'
+require 'secret_sharing/point'
+require 'secret_sharing/polynomial'
+require 'secret_sharing/prime'
+require 'secret_sharing/charset'
+require 'secret_sharing/share'
+
+# A ruby implementation of Shamir's Secret Sharing. This module is the only
+# connection to be consumed by a user. Do not use any other class/module of
+# this library unless you really know what you are doing.
+module SecretSharing
+  # Split a secret using Shamir's Secret Sharing algorithm.
+  #
+  # Example
+  #
+  #   SecretSharing.split_secret('secret', 2, 3)
+  #   # => ["tcesr-1-4e16", "tcesr-2-1105", "tcesr-3-1d3f3"]
+  #
+  # @param secret_string [String] Secret to split.
+  # @param share_threshold [Integer] Number of shares to recover the secret.
+  # @param num_shares [Integer] Total number of shares to generate.
+  #
+  # @return [Array] Array of shares that can be used to recover the secret.
+  def split_secret(secret_string, share_threshold, num_shares)
+    charset = Charset.by_string secret_string
+    secret_int = charset.s_to_i(secret_string)
+    points = Polynomial.points_from_secret(secret_int,
+                                           share_threshold,
+                                           num_shares)
+    points.map do |point|
+      Share.new(charset, point).to_s
+    end
+  end
+
+  # Recover a secret with an array of string shares generated with
+  # {#split_secret}.
+  #
+  # Example
+  #
+  #   SecretSharing.recover_secret(["tcesr-1-4e16", "tcesr-2-1105"])
+  #   # => "secret"
+  #
+  # @param raw_shares [Array] Shares (array of strings) to recover the secret
+  #
+  # @return [String] Recovered secret in a string representation.
+  def recover_secret(raw_shares)
+    shares = raw_shares.map { |raw_share| Share.from_string raw_share }
+    points = shares.map(&:point)
+    secret_int = Polynomial.modular_lagrange_interpolation(points)
+    shares.first.charset.i_to_s(secret_int)
+  end
+
+  module_function :split_secret,
+                  :recover_secret
+end

data/lib/secret_sharing/charset.rb

@@ -0,0 +1,226 @@
+require 'set'
+
+module SecretSharing
+  # This module is used to create or retrieve a charset to use.
+  module Charset
+    # Decides which charset fits the provided string best and creates a custom
+    # charset if no predefined charset fits the usecase.
+    #
+    # Example
+    #
+    #   SecretSharing::Charset.by_string 'test'
+    #   # => #<SecretSharing::ASCIICharset @charset=[...]>
+    #
+    # Or with a custom charset
+    #
+    #   SecretSharing::Charset.by_string 'testä'
+    #   # => #<SecretSharing::DynamicCharset @charset=["s", "e", "ä", "t"]>
+    #
+    # @param string [String] The string to evaluate the charset for.
+    # @return A charset that has at least the methods #s_to_i and #i_to_s.
+    def by_string(string)
+      return ASCIICharset.new if ASCIICharset.new.subset?(string)
+      DynamicCharset.from_string string
+    end
+
+    # Retrieves a charset based on its string representation.
+    #
+    # Example
+    #
+    #   SecretSharing::Charset.by_charset_string ''
+    #   # => #<SecretSharing::ASCIICharset @charset=[...]>
+    #
+    # Or in case of a custom charset
+    #
+    #   SecretSharing::Charset.by_charset_string 'tesä'
+    #   # => #<SecretSharing::DynamicCharset @charset=["t", "e", "s", "ä"]>
+    #
+    # @param charset_string [String] The string to evaluate the charset for.
+    # @return A charset that has at least the methods #s_to_i and #i_to_s.
+    def by_charset_string(charset_string)
+      return ASCIICharset.new if charset_string.empty?
+      DynamicCharset.new(charset_string.chars)
+    end
+
+    module_function :by_string,
+                    :by_charset_string
+  end
+
+  module Charset
+    # This objects of this class can represent a custom charset whenever the
+    # predefined charsets do not fit a situation.
+    class DynamicCharset
+      # A new instance of DynamicCharset. The constructor should only be used
+      # when you know what you are doing. Usually you only want to use this
+      # constructor when you recreate a charset and the order of the charset is
+      # important. The "null-byte" character is prepended to be the first
+      # character in the charset to avoid loosing the first character of the
+      # charset when it is also the first character in a string to convert.
+      #
+      # Example
+      #
+      #   SecretSharing::Charset::DynamicCharset.new ['a', 'b', 'c']
+      #   # => #<SecretSharing::Charset::DynamicCharset @charset=[...]>
+      #
+      # @param charset [Array] array of characters to use for the charset.
+      def initialize(charset)
+        @charset = charset.unshift("\u0000")
+      end
+
+      # Create a charset based on a string to encode.
+      #
+      # Example
+      #
+      #   SecretSharing::Charset::DynamicCharset.from_string 'test'
+      #   # => #<SecretSharing::Charset::DynamicCharset @charset=['e','t','s']>
+      #
+      # @param string [String] a string to encode with the charset to generate
+      # @return [DynamicCharset] shuffled charset to encode strings to ints
+      def self.from_string(string)
+        DynamicCharset.new string.chars.shuffle.uniq
+      end
+
+      # Calculate a string from an integer.
+      #
+      # Example
+      #
+      #   charset = SecretSharing::Charset.by_charset_string 'abc'
+      #   charset.i_to_s 6
+      #   # => "ab"
+      #
+      # @param x [Integer] integer to convert to string
+      # @return [String] converted string
+      def i_to_s(x)
+        unless x.is_a?(Integer) && x >= 0
+          fail ArgumentError, 'x must be a non-negative integer'
+        end
+
+        output = ''
+        while x > 0
+          x, codepoint = x.divmod(length)
+          output.prepend(codepoint_to_char(codepoint))
+        end
+        output
+      end
+
+      # Calculate an integer from a string.
+      #
+      # Example
+      #
+      #   charset = SecretSharing::Charset.by_charset_string 'abc'
+      #   charset.s_to_i "ab"
+      #   # => 6
+      #
+      # @param string [Integer] integer to convert to string
+      # @return [String] converted string
+      def s_to_i(string)
+        string.chars.reduce(0) do |output, char|
+          output * length + char_to_codepoint(char)
+        end
+      end
+
+      # Convert an integer into its string representation according to the
+      # charset. (only one character)
+      #
+      # Example
+      #
+      #   charset = SecretSharing::Charset.by_charset_string 'abc'
+      #   charset.codepoint_to_char 1
+      #   # => "a"
+      #
+      # @param codepoint [Integer] Codepoint to retrieve the character for
+      # @return [String] Retrieved character
+      def codepoint_to_char(codepoint)
+        char = @charset[codepoint]
+        return char unless char.nil?
+        fail ArgumentError, "Codepoint #{codepoint} does not exist in charset"
+      end
+
+      # Convert a single character into its integer representation according to
+      # the charset.
+      #
+      # Example
+      #
+      #   charset = SecretSharing::Charset.by_charset_string 'abc'
+      #   charset.char_to_codepoint 'a'
+      #   # => 1
+      #
+      # @param c [String] Character to retrieve its codepoint in the charset
+      # @return [Integer] Codepoint within the charset
+      def char_to_codepoint(c)
+        codepoint = @charset.rindex c
+        return codepoint unless codepoint.nil?
+        error_msg = "Character \"#{c}\" not part of the supported charset"
+        fail ArgumentError, error_msg
+      end
+
+      # Total length of the charset
+      #
+      # Example
+      #
+      #   charset = SecretSharing::Charset.by_charset_string 'abc'
+      #   charset.length
+      #   # => 4
+      def length
+        @charset.length
+      end
+
+      # Adds a string representation of the charset to the string, which can
+      # later be used to recreate the charset.
+      #
+      #   Example
+      #
+      #     charset = SecretSharing::Charset.by_charset_string 'abc'
+      #     charset.add_to_point('1-2')
+      #     # => "abc-1-2"
+      #
+      # @param point_string [String] string to prepend to
+      # @return [String] string representation of charset-point_string
+      def add_to_point(point_string)
+        "#{@charset[1...length].join}-#{point_string}"
+      end
+
+      # Check if the provided string can be represented by the charset.
+      #
+      # Example
+      #
+      #   charset = SecretSharing::Charset.by_charset_string 'abc'
+      #   charset.subset? 'd'
+      #   # => false
+      #   charset.subset? 'a'
+      #   # => true
+      #
+      # @param string [String] Character to retrieve the for codepoint
+      # @return [TrueClass|FalseClass]
+      def subset?(string)
+        (Set.new(string.chars.uniq) - Set.new(@charset)).empty?
+      end
+    end
+
+    # Charset that can represent any string that only consists of ASCII
+    # characters.
+    class ASCIICharset < DynamicCharset
+      # An instance of an ASCIICharset is just a DynamicCharset with the ASCII
+      # characters.
+      def initialize
+        super((1..127).to_a.map(&:chr))
+      end
+
+      # Adds a string representation of the charset to the string (empty string
+      # in case of ASCII, since it is the default charset), which can later be
+      # used to recreate the charset.
+      #
+      # Example
+      #
+      #   charset = SecretSharing::Charset.by_charset_string 'abc'
+      #   charset.add_to_point('1-2')
+      #   # => "abc-1-2"
+      #
+      # @param point_string [String] string to prepend to
+      # @return [String] string representation of charset-point_string
+      def add_to_point(point_string)
+        point_string
+      end
+    end
+  end
+end

data/lib/secret_sharing/point.rb

@@ -0,0 +1,63 @@
+module SecretSharing
+  # This class is used to store a two dimensional point consisting of integers.
+  class Point
+    attr_accessor :x, :y
+
+    # Create a Point object.
+    #
+    # Examples
+    #
+    #   Point.new(1, 2)
+    #   # => #<Point: @x=1 @y=2>
+    #
+    # @param x [Integer] The x value of the point
+    # @param y [Integer] The y value of the point
+    def initialize(x, y)
+      @x = x
+      @y = y
+    end
+
+    # A nicer inspection of a point object than by default.
+    #
+    # @return [String] String representation of a Point
+    #
+    # Examples
+    #
+    #   SecretSharing::Point.new(1, 2).inspect
+    #   # => "#<Point: @x=1 @y=2>"
+    def inspect
+      "#<Point: @x=#{x} @y=#{y}>"
+    end
+
+    def to_s
+      "#{x}-#{y.to_s(16)}"
+    end
+
+    def self.from_string(point_string)
+      x_string, y_string = point_string.split '-'
+      Point.new x_string.to_i, y_string.to_i(16)
+    end
+
+    # An implementation similar to Array#transpose for Arrays of Points
+    #
+    # @return [Array] Two Arrays in an Array
+    #
+    # Examples
+    #
+    #   point1 = SecretSharing::Point.new(1, 2)
+    #   point2 = SecretSharing::Point.new(3, 4)
+    #   points = [point1, point2]
+    #   Point.transpose(points)
+    #   # => [[1, 3], [2, 4]]
+    def self.transpose(points)
+      x_values = []
+      y_values = []
+
+      points.each do |point|
+        x_values << point.x
+        y_values << point.y
+      end
+      [x_values, y_values]
+    end
+  end
+end

data/lib/secret_sharing/polynomial.rb

@@ -0,0 +1,123 @@
+require 'securerandom'
+
+module SecretSharing
+  # The polynomial is used to represent the required random polynomials used in
+  # Shamir's Secret Sharing algorithm.
+  class Polynomial
+    # Create a new instance of a Polynomial with n coefficients, when having
+    # the polynomial in standard polynomial form.
+    #
+    # Example
+    #
+    #   Polynomial.new [1, 2, 3]
+    #   # => #<SecretSharing::Polynomial:0x0000000 @coefficients=[1, 2, 3]>
+    #
+    # @param coefficients [Array] an array of integers as the coefficients
+    def initialize(coefficients)
+      @coefficients = coefficients
+    end
+
+    # Generate points on the polynomial, that can be used to reconstruct the
+    # polynomial with.
+    #
+    # Example
+    #
+    #   SecretSharing::Polynomial.new([1, 2, 3, 4]).points(3, 7)
+    #   # => [#<Point: @x=1 @y=3>, #<Point: @x=2 @y=0>, #<Point: @x=3 @y=2>]
+    #
+    # @param num_points [Integer] number of points to generate
+    # @param prime [Integer] prime for calculation in finite field
+    # @return [Array] array of calculated points
+    def points(num_points, prime)
+      (1..num_points).map do |x|
+        y = @coefficients[0]
+        (1...@coefficients.length).each do |i|
+          exponentiation = x**i % prime
+          term = (@coefficients[i] * exponentiation) % prime
+          y = (y + term) % prime
+        end
+        Point.new(x, y)
+      end
+    end
+
+    # Generate a random polynomial with a specific degree, defined x=0 value
+    # and an upper limit for the coefficients of the polynomial.
+    #
+    # Example
+    #
+    #   Polynomial.random(2, 3, 7)
+    #   # => #<SecretSharing::Polynomial:0x0000000 @coefficients=[3, 0, 4]>
+    #
+    # @param degree [Integer] degree of the polynomial to generate
+    # @param intercept [Integer] the y value for x=0
+    # @param upper_bound [Integer] the highest value of a single coefficient
+    def self.random(degree, intercept, upper_bound)
+      fail ArgumentError, 'Degree must be a non-negative number' if degree < 0
+
+      coefficients = (0...degree).reduce([intercept]) do |accumulator, _i|
+        accumulator << SecureRandom.random_number(upper_bound)
+      end
+      Polynomial.new coefficients
+    end
+
+    # Generate points from a secret integer.
+    #
+    # Example
+    #
+    #   SecretSharing::Polynomial.points_from_secret(123, 2, 3)
+    #   # => [#<Point: @x=1 @y=109>, #<Point: @x=2 @y=95>, #<Point: @x=3 @y=81>]
+    #
+    # @param secret_int [Integer] the secret to divide into points
+    # @param point_threshold [Integer] number of points to reconstruct
+    # @param num_points [Integer] number of points to generate
+    # @return [Polynomial] the generated polynomial
+    def self.points_from_secret(secret_int, point_threshold, num_points)
+      prime = SecretSharing::Prime.large_enough_prime([secret_int, num_points])
+      fail ArgumentError, 'Secret is too long' if prime.nil?
+      fail ArgumentError, 'Threshold must be at least 2' if point_threshold < 2
+      fail ArgumentError, 'Threshold must be less than the total number of points' if point_threshold > num_points
+
+      polynomial = SecretSharing::Polynomial.random(point_threshold - 1,
+                                                    secret_int,
+                                                    prime)
+      polynomial.points(num_points, prime)
+    end
+
+    # Modular lagrange interpolation
+    def self.modular_lagrange_interpolation(points)
+      y_values = Point.transpose(points)[1]
+      prime = SecretSharing::Prime.large_enough_prime(y_values)
+      points.reduce(0) do |f_x, point|
+        numerator, denominator = lagrange_fraction(points, point, prime)
+        lagrange_polynomial = numerator * mod_inverse(denominator, prime)
+        (prime + f_x + (point.y * lagrange_polynomial)) % prime
+      end
+    end
+
+    # part of the lagrange interpolation
+    def self.lagrange_fraction(points, current, prime)
+      numerator, denominator = 1, 1
+      points.each do |point|
+        if point != current
+          numerator = (numerator * (0 - point.x)) % prime
+          denominator = (denominator * (current.x - point.x)) % prime
+        end
+      end
+      [numerator, denominator]
+    end
+
+    # inverse modulo
+    def self.mod_inverse(k, prime)
+      k = k % prime
+      r = egcd(prime, k.abs)[2]
+      (prime + r) % prime
+    end
+
+    # extended Euclidean algorithm
+    def self.egcd(a, b)
+      return [b, 0, 1] if a == 0
+      g, y, x = egcd(b % a, a)
+      [g, x - b.div(a) * y, y]
+    end
+  end
+end

data/lib/secret_sharing/prime.rb

@@ -0,0 +1,44 @@
+module SecretSharing
+  # This module is used to generate/calculate/retrieve primes.
+  module Prime
+    # Retrieves the next largest prime for the largest number in batch
+    #
+    # Example
+    #
+    #   Prime.large_enough_prime [1, 2, 3, 4]
+    #   # => 7
+    #
+    # @param batch [Array] a list of integers
+    # @return [Integer] the next largest prime or nil if numbers too large
+    def large_enough_prime(batch)
+      standard_primes = mersenne_primes + [
+        # smallest 257, 321 and 385 bit primes
+        2**256 + 297, 2**320 + 27, 2**384 + 231
+      ].sort
+
+      standard_primes.each do |prime|
+        greater_than_prime = Array.new(batch).select { |i| i if i > prime }
+        return prime if greater_than_prime.empty?
+      end
+      nil
+    end
+
+    private
+
+    # Calculates the first 15 mersenne primes
+    def mersenne_primes
+      mersenne_prime_exponents = [
+        2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279
+      ]
+      mersenne_prime_exponents.map do |exp|
+        prime = 1
+        prime *= 2**exp
+        prime -= 1
+        prime
+      end
+    end
+
+    module_function :mersenne_primes,
+                    :large_enough_prime
+  end
+end

data/lib/secret_sharing/share.rb

@@ -0,0 +1,74 @@
+module SecretSharing
+  # A share is an object that encapsulates the properties of a share created by
+  # Shamir's Secret Sharing algorithm.
+  class Share
+    attr_reader :charset, :point
+
+    # Create a share object
+    #
+    # Example
+    #
+    #   charset = SecretSharing::ASCIICharset.new
+    #   point = SecretSharing::Point.new 1, 2
+    #   SecretSharing::Share.new charset, point
+    #   # => #<SecretSharing::Share:0x0000000 @charset=..., @point=...>
+    #
+    # @param charset [SecretSharing::Charset::DynamicCharset]
+    # @param point [SecretSharing::Point]
+    def initialize(charset, point)
+      @charset = charset
+      @point = point
+    end
+
+    # A string representation of a share.
+    #
+    # Example
+    #
+    #   charset = SecretSharing::ASCIICharset.new
+    #   point = SecretSharing::Point.new 1, 2
+    #   SecretSharing::Share.new(charset, point).to_s
+    #   # => "1-2"
+    #
+    def to_s
+      charset.add_to_point(point.to_s)
+    end
+
+    # Creates a share object from its string representation.
+    #
+    # Example
+    #
+    #   SecretSharing::Share.from_string "1-2"
+    #   # => #<SecretSharing::Share:0x0000000 @charset=..., @point=...>
+    #
+    def self.from_string(share_string)
+      charset_string, point_string = parse share_string
+      charset = Charset.by_charset_string charset_string
+      point = Point.from_string(point_string)
+      Share.new(charset, point)
+    end
+
+    # Parses the string representation of a share into charset and point
+    # coordinates out of a string representation of a share. Since the charset
+    # part can have a "-" in it it must be parsed backwards and not just
+    # splitted by "-".
+    #
+    # Example
+    #
+    #   SecretSharing::Share.parse '1-2'
+    #   # => ['', '1-2']
+    #
+    # @param share_string [String] a string representation of a share
+    # @return an array in form of [charset_string, point_string]
+    #
+    def self.parse(share_string)
+      charset_string, point_string = '', ''
+      number_of_dashes = 0
+      share_string.chars.reverse.each do |char|
+        charset_string.prepend(char) if number_of_dashes >= 2
+        number_of_dashes += 1 if char == '-'
+        point_string.prepend(char) if number_of_dashes <= 1
+      end
+      [charset_string, point_string]
+    end
+  end
+end

data/lib/secret_sharing/version.rb

@@ -0,0 +1,4 @@
+module SecretSharing
+  # gem version
+  VERSION = '0.0.1'
+end

data/secret_sharing.gemspec

@@ -0,0 +1,19 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'secret_sharing/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = 'secret_sharing'
+  spec.version       = SecretSharing::VERSION
+  spec.authors       = ['flower-pot']
+  spec.email         = ['fbranczyk@gmail.com']
+  spec.summary       = 'Ruby implementation of sharmir\'s secret sharing'
+  spec.description   = 'Divide, share and reconstruct secrets.'
+  spec.homepage      = 'https://github.com/duse-io/secret_sharing_ruby'
+  spec.license       = 'MIT'
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.test_files    = `git ls-files spec`.split($INPUT_RECORD_SEPARATOR)
+  spec.require_paths = ['lib']
+end

data/spec/charset_spec.rb

@@ -0,0 +1,36 @@
+require 'securerandom'
+
+describe SecretSharing::Charset do
+  context 'encode and decode' do
+    it 'should be able to decode randomly generated encoded strings' do
+      50.times do
+        str = SecureRandom.base64(100)
+        charset = SecretSharing::Charset.by_charset_string(str)
+        encoded = charset.s_to_i(str)
+        decoded = charset.i_to_s(encoded)
+        expect(decoded).to eq(str)
+      end
+    end
+
+    it 'should throw errors when characters that are not in charset' do
+      encoder = SecretSharing::Charset.by_charset_string('test')
+      expect { encoder.codepoint_to_char(5) }.to raise_error(ArgumentError)
+      expect { encoder.char_to_codepoint('r') }.to raise_error(ArgumentError)
+    end
+
+    it 'should throw an error when trying to convert negative numbers' do
+      encoder = SecretSharing::Charset.by_charset_string('test')
+      expect { encoder.i_to_s(-1) }.to raise_error(ArgumentError)
+    end
+
+    it 'should throw an error when trying to convert something non-integer' do
+      encoder = SecretSharing::Charset.by_charset_string('test')
+      expect { encoder.i_to_s('error') }.to raise_error(ArgumentError)
+    end
+
+    it 'should return the correct charset for ""' do
+      charset = SecretSharing::Charset.by_charset_string('')
+      expect(charset).to be_a SecretSharing::Charset::ASCIICharset
+    end
+  end
+end

data/spec/point_spec.rb

@@ -0,0 +1,22 @@
+describe SecretSharing::Point do
+  it 'should follow the ruby convention when inspecting' do
+    point = SecretSharing::Point.new(1, 2)
+    expect(point.inspect).to eq('#<Point: @x=1 @y=2>')
+  end
+
+  it 'should correctly stringify a point' do
+    expect(SecretSharing::Point.new(1, 2).to_s).to eq('1-2')
+  end
+
+  it 'should correctly create a point from a correctly formatted string' do
+    expect(SecretSharing::Point.new(1, 2).to_s).to eq('1-2')
+  end
+
+  it 'should be able to recreate a point from its string representation' do
+    point = SecretSharing::Point.new(1, 2)
+    string = point.to_s
+    reconstructed_point = SecretSharing::Point.from_string string
+    expect(reconstructed_point.x).to eq(point.x)
+    expect(reconstructed_point.y).to eq(point.y)
+  end
+end

data/spec/polynomial_spec.rb

@@ -0,0 +1,22 @@
+describe SecretSharing::Charset do
+  it 'should error when trying to generate a polynomial with negative degree' do
+    random_generator = -> { SecretSharing::Polynomial.random(-1, 1, 12) }
+    expect(&random_generator).to raise_error(ArgumentError)
+  end
+
+  it 'should error when the secret is to long' do
+    secret = 2**10_000
+    block = -> { SecretSharing::Polynomial.points_from_secret(secret, 2, 3) }
+    expect(&block).to raise_error(ArgumentError)
+  end
+
+  it 'should error when the point threshold is too small' do
+    block = -> { SecretSharing::Polynomial.points_from_secret(123, 1, 3) }
+    expect(&block).to raise_error(ArgumentError)
+  end
+
+  it 'should error when the point threshold is larger than total points' do
+    block = -> { SecretSharing::Polynomial.points_from_secret(123, 3, 2) }
+    expect(&block).to raise_error(ArgumentError)
+  end
+end

data/spec/prime_spec.rb

@@ -0,0 +1,7 @@
+describe SecretSharing::Prime do
+  context '#get_large_enough_prime' do
+    it 'should calc the correct prime' do
+      expect(SecretSharing::Prime.large_enough_prime([1, 2, 3, 4])).to eq(7)
+    end
+  end
+end

data/spec/secret_sharing_spec.rb

@@ -0,0 +1,19 @@
+require 'securerandom'
+
+describe SecretSharing do
+  it 'should encrypt and decrypt correctly' do
+    50.times do
+      secret = SecureRandom.base64(130)
+      num_of_shares = 2 + SecureRandom.random_number(100)
+      shares = SecretSharing.split_secret(secret, 2, num_of_shares)
+      expect(SecretSharing.recover_secret(shares[0..1])).to eq(secret)
+    end
+  end
+
+  it 'should work with non ascii characters as well' do
+    secret = 'κόσμε'
+    num_of_shares = 2 + SecureRandom.random_number(100)
+    shares = SecretSharing.split_secret(secret, 2, num_of_shares)
+    expect(SecretSharing.recover_secret(shares[0..1])).to eq(secret)
+  end
+end

data/spec/share_spec.rb

@@ -0,0 +1,9 @@
+describe SecretSharing::Share do
+  it 'correctly parses a string representation of a share' do
+    expect(SecretSharing::Share.parse('$$ASCII-1-2')).to eq(['$$ASCII', '1-2'])
+  end
+
+  it 'correctly parses a share when charset contains a "-"' do
+    expect(SecretSharing::Share.parse('tes--1-2')).to eq(['tes-', '1-2'])
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,55 @@
+# This file was generated by the `rspec --init` command. Conventionally, all
+# specs live under a `spec` directory, which RSpec adds to the `$LOAD_PATH`.
+# The generated `.rspec` file contains `--require spec_helper` which will cause
+# this file to always be loaded, without a need to explicitly require it in any
+# files.
+#
+# Given that it is always loaded, you are encouraged to keep this file as
+# light-weight as possible. Requiring heavyweight dependencies from this file
+# will add to the boot time of your test suite on EVERY test run, even for an
+# individual file that may not need all of that loaded. Instead, consider
+# making a separate helper file that requires the additional dependencies and
+# performs the additional setup, and require it from the spec files that
+# actually need it.
+#
+# The `.rspec` file also contains a few flags that are not defaults but that
+# users commonly want.
+#
+# See http://rubydoc.info/gems/rspec-core/RSpec/Core/Configuration
+
+unless ENV['CI']
+  require 'simplecov'
+  SimpleCov.start
+end
+
+if ENV['CI']
+  require 'coveralls'
+  Coveralls.wear!
+end
+
+require 'secret_sharing'
+
+RSpec.configure do |config|
+  # rspec-expectations config goes here. You can use an alternate
+  # assertion/expectation library such as wrong or the stdlib/minitest
+  # assertions if you prefer.
+  config.expect_with :rspec do |expectations|
+    # This option will default to `true` in RSpec 4. It makes the `description`
+    # and `failure_message` of custom matchers include text for helper methods
+    # defined using `chain`, e.g.:
+    # be_bigger_than(2).and_smaller_than(4).description
+    #   # => "be bigger than 2 and smaller than 4"
+    # ...rather than:
+    #   # => "be bigger than 2"
+    expectations.include_chain_clauses_in_custom_matcher_descriptions = true
+  end
+
+  # rspec-mocks config goes here. You can use an alternate test double
+  # library (such as bogus or mocha) by changing the `mock_with` option here.
+  config.mock_with :rspec do |mocks|
+    # Prevents you from mocking or stubbing a method that does not exist on
+    # a real object. This is generally recommended, and will default to
+    # `true` in RSpec 4.
+    mocks.verify_partial_doubles = true
+  end
+end

metadata

@@ -0,0 +1,77 @@
+--- !ruby/object:Gem::Specification
+name: secret_sharing
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- flower-pot
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-12-04 00:00:00.000000000 Z
+dependencies: []
+description: Divide, share and reconstruct secrets.
+email:
+- fbranczyk@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".rubocop.yml"
+- ".travis.yml"
+- ".yardops"
+- Gemfile
+- Gemfile.lock
+- LICENSE
+- README.md
+- Rakefile
+- lib/secret_sharing.rb
+- lib/secret_sharing/charset.rb
+- lib/secret_sharing/point.rb
+- lib/secret_sharing/polynomial.rb
+- lib/secret_sharing/prime.rb
+- lib/secret_sharing/share.rb
+- lib/secret_sharing/version.rb
+- secret_sharing.gemspec
+- spec/charset_spec.rb
+- spec/point_spec.rb
+- spec/polynomial_spec.rb
+- spec/prime_spec.rb
+- spec/secret_sharing_spec.rb
+- spec/share_spec.rb
+- spec/spec_helper.rb
+homepage: https://github.com/duse-io/secret_sharing_ruby
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+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.4.3
+signing_key: 
+specification_version: 4
+summary: Ruby implementation of sharmir's secret sharing
+test_files:
+- spec/charset_spec.rb
+- spec/point_spec.rb
+- spec/polynomial_spec.rb
+- spec/prime_spec.rb
+- spec/secret_sharing_spec.rb
+- spec/share_spec.rb
+- spec/spec_helper.rb
+has_rdoc: