Reputation
34,697
Next tag badge:
116/100 score
19/20 answers
Badges
5 71 141
Newest
 Nice Answer
Impact
~696k people reached

Dec
6
answered Are there two-way encryption algorithms that include a work factor?
Dec
2
comment Is HMAC-DRBG or Hash-DRBG stronger?
To be precise: HMAC-DRBG is not weaker than Hash-DRBG. We have no indication that Hash-DRBG is weak in any way, and you cannot be strictly stronger than that. Yet we have good reasons to believe that HMAC-DRBG cannot be weaker than Hash-DRBG (an attack against HMAC-DRBG would probably work just as well against Hash-DRBG).
Dec
1
reviewed Approve What is the appropriate public key encryption for secure coin flipping?
Dec
1
reviewed Approve What is the property of RSA where N=e?
Dec
1
answered Are safe primes $p=2^k \pm s$ with $s$ small less recommandable than others as a discrete log modulus?
Dec
1
answered What is the appropriate public key encryption for secure coin flipping?
Nov
30
revised Software implementation of a commutative cipher?
edited tags
Nov
30
reviewed Approve Software implementation of a commutative cipher?
Nov
29
answered Are there any specific requirements for the function $F$ in a Feistel cipher?
Nov
28
answered Where is the proof of security of Diffie's cipher?
Nov
28
reviewed Approve How much would it cost in U.S. dollars to brute force a 256 bit key in a year?
Nov
27
revised How can one show that an ElGamal-like signature verification scheme is valid?
added 1 characters in body
Nov
27
answered How can one show that an ElGamal-like signature verification scheme is valid?
Nov
26
answered Verilog simulation of Data Encryption Standard
Nov
25
answered How does the wider cryptographic community view non-abelian group based cryptography?
Nov
24
answered Is a book cipher provably secure?
Nov
24
comment Security of simple xor and s-box cipher?
$S$ "exists" as code which can compute a value ($S[x]$) for every $x$. One possible implementation is as a big array. Or you could have a sequence of instructions. That's equivalent here: if you have, e.g., 2 kB of ROM (code + arrays) then you have 16384 bits, and you can possibly compute only $2^{16384}$ distinct functions with that. But there are far many more possible functions with 256-bit inputs than that. Whether you use your ROM budget for code or for data is irrelevant in this computation.
Nov
23
answered Using a Non-Random IV with modes other than CBC
Nov
23
reviewed Approve license-key tag wiki excerpt
Nov
23
reviewed Approve