This repository has been archived by the owner on Aug 26, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 12
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
SIRP module no longer exports public module methods. Just include SIR…
…P where needed. Client and Verifier provide all the API.
- Loading branch information
Showing
6 changed files
with
154 additions
and
152 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,5 +1,5 @@ | ||
| module SIRP | ||
| def self.Ng(group) | ||
| def Ng(group) | ||
| case group | ||
| when 1024 | ||
| @N = %w( | ||
|
|
||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,111 +1,109 @@ | ||
| module SIRP | ||
| class << self | ||
| # http://stackoverflow.com/questions/3772410/convert-a-string-of-0-f-into-a-byte-array-in-ruby | ||
| def hex_to_bytes(str) | ||
| [str].pack('H*').unpack('C*') | ||
| end | ||
|
|
||
| def num_to_hex(num) | ||
| hex_str = num.to_s(16) | ||
| even_hex_str = hex_str.length.odd? ? '0' + hex_str : hex_str | ||
| even_hex_str.downcase | ||
| end | ||
|
|
||
| def sha_hex(h, hash_klass) | ||
| hash_klass.hexdigest([h].pack('H*')) | ||
| end | ||
|
|
||
| def sha_str(s, hash_klass) | ||
| hash_klass.hexdigest(s) | ||
| end | ||
|
|
||
| # Modular Exponentiation | ||
| # https://en.m.wikipedia.org/wiki/Modular_exponentiation | ||
| # http://rosettacode.org/wiki/Modular_exponentiation#Ruby | ||
| # | ||
| # a^b (mod m) | ||
| def mod_exp(a, b, m) | ||
| # Use OpenSSL::BN#mod_exp | ||
| a.to_bn.mod_exp(b, m) | ||
| end | ||
|
|
||
| # Hashing function with padding. | ||
| # Input is prefixed with 0 to meet N hex width. | ||
| def H(hash_klass, n, *a) | ||
| nlen = 2 * ((('%x' % [n]).length * 4 + 7) >> 3) | ||
|
|
||
| hashin = a.map do |s| | ||
| next unless s | ||
| shex = (s.class == String) ? s : num_to_hex(s) | ||
| if shex.length > nlen | ||
| raise 'Bit width does not match - client uses different prime' | ||
| end | ||
| '0' * (nlen - shex.length) + shex | ||
| end.join('') | ||
|
|
||
| sha_hex(hashin, hash_klass).hex % n | ||
| end | ||
|
|
||
| # Multiplier parameter | ||
| # k = H(N, g) (in SIRP-6a) | ||
| def calc_k(n, g, hash_klass) | ||
| H(hash_klass, n, n, g) | ||
| end | ||
|
|
||
| # Private key (derived from username, raw password and salt) | ||
| # x = H(salt || H(username || ':' || password)) | ||
| def calc_x(username, password, salt, hash_klass) | ||
| spad = salt.length.odd? ? '0' : '' | ||
| sha_hex(spad + salt + sha_str([username, password].join(':'), hash_klass), hash_klass).hex | ||
| end | ||
|
|
||
| # Random scrambling parameter | ||
| # u = H(A, B) | ||
| def calc_u(xaa, xbb, n, hash_klass) | ||
| H(hash_klass, n, xaa, xbb) | ||
| end | ||
|
|
||
| # Password verifier | ||
| # v = g^x (mod N) | ||
| def calc_v(x, n, g) | ||
| mod_exp(g, x, n) | ||
| end | ||
|
|
||
| # A = g^a (mod N) | ||
| def calc_A(a, n, g) | ||
| mod_exp(g, a, n) | ||
| end | ||
|
|
||
| # B = g^b + k v (mod N) | ||
| def calc_B(b, k, v, n, g) | ||
| (mod_exp(g, b, n) + k * v) % n | ||
| end | ||
|
|
||
| # Client secret | ||
| # S = (B - (k * g^x)) ^ (a + (u * x)) % N | ||
| def calc_client_S(bb, a, k, x, u, n, g) | ||
| mod_exp((bb - k * mod_exp(g, x, n)) % n, (a + x * u), n) | ||
| end | ||
|
|
||
| # Server secret | ||
| # S = (A * v^u) ^ b % N | ||
| def calc_server_S(aa, b, v, u, n) | ||
| mod_exp((mod_exp(v, u, n) * aa), b, n) | ||
| end | ||
|
|
||
| # M = H(A, B, K) | ||
| def calc_M(xaa, xbb, xkk, hash_klass) | ||
| digester = hash_klass.new | ||
| digester << hex_to_bytes(xaa).pack('C*') | ||
| digester << hex_to_bytes(xbb).pack('C*') | ||
| digester << hex_to_bytes(xkk).pack('C*') | ||
| digester.hexdigest | ||
| end | ||
|
|
||
| # H(A, M, K) | ||
| def calc_H_AMK(xaa, xmm, xkk, hash_klass) | ||
| byte_string = hex_to_bytes([xaa, xmm, xkk].join('')).pack('C*') | ||
| sha_str(byte_string, hash_klass).hex | ||
| end | ||
| # http://stackoverflow.com/questions/3772410/convert-a-string-of-0-f-into-a-byte-array-in-ruby | ||
| def hex_to_bytes(str) | ||
| [str].pack('H*').unpack('C*') | ||
| end | ||
|
|
||
| def num_to_hex(num) | ||
| hex_str = num.to_s(16) | ||
| even_hex_str = hex_str.length.odd? ? '0' + hex_str : hex_str | ||
| even_hex_str.downcase | ||
| end | ||
|
|
||
| def sha_hex(h, hash_klass) | ||
| hash_klass.hexdigest([h].pack('H*')) | ||
| end | ||
|
|
||
| def sha_str(s, hash_klass) | ||
| hash_klass.hexdigest(s) | ||
| end | ||
|
|
||
| # Modular Exponentiation | ||
| # https://en.m.wikipedia.org/wiki/Modular_exponentiation | ||
| # http://rosettacode.org/wiki/Modular_exponentiation#Ruby | ||
| # | ||
| # a^b (mod m) | ||
| def mod_exp(a, b, m) | ||
| # Use OpenSSL::BN#mod_exp | ||
| a.to_bn.mod_exp(b, m) | ||
| end | ||
|
|
||
| # Hashing function with padding. | ||
| # Input is prefixed with 0 to meet N hex width. | ||
| def H(hash_klass, n, *a) | ||
| nlen = 2 * ((('%x' % [n]).length * 4 + 7) >> 3) | ||
|
|
||
| hashin = a.map do |s| | ||
| next unless s | ||
| shex = (s.class == String) ? s : num_to_hex(s) | ||
| if shex.length > nlen | ||
| raise 'Bit width does not match - client uses different prime' | ||
| end | ||
| '0' * (nlen - shex.length) + shex | ||
| end.join('') | ||
|
|
||
| sha_hex(hashin, hash_klass).hex % n | ||
| end | ||
|
|
||
| # Multiplier parameter | ||
| # k = H(N, g) (in SIRP-6a) | ||
| def calc_k(n, g, hash_klass) | ||
| H(hash_klass, n, n, g) | ||
| end | ||
|
|
||
| # Private key (derived from username, raw password and salt) | ||
| # x = H(salt || H(username || ':' || password)) | ||
| def calc_x(username, password, salt, hash_klass) | ||
| spad = salt.length.odd? ? '0' : '' | ||
| sha_hex(spad + salt + sha_str([username, password].join(':'), hash_klass), hash_klass).hex | ||
| end | ||
|
|
||
| # Random scrambling parameter | ||
| # u = H(A, B) | ||
| def calc_u(xaa, xbb, n, hash_klass) | ||
| H(hash_klass, n, xaa, xbb) | ||
| end | ||
|
|
||
| # Password verifier | ||
| # v = g^x (mod N) | ||
| def calc_v(x, n, g) | ||
| mod_exp(g, x, n) | ||
| end | ||
|
|
||
| # A = g^a (mod N) | ||
| def calc_A(a, n, g) | ||
| mod_exp(g, a, n) | ||
| end | ||
|
|
||
| # B = g^b + k v (mod N) | ||
| def calc_B(b, k, v, n, g) | ||
| (mod_exp(g, b, n) + k * v) % n | ||
| end | ||
|
|
||
| # Client secret | ||
| # S = (B - (k * g^x)) ^ (a + (u * x)) % N | ||
| def calc_client_S(bb, a, k, x, u, n, g) | ||
| mod_exp((bb - k * mod_exp(g, x, n)) % n, (a + x * u), n) | ||
| end | ||
|
|
||
| # Server secret | ||
| # S = (A * v^u) ^ b % N | ||
| def calc_server_S(aa, b, v, u, n) | ||
| mod_exp((mod_exp(v, u, n) * aa), b, n) | ||
| end | ||
|
|
||
| # M = H(A, B, K) | ||
| def calc_M(xaa, xbb, xkk, hash_klass) | ||
| digester = hash_klass.new | ||
| digester << hex_to_bytes(xaa).pack('C*') | ||
| digester << hex_to_bytes(xbb).pack('C*') | ||
| digester << hex_to_bytes(xkk).pack('C*') | ||
| digester.hexdigest | ||
| end | ||
|
|
||
| # H(A, M, K) | ||
| def calc_H_AMK(xaa, xmm, xkk, hash_klass) | ||
| byte_string = hex_to_bytes([xaa, xmm, xkk].join('')).pack('C*') | ||
| sha_str(byte_string, hash_klass).hex | ||
| end | ||
| end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.