-
Since SJCL now includes ECC public/private key operations, would there be any interest in adding RSA? It seems like Tom Wu's JSBN is the "typical" implementation used by most JS libraries, and is rele…
evanj updated
9 years ago
-
I see `curved25519_scalarmult_basepoint` in order to generate public keys but the library is missing `curved25519_scalarmult`.
TomMD updated
9 years ago
-
Hi Ken,
I was looking over the implementation of ecdsa_sign() and was wondering about of the generation of the k value. The algorithm effectively performs a simple modulo of the supplied random valu…
-
I might be wrong, but from what I've gathered while doing #14 & #15 is that the lib uses standard double-and-add for point multiplication.
As exposed [here](http://saluc.engr.uconn.edu/refs/sidechann…
-
Hi, thanks for creating tool, I'm really thankful.
I'm currently using it to generate a large amount of keys and it's taking a very long time because I'm loading a text file from a shell script and pi…
-
The current implementation of **mul** leaks timing information, I suggest modifying it to use montgomery multiplication:
def bits(n):
b = []
while n > 0:
b.append(n % 2)
n >>=…
-
At the moment, stoke requires all programs in its search to be "sound", which means that no undefined values can be read, and that all values that are live_out must be defined. If one wants to synthe…
-
Although new to Julia ( just 3 days ago I built Julia from source and started playing around with it, I am already very enthusiastic.
Yet, when running a "classical" Lucas-Lehmer test on Mersenne pr…
ghost updated
11 years ago