crypt-isaac 0.9.1 → 1.0.0
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +7 -0
- data/CODE_OF_CONDUCT.md +13 -0
- data/Gemfile +4 -0
- data/LICENSE.txt +21 -0
- data/README.md +62 -0
- data/Rakefile +10 -0
- data/bin/console +14 -0
- data/bin/setup +7 -0
- data/crypt-isaac.gemspec +27 -33
- data/lib/crypt/isaac.rb +213 -0
- data/lib/crypt/isaac/version.rb +5 -0
- metadata +84 -52
- data/LICENSE +0 -26
- data/README +0 -78
- data/TODO +0 -3
- data/VERSIONS +0 -3
- data/lib/crypt-isaac.rb +0 -171
- data/setup.rb +0 -596
- data/test/TC_ISAAC.rb +0 -76
checksums.yaml
ADDED
@@ -0,0 +1,7 @@
|
|
1
|
+
---
|
2
|
+
SHA1:
|
3
|
+
metadata.gz: eeff4541c06d7907ba4eb56a0784cb908fd1c039
|
4
|
+
data.tar.gz: fc61b38f750e2e3a805580b424aafc057aff01bb
|
5
|
+
SHA512:
|
6
|
+
metadata.gz: 7181904366b11ae6ce0be343a720e0e0e56f847579675e0ef00680888e9dce6413dadaff21e0d3cd297b4b591cc718dc77d00fdef4e41a135f8be816138b2610
|
7
|
+
data.tar.gz: b937c669132250c3cbc4d7fc4cfbadbfebfed56211f6a252fb4d0dbb088e94713f9f30c9bb6121318060dd72e6a3d567754f7e95fde6dff1d3f3bb55f43e6b23
|
data/CODE_OF_CONDUCT.md
ADDED
@@ -0,0 +1,13 @@
|
|
1
|
+
# Contributor Code of Conduct
|
2
|
+
|
3
|
+
As contributors and maintainers of this project, we pledge to respect all people who contribute through reporting issues, posting feature requests, updating documentation, submitting pull requests or patches, and other activities.
|
4
|
+
|
5
|
+
We are committed to making participation in this project a harassment-free experience for everyone, regardless of level of experience, gender, gender identity and expression, sexual orientation, disability, personal appearance, body size, race, ethnicity, age, or religion.
|
6
|
+
|
7
|
+
Examples of unacceptable behavior by participants include the use of sexual language or imagery, derogatory comments or personal attacks, trolling, public or private harassment, insults, or other unprofessional conduct.
|
8
|
+
|
9
|
+
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. Project maintainers who do not follow the Code of Conduct may be removed from the project team.
|
10
|
+
|
11
|
+
Instances of abusive, harassing, or otherwise unacceptable behavior may be reported by opening an issue or contacting one or more of the project maintainers.
|
12
|
+
|
13
|
+
This Code of Conduct is adapted from the [Contributor Covenant](http://contributor-covenant.org), version 1.0.0, available at [http://contributor-covenant.org/version/1/0/0/](http://contributor-covenant.org/version/1/0/0/)
|
data/Gemfile
ADDED
data/LICENSE.txt
ADDED
@@ -0,0 +1,21 @@
|
|
1
|
+
The MIT License (MIT)
|
2
|
+
|
3
|
+
Copyright (c) 2015 Kirk Haines
|
4
|
+
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
7
|
+
in the Software without restriction, including without limitation the rights
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
10
|
+
furnished to do so, subject to the following conditions:
|
11
|
+
|
12
|
+
The above copyright notice and this permission notice shall be included in
|
13
|
+
all copies or substantial portions of the Software.
|
14
|
+
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
21
|
+
THE SOFTWARE.
|
data/README.md
ADDED
@@ -0,0 +1,62 @@
|
|
1
|
+
# Crypt::Isaac
|
2
|
+
|
3
|
+
ISAAC is a cryptographically secure PRNG for generating high quality random numbers. Detailed information about the algorithm can be found at:
|
4
|
+
|
5
|
+
http://burtleburtle.net/bob/rand/isaac.html
|
6
|
+
|
7
|
+
This is a pure Ruby implementation of the algorithm, but it is reasonably fast.
|
8
|
+
|
9
|
+
When originally written, running on Ruby 1.8.2 under a venerable 800Mhz PIII Linux system, it could do 15000 to 16000 numbers per second. On Ruby 2.2.3, running on a basic Digital Ocean VM, it can generate almost a million random integers or floats per second.
|
10
|
+
|
11
|
+
Ruby uses the Mersenne Twister as its PRNG, and while this algorithm is a fast PRNG that produces highly random numbers with good stastical properties, it is not cryptographically strong. ISAAC is very fast, also has good statistical properties, and is cryptographically strong.
|
12
|
+
|
13
|
+
## Installation
|
14
|
+
|
15
|
+
Add this line to your application's Gemfile:
|
16
|
+
|
17
|
+
```ruby
|
18
|
+
gem 'crypt-isaac'
|
19
|
+
```
|
20
|
+
|
21
|
+
And then execute:
|
22
|
+
|
23
|
+
$ bundle
|
24
|
+
|
25
|
+
Or install it yourself as:
|
26
|
+
|
27
|
+
$ gem install crypt-isaac
|
28
|
+
|
29
|
+
## Usage
|
30
|
+
|
31
|
+
```ruby
|
32
|
+
require 'crypt/isaac'
|
33
|
+
|
34
|
+
rng = Crypt::ISAAC.new # New ISAAC object, seeded using /dev/urandom or /dev/random, if available.
|
35
|
+
rng = Crypt::ISAAC.new(17773845992) # New ISAAC object, seeded from a deterministic point.
|
36
|
+
|
37
|
+
r1 = rng.rand() # returns a floating point number between 0 and 1
|
38
|
+
r2 = rng.rand(10.57) # returns a floating point number between 0 and 10.57
|
39
|
+
r2 = rnd.rand(1000) # returns an integer between 0 and 999
|
40
|
+
r3 = rnd.rand(3..12) # returns an integer between 3 and 12
|
41
|
+
noise = rng.bytes(1024) # return a 1k string of random bytes
|
42
|
+
```
|
43
|
+
|
44
|
+
Crypt::ISAAC should provide the same API as the Ruby 2.2 version of Random.
|
45
|
+
|
46
|
+
Enjoy it. Let me know if you find anything that can be improved or that
|
47
|
+
needs to be fixed.
|
48
|
+
|
49
|
+
## Development
|
50
|
+
|
51
|
+
After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake test` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
|
52
|
+
|
53
|
+
To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
|
54
|
+
|
55
|
+
## Contributing
|
56
|
+
|
57
|
+
Bug reports and pull requests are welcome on GitHub at https://github.com/wyhaines/crypt-isaac. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](contributor-covenant.org) code of conduct.
|
58
|
+
|
59
|
+
## License
|
60
|
+
|
61
|
+
The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
|
62
|
+
|
data/Rakefile
ADDED
data/bin/console
ADDED
@@ -0,0 +1,14 @@
|
|
1
|
+
#!/usr/bin/env ruby
|
2
|
+
|
3
|
+
require "bundler/setup"
|
4
|
+
require "crypt/isaac"
|
5
|
+
|
6
|
+
# You can add fixtures and/or initialization code here to make experimenting
|
7
|
+
# with your gem easier. You can also use a different console, if you like.
|
8
|
+
|
9
|
+
# (If you use this, don't forget to add pry to your Gemfile!)
|
10
|
+
# require "pry"
|
11
|
+
# Pry.start
|
12
|
+
|
13
|
+
require "irb"
|
14
|
+
IRB.start
|
data/bin/setup
ADDED
data/crypt-isaac.gemspec
CHANGED
@@ -1,39 +1,33 @@
|
|
1
|
-
|
2
|
-
|
3
|
-
|
4
|
-
|
5
|
-
#
|
6
|
-
# Licensed under the Ruby License. See the README for details.
|
7
|
-
#
|
8
|
-
#####
|
1
|
+
# coding: utf-8
|
2
|
+
lib = File.expand_path('../lib', __FILE__)
|
3
|
+
$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
|
4
|
+
require 'crypt/isaac/version'
|
9
5
|
|
10
|
-
|
11
|
-
|
12
|
-
|
13
|
-
|
14
|
-
|
6
|
+
Gem::Specification.new do |spec|
|
7
|
+
spec.name = "crypt-isaac"
|
8
|
+
spec.version = Crypt::Isaac::VERSION
|
9
|
+
spec.authors = ["Kirk Haines"]
|
10
|
+
spec.email = ["wyhaines@gmail.com"]
|
15
11
|
|
16
|
-
|
17
|
-
|
18
|
-
|
12
|
+
spec.summary = %q{An implementation of the ISAAC PRNG}
|
13
|
+
spec.description = %q{ISAAC is a cryptgraphically secure pseudorandom number generator. This is a Ruby implementation of the algorithm.}
|
14
|
+
spec.homepage = "http://github.com/wyhaines/crypt-isaac"
|
15
|
+
spec.license = "MIT"
|
19
16
|
|
20
|
-
|
21
|
-
|
22
|
-
|
17
|
+
# Prevent pushing this gem to RubyGems.org by setting 'allowed_push_host', or
|
18
|
+
# delete this section to allow pushing this gem to any host.
|
19
|
+
if spec.respond_to?(:metadata)
|
20
|
+
spec.metadata['allowed_push_host'] = "https://rubygems.org"
|
21
|
+
else
|
22
|
+
raise "RubyGems 2.0 or newer is required to protect against public gem pushes."
|
23
|
+
end
|
23
24
|
|
24
|
-
|
25
|
+
spec.files = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
|
26
|
+
spec.bindir = "exe"
|
27
|
+
spec.executables = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
|
28
|
+
spec.require_paths = ["lib"]
|
25
29
|
|
26
|
-
|
27
|
-
|
28
|
-
|
29
|
-
s.homepage = %q(http://rubyforge.org/projects/crypt-isaac)
|
30
|
-
description = []
|
31
|
-
File.open("README") do |file|
|
32
|
-
file.each do |line|
|
33
|
-
line.chomp!
|
34
|
-
break if line.empty?
|
35
|
-
description << "#{line.gsub(/\[\d\]/, '')}"
|
36
|
-
end
|
37
|
-
end
|
38
|
-
s.description = description[1..-1].join(" ")
|
30
|
+
spec.add_development_dependency "bundler", "~> 1.10"
|
31
|
+
spec.add_development_dependency "rake", "~> 10.0"
|
32
|
+
spec.add_development_dependency "minitest"
|
39
33
|
end
|
data/lib/crypt/isaac.rb
ADDED
@@ -0,0 +1,213 @@
|
|
1
|
+
module Crypt
|
2
|
+
|
3
|
+
# ISAAC is a fast, strong random number generator. Details on the
|
4
|
+
# algorithm can be found here: http://burtleburtle.net/bob/rand/isaac.html
|
5
|
+
# This provides a consistent and capable algorithm for producing
|
6
|
+
# independent streams of quality random numbers.
|
7
|
+
|
8
|
+
class ISAAC
|
9
|
+
|
10
|
+
attr_accessor :randrsl, :randcnt
|
11
|
+
attr_accessor :mm, :aa, :bb, :cc
|
12
|
+
|
13
|
+
# When a Crypt::ISAAC object is created, it needs to be seeded for
|
14
|
+
# random number generation. If the system has a /dev/urandom file,
|
15
|
+
# that will be used to do the seeding by default. If false is explictly
|
16
|
+
# passed when creating the object, it will instead use /dev/random to
|
17
|
+
# generate its seeds. Be warned that this may make for SLOW
|
18
|
+
# initialization.
|
19
|
+
# If the requested source (/dev/urandom or /dev/random) do not exist,
|
20
|
+
# the system will fall back to a simplistic initialization mechanism
|
21
|
+
# using the builtin Mersenne Twister PRNG.
|
22
|
+
|
23
|
+
def initialize(seed = true)
|
24
|
+
@mm = []
|
25
|
+
|
26
|
+
if Integer === seed || Random === seed
|
27
|
+
self.srand(seed)
|
28
|
+
else
|
29
|
+
@seed = seed
|
30
|
+
rnd_source = ( ( seed == true ) || ( seed == false ) ) ?
|
31
|
+
( seed ? '/dev/urandom' : '/dev/random' ) :
|
32
|
+
seed
|
33
|
+
if (FileTest.exist? rnd_source)
|
34
|
+
@randrsl = []
|
35
|
+
File.open(rnd_source,'r') do |r|
|
36
|
+
256.times do |t|
|
37
|
+
z = r.read(4)
|
38
|
+
x = z.unpack('V')[0]
|
39
|
+
@randrsl[t] = x
|
40
|
+
end
|
41
|
+
end
|
42
|
+
randinit(true)
|
43
|
+
else
|
44
|
+
raise "Entropy source (#{rnd_source}) doesn't exist. The ISAAC algorithm can not be seeded."
|
45
|
+
end
|
46
|
+
end
|
47
|
+
end
|
48
|
+
|
49
|
+
# If seeded with an integer, use that to seed a standard Ruby Mersenne Twister
|
50
|
+
# PRNG, and then use that to generate seed value for ISAAC. This is mostly useful
|
51
|
+
# for producing repeated, deterministic results, which may be needed for testing.
|
52
|
+
def srand(seed)
|
53
|
+
@seed = seed
|
54
|
+
@randrsl = []
|
55
|
+
seed_prng = ( Random === seed ) ? seed : Random.new(seed)
|
56
|
+
256.times do |t|
|
57
|
+
@randrsl[t] = seed_prng.rand(4294967295)
|
58
|
+
end
|
59
|
+
randinit(true)
|
60
|
+
end
|
61
|
+
|
62
|
+
# Works just like the standard rand() function. If called with an
|
63
|
+
# integer argument, rand() will return positive random number in
|
64
|
+
# the range of 0 to (argument - 1). If called without an integer
|
65
|
+
# argument, rand() returns a positive floating point number less than 1.
|
66
|
+
# If called with a Range, returns a number that is in the range.
|
67
|
+
|
68
|
+
def rand(arg = nil)
|
69
|
+
if (@randcnt == 1)
|
70
|
+
isaac
|
71
|
+
@randcnt = 256
|
72
|
+
end
|
73
|
+
@randcnt -= 1
|
74
|
+
if arg.nil?
|
75
|
+
( @randrsl[@randcnt] / 536870912.0 ) % 1
|
76
|
+
elsif Integer === arg || Float === arg
|
77
|
+
@randrsl[@randcnt] % arg
|
78
|
+
elsif Range === arg
|
79
|
+
arg.min + @randrsl[@randcnt] % (arg.max - arg.min)
|
80
|
+
else
|
81
|
+
@randrsl[@randcnt] % Integer(arg)
|
82
|
+
end
|
83
|
+
end
|
84
|
+
|
85
|
+
def seed
|
86
|
+
Random === @seed ? @seed.seed : @seed
|
87
|
+
end
|
88
|
+
|
89
|
+
def state
|
90
|
+
@randrsl + [@randcnt]
|
91
|
+
end
|
92
|
+
|
93
|
+
def ==(gen)
|
94
|
+
self.state == gen.state
|
95
|
+
end
|
96
|
+
|
97
|
+
def bytes(size)
|
98
|
+
buffer = ""
|
99
|
+
( size / 4 ).times { buffer << [rand(4294967295)].pack("L").unpack("aaaa").join }
|
100
|
+
|
101
|
+
if size % 4 != 0
|
102
|
+
buffer << [rand(4294967295)].pack("L").unpack("aaaa")[0..(size % 4 - 1)].join
|
103
|
+
end
|
104
|
+
|
105
|
+
buffer
|
106
|
+
end
|
107
|
+
|
108
|
+
def isaac
|
109
|
+
i = 0
|
110
|
+
x = 0
|
111
|
+
y = 0
|
112
|
+
|
113
|
+
@cc += 1
|
114
|
+
@bb += @cc
|
115
|
+
@bb & 0xffffffff
|
116
|
+
|
117
|
+
while (i < 256) do
|
118
|
+
x = @mm[i]
|
119
|
+
@aa = (@mm[(i + 128) & 255] + (@aa^(@aa << 13)) ) & 0xffffffff
|
120
|
+
@mm[i] = y = (@mm[(x>>2)&255] + @aa + @bb ) & 0xffffffff
|
121
|
+
@randrsl[i] = @bb = (@mm[(y>>10)&255] + x ) & 0xffffffff
|
122
|
+
i += 1
|
123
|
+
|
124
|
+
x = @mm[i]
|
125
|
+
@aa = (@mm[(i+128)&255] + (@aa^(0x03ffffff & (@aa >> 6))) ) & 0xffffffff
|
126
|
+
@mm[i] = y = (@mm[(x>>2)&255] + @aa + @bb ) & 0xffffffff
|
127
|
+
@randrsl[i] = @bb = (@mm[(y>>10)&255] + x ) & 0xffffffff
|
128
|
+
i += 1
|
129
|
+
|
130
|
+
x = @mm[i]
|
131
|
+
@aa = (@mm[(i + 128)&255] + (@aa^(@aa << 2)) ) & 0xffffffff
|
132
|
+
@mm[i] = y = (@mm[(x>>2)&255] + @aa + @bb ) & 0xffffffff
|
133
|
+
@randrsl[i] = @bb = (@mm[(y>>10)&255] + x ) & 0xffffffff
|
134
|
+
i += 1
|
135
|
+
|
136
|
+
x = @mm[i]
|
137
|
+
@aa = (@mm[(i+128)&255] + (@aa^(0x0000ffff & (@aa >> 16))) ) & 0xffffffff
|
138
|
+
@mm[i] = y = (@mm[(x>>2)&255] + @aa + @bb ) & 0xffffffff
|
139
|
+
@randrsl[i] = @bb = (@mm[(y>>10)&255] + x ) & 0xffffffff
|
140
|
+
i += 1
|
141
|
+
end
|
142
|
+
end
|
143
|
+
|
144
|
+
def randinit(flag)
|
145
|
+
i = 0
|
146
|
+
a = 0
|
147
|
+
b = 0
|
148
|
+
c = 0
|
149
|
+
d = 0
|
150
|
+
e = 0
|
151
|
+
f = 0
|
152
|
+
g = 0
|
153
|
+
@aa = @bb = @cc = 0
|
154
|
+
a = b = c = d = e = f = g = h = 0x9e3779b9
|
155
|
+
|
156
|
+
while (i < 4) do
|
157
|
+
a ^= b<<1; d += a; b += c
|
158
|
+
b ^= 0x3fffffff & (c>>2); e += b; c += d
|
159
|
+
c ^= d << 8; f += c; d += e
|
160
|
+
d ^= 0x0000ffff & (e >> 16); g += d; e += f
|
161
|
+
e ^= f << 10; h += e; f += g
|
162
|
+
f ^= 0x0fffffff & (g >> 4); a += f; g += h
|
163
|
+
g ^= h << 8; b += g; h += a
|
164
|
+
h ^= 0x007fffff & (a >> 9); c += h; a += b
|
165
|
+
i += 1
|
166
|
+
end
|
167
|
+
|
168
|
+
i = 0
|
169
|
+
while (i < 256) do
|
170
|
+
if (flag)
|
171
|
+
a+=@randrsl[i ].to_i; b+=@randrsl[i+1].to_i;
|
172
|
+
c+=@randrsl[i+2]; d+=@randrsl[i+3];
|
173
|
+
e+=@randrsl[i+4]; f+=@randrsl[i+5];
|
174
|
+
g+=@randrsl[i+6]; h+=@randrsl[i+7];
|
175
|
+
end
|
176
|
+
|
177
|
+
a^=b<<11; d+=a; b+=c;
|
178
|
+
b^=0x3fffffff & (c>>2); e+=b; c+=d;
|
179
|
+
c^=d<<8; f+=c; d+=e;
|
180
|
+
d^=0x0000ffff & (e>>16); g+=d; e+=f;
|
181
|
+
e^=f<<10; h+=e; f+=g;
|
182
|
+
f^=0x0fffffff & (g>>4); a+=f; g+=h;
|
183
|
+
g^=h<<8; b+=g; h+=a;
|
184
|
+
h^=0x007fffff & (a>>9); c+=h; a+=b;
|
185
|
+
@mm[i]=a;@mm[i+1]=b; @mm[i+2]=c; @mm[i+3]=d;
|
186
|
+
@mm[i+4]=e; @mm[i+5]=f; @mm[i+6]=g; @mm[i+7]=h;
|
187
|
+
i += 8
|
188
|
+
end
|
189
|
+
|
190
|
+
if flag
|
191
|
+
i = 0
|
192
|
+
while (i < 256)
|
193
|
+
a+=@mm[i ]; b+=@mm[i+1]; c+=@mm[i+2]; d+=@mm[i+3];
|
194
|
+
e+=@mm[i+4]; f+=@mm[i+5]; g+=@mm[i+6]; h+=@mm[i+7];
|
195
|
+
a^=b<<11; d+=a; b+=c;
|
196
|
+
b^=0x3fffffff & (c>>2); e+=b; c+=d;
|
197
|
+
c^=d<<8; f+=c; d+=e;
|
198
|
+
d^=0x0000ffff & (e>>16); g+=d; e+=f;
|
199
|
+
e^=f<<10; h+=e; f+=g;
|
200
|
+
f^=0x0fffffff & (g>>4); a+=f; g+=h;
|
201
|
+
g^=h<<8; b+=g; h+=a;
|
202
|
+
h^=0x007fffff & (a>>9); c+=h; a+=b;
|
203
|
+
@mm[i ]=a; @mm[i+1]=b; @mm[i+2]=c; @mm[i+3]=d;
|
204
|
+
@mm[i+4]=e; @mm[i+5]=f; @mm[i+6]=g; @mm[i+7]=h;
|
205
|
+
i += 8
|
206
|
+
end
|
207
|
+
end
|
208
|
+
|
209
|
+
isaac()
|
210
|
+
@randcnt=256; # /* prepare to use the first set of results */
|
211
|
+
end
|
212
|
+
end
|
213
|
+
end
|
metadata
CHANGED
@@ -1,66 +1,98 @@
|
|
1
|
-
--- !ruby/object:Gem::Specification
|
1
|
+
--- !ruby/object:Gem::Specification
|
2
2
|
name: crypt-isaac
|
3
|
-
version: !ruby/object:Gem::Version
|
4
|
-
version: 0.
|
3
|
+
version: !ruby/object:Gem::Version
|
4
|
+
version: 1.0.0
|
5
5
|
platform: ruby
|
6
|
-
authors:
|
6
|
+
authors:
|
7
7
|
- Kirk Haines
|
8
8
|
autorequire:
|
9
|
-
bindir:
|
9
|
+
bindir: exe
|
10
10
|
cert_chain: []
|
11
|
-
|
12
|
-
|
13
|
-
|
14
|
-
|
15
|
-
|
16
|
-
|
17
|
-
|
11
|
+
date: 2015-11-11 00:00:00.000000000 Z
|
12
|
+
dependencies:
|
13
|
+
- !ruby/object:Gem::Dependency
|
14
|
+
name: bundler
|
15
|
+
requirement: !ruby/object:Gem::Requirement
|
16
|
+
requirements:
|
17
|
+
- - "~>"
|
18
|
+
- !ruby/object:Gem::Version
|
19
|
+
version: '1.10'
|
20
|
+
type: :development
|
21
|
+
prerelease: false
|
22
|
+
version_requirements: !ruby/object:Gem::Requirement
|
23
|
+
requirements:
|
24
|
+
- - "~>"
|
25
|
+
- !ruby/object:Gem::Version
|
26
|
+
version: '1.10'
|
27
|
+
- !ruby/object:Gem::Dependency
|
28
|
+
name: rake
|
29
|
+
requirement: !ruby/object:Gem::Requirement
|
30
|
+
requirements:
|
31
|
+
- - "~>"
|
32
|
+
- !ruby/object:Gem::Version
|
33
|
+
version: '10.0'
|
34
|
+
type: :development
|
35
|
+
prerelease: false
|
36
|
+
version_requirements: !ruby/object:Gem::Requirement
|
37
|
+
requirements:
|
38
|
+
- - "~>"
|
39
|
+
- !ruby/object:Gem::Version
|
40
|
+
version: '10.0'
|
41
|
+
- !ruby/object:Gem::Dependency
|
42
|
+
name: minitest
|
43
|
+
requirement: !ruby/object:Gem::Requirement
|
44
|
+
requirements:
|
45
|
+
- - ">="
|
46
|
+
- !ruby/object:Gem::Version
|
47
|
+
version: '0'
|
48
|
+
type: :development
|
49
|
+
prerelease: false
|
50
|
+
version_requirements: !ruby/object:Gem::Requirement
|
51
|
+
requirements:
|
52
|
+
- - ">="
|
53
|
+
- !ruby/object:Gem::Version
|
54
|
+
version: '0'
|
55
|
+
description: ISAAC is a cryptgraphically secure pseudorandom number generator. This
|
56
|
+
is a Ruby implementation of the algorithm.
|
57
|
+
email:
|
58
|
+
- wyhaines@gmail.com
|
18
59
|
executables: []
|
19
|
-
|
20
60
|
extensions: []
|
21
|
-
|
22
|
-
|
23
|
-
-
|
24
|
-
|
25
|
-
-
|
26
|
-
-
|
27
|
-
-
|
28
|
-
-
|
29
|
-
- setup
|
61
|
+
extra_rdoc_files: []
|
62
|
+
files:
|
63
|
+
- CODE_OF_CONDUCT.md
|
64
|
+
- Gemfile
|
65
|
+
- LICENSE.txt
|
66
|
+
- README.md
|
67
|
+
- Rakefile
|
68
|
+
- bin/console
|
69
|
+
- bin/setup
|
30
70
|
- crypt-isaac.gemspec
|
31
|
-
-
|
32
|
-
- lib/crypt
|
33
|
-
|
34
|
-
|
35
|
-
|
36
|
-
|
71
|
+
- lib/crypt/isaac.rb
|
72
|
+
- lib/crypt/isaac/version.rb
|
73
|
+
homepage: http://github.com/wyhaines/crypt-isaac
|
74
|
+
licenses:
|
75
|
+
- MIT
|
76
|
+
metadata:
|
77
|
+
allowed_push_host: https://rubygems.org
|
37
78
|
post_install_message:
|
38
|
-
rdoc_options:
|
39
|
-
|
40
|
-
- Crypt::ISAAC
|
41
|
-
- --main
|
42
|
-
- README
|
43
|
-
- --line-numbers
|
44
|
-
require_paths:
|
79
|
+
rdoc_options: []
|
80
|
+
require_paths:
|
45
81
|
- lib
|
46
|
-
required_ruby_version: !ruby/object:Gem::Requirement
|
47
|
-
requirements:
|
82
|
+
required_ruby_version: !ruby/object:Gem::Requirement
|
83
|
+
requirements:
|
48
84
|
- - ">="
|
49
|
-
- !ruby/object:Gem::Version
|
50
|
-
version:
|
51
|
-
|
52
|
-
|
53
|
-
requirements:
|
85
|
+
- !ruby/object:Gem::Version
|
86
|
+
version: '0'
|
87
|
+
required_rubygems_version: !ruby/object:Gem::Requirement
|
88
|
+
requirements:
|
54
89
|
- - ">="
|
55
|
-
- !ruby/object:Gem::Version
|
56
|
-
version:
|
57
|
-
version:
|
90
|
+
- !ruby/object:Gem::Version
|
91
|
+
version: '0'
|
58
92
|
requirements: []
|
59
|
-
|
60
|
-
|
61
|
-
rubygems_version: 1.3.5
|
93
|
+
rubyforge_project:
|
94
|
+
rubygems_version: 2.4.5.1
|
62
95
|
signing_key:
|
63
|
-
specification_version:
|
64
|
-
summary:
|
65
|
-
test_files:
|
66
|
-
- test/TC_ISAAC.rb
|
96
|
+
specification_version: 4
|
97
|
+
summary: An implementation of the ISAAC PRNG
|
98
|
+
test_files: []
|