ecdsa 0.1.2 → 0.1.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 19cab1e9d25b0f525c8a61db8e1bd928722cde6d
-  data.tar.gz: 6cae1f2e7de3429228c3fe43c66bbd86c4662661
+  metadata.gz: c0121dec834c8271050e3f0ac28a4cabd7992312
+  data.tar.gz: 164644a297bbfba485495e665b93fa88b9e038ee
 SHA512:
-  metadata.gz: 3bcb9fc48a95019c7fc37ed9cca870d66f566ddc7a00f538b202ccffbb6809c91a3d94ed72f373f8a098930a65e81969527c55c30fc131cde3417f95bb0c5644
-  data.tar.gz: b91f509231cbc681a2d701e8817fe82b18b0fcdc7b95d48a0865042b5096b27c79515ff99bca3bfc7f714a40c17e17dfa526e6ee6097b04d136a2be16b2c59ba
+  metadata.gz: 8ac219b31a4c03e2d25e0abb85d5c3fef74cca7911e0846f72278cfb7eadb3f1e2592fabacb32419deff5c7f67358a769e22a3a788e960edfdcff40f855e4548
+  data.tar.gz: 0fea14c24369c83051b5aacc69cd437eae7426e4f47147f524ea5cedb45809ebfc4bdcabac8896b104bcde09badefa6da8cb4a07c449fa9f27ed0a3a9a527a7d

data/README.md

@@ -14,6 +14,13 @@ use a pre-existing group object such as `ECDSA::Group::Secp256k1`.
 The pre-existing groups can be seen in the `lib/ecdsa/group` folder, and include all the curves
 defined in [SEC2](http://www.secg.org/collateral/sec2_final.pdf) and [NIST's Recommended Elliptic Curves for Federal Government Use](http://csrc.nist.gov/groups/ST/toolkit/documents/dss/NISTReCur.pdf).
 
+This gem does not use any randomness; all the algorithms are deterministic.
+In order to sign an ECDSA message, you must generate a secure random number _k_ between 0
+and the order of the group and pass it as an argument to `ECDSA.sign`.
+You should take measures to ensure that you never use the same random number to sign
+two different messages, or else it would be easy for anyone to compute your
+private key from those two signatures.
+
 This gem is hosted at the [DavidEGrayson/ruby_ecdsa github repository](https://github.com/DavidEGrayson/ruby_ecdsa).
 
 ## Current limitations
@@ -23,7 +30,11 @@ This gem is hosted at the [DavidEGrayson/ruby_ecdsa github repository](https://g
 - This gem can only compute square roots in prime fields over a prime _p_
   that is one less than a multiple of 4.
   Computing a square root is required for parsing public keys stored in compressed form.
-- There is no documentation.  If you know ECDSA and know how to read Ruby source code,
-  you can probably figure it out though.
+- There is no documentation.  If you know a little bit about ECDSA and know how to read
+  Ruby source code, you can probably figure it out though.
 - The algorithms have not been optimized for speed, and will probably never be, because that
-  would hinder the goal of helping people understand ECDSA.
+  would hinder the goal of helping people understand ECDSA.
+
+This gem was not written by a cryptography expert and has not been carefully checked.
+It is provided "as is" and it is the user's responsibility to make sure it will be
+suitable for the desired purpose.

data/lib/ecdsa/version.rb

@@ -1,3 +1,3 @@
 module ECDSA
-  VERSION = '0.1.2'
+  VERSION = '0.1.3'
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: ecdsa
 version: !ruby/object:Gem::Version
-  version: 0.1.2
+  version: 0.1.3
 platform: ruby
 authors:
 - David Grayson