-
Compute n = pq.
```
n is used as the modulus for both the public and private keys. Its length, usually expressed in bits, is the key length.
```
Compute φ(n) = φ(p)φ(q) = (p − 1)(q − 1) = n - (p + q…
-
Given the recent discovery that is now possible to create collisions in sha1 it would be good for RapidCRC to detect them.
https://shattered.io/
**Quoting from the above URL:**
> What types o…
-
## Describe the bug
When qubits are allocated and released during a function call in a loop, the reported depth corresponds to a circuit where all function calls occur in parallel, but the reported w…
-
Generally not something you want to do. Likely doesn't matter that much given that both the key and IV are baked in, so the current encryption scheme is already just a speed bump, but figured it was w…
-
Hi, thanks for this package!
I'm looking at this as an alternative to Hashids, which I'm avoiding due in part to:
> Clearly if you have access to the salt, it is trivial to calculate the functio…
-
Time spent hashing is currently a minority of the overhead, but not insignificant (10%-ish).
Apparently, siphash128 is no longer "experimental" (what's the hard rationale for this?).
HighwayHash…
-
- Only minor things in the course evaluation. Only 7/52 answered (13.5%), at the time. [Edit: That turned out to be the final count as well.]
From the kursnämnd:
# Good things
- Good assignme…
-
Is it correct that the linear layer matrix / constants are known to the attacker? Does not seem to be written on the challenge page, but only mentioned in the paper by Banik et al.
Also, are weak l…
-
Suppose the ballot is something nice and compact, say 63 bit random ID (user selectable to avoid identical ballot collisions) and a bit for yes vs no on some issue. Then all 64 bit strings are valid b…
-
This is a really bad idea:
```
$cipherText->key;
```
The interface should be changed so that the key is never stored in the ciphertext... because it will lead naive users to believe that it's ok to …