secretsharing 0.1 → 0.2

data/README

@@ -27,6 +27,9 @@
    # show secret
    puts s.secret
 
+   # show password representation of secret (Base64)
+   puts s.secret_password
+
    # show shares
    s.shares.each { |share| puts share }
 

data/lib/secretsharing/shamir.rb

@@ -1,5 +1,6 @@
 require 'openssl'
 require 'digest/sha1'
+require 'base64'
 
 module SecretSharing
 	# The SecretSharing::Shamir class can be used to share random
@@ -67,6 +68,14 @@ module SecretSharing
 			@secret
 		end
 
+		# The secret in a password representation (Base64-encoded)
+		def secret_password
+			if ! secret_set? then
+				raise "Secret not (yet) set."
+			end
+			Base64.encode64([@secret.to_s(16)].pack('h*')).split("\n").join
+		end
+
 		# Add a secret share to the object. Accepts either a SecretSharing::Shamir::Share
 		# instance or a string representing one. Returns true if enough shares have
 		# been added to recover the secret, false otherweise.
@@ -170,11 +179,13 @@ module SecretSharing
 		def recover_secret
 			@secret = OpenSSL::BN.new('0')
 			@received_shares.each do |share|
-				summand = share.y * l(share.x, @received_shares)
+				l_x = l(share.x, @received_shares)
+				summand = share.y * l_x
 				summand %= share.prime
 				@secret += summand
 				@secret %= share.prime
 			end
+			@secret
 		end
 		
 		# Part of the Lagrange interpolation.
@@ -183,10 +194,12 @@ module SecretSharing
 		# for more information compare Wikipedia:
 		# http://en.wikipedia.org/wiki/Lagrange_form
 		def l(x, shares)
-			shares.select { |s| s.x != x }.map do |s|
-				OpenSSL::BN.new((-s.x).to_s) * 
-				OpenSSL::BN.new((x - s.x).to_s).mod_inverse(shares[0].prime)
-			end.inject { |p, f| p.mod_mul(f, shares[0].prime) }
+			(shares.select { |s| s.x != x }.map do |s|
+				minus_xi = OpenSSL::BN.new((-s.x).to_s)
+				one_over_xj_minus_xi = OpenSSL::BN.new((x - s.x).to_s) \
+				                       .mod_inverse(shares[0].prime)
+				minus_xi.mod_mul(one_over_xj_minus_xi, shares[0].prime)
+			end.inject { |p, f| p.mod_mul(f, shares[0].prime) })
 		end
 	end
 

data/test/test_shamir.rb

@@ -59,6 +59,17 @@ class TestShamir < Test::Unit::TestCase
 		assert_equal(s.secret, s2.secret)
 	end
 
+	def test_recover_secret_k_eq_n_strings
+		s = SecretSharing::Shamir.new(2)
+		s.create_random_secret()
+
+		s2 = SecretSharing::Shamir.new(2)
+		s2 << s.shares[0].to_s
+		s2 << s.shares[1].to_s
+
+		assert_equal(s.secret, s2.secret)
+	end
+
 	def test_recover_secret_k_le_n
 		s = SecretSharing::Shamir.new(5, 3)
 		s.create_random_secret()

metadata

@@ -1,7 +1,12 @@
 --- !ruby/object:Gem::Specification 
 name: secretsharing
 version: !ruby/object:Gem::Version 
-  version: "0.1"
+  hash: 15
+  prerelease: false
+  segments: 
+  - 0
+  - 2
+  version: "0.2"
 platform: ruby
 authors: 
 - Alexander Klink
@@ -9,7 +14,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-09-19 00:00:00 +02:00
+date: 2010-09-26 00:00:00 +02:00
 default_executable: 
 dependencies: []
 
@@ -41,21 +46,27 @@ rdoc_options: []
 require_paths: 
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
       version: "0"
-  version: 
 required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
       version: "0"
-  version: 
 requirements: []
 
 rubyforge_project: 
-rubygems_version: 1.3.5
+rubygems_version: 1.3.7
 signing_key: 
 specification_version: 3
 summary: A library to share secrets in an information-theoretically secure way.