Chris's user avatar
Chris's user avatar
Chris's user avatar
Chris
  • Member for 9 years, 11 months
  • Last seen more than 4 years ago
  • Luxembourg
5 votes

Why can't we use a hash with no collision to compress data reliably?

4 votes
Accepted

What is the meaning of the overlapping region on OTP-perfect secrecy diagram?

4 votes

Is it okay to include relative time for true random number generation?

4 votes

How to hash similar strings to the same hash value?

3 votes

Is there a way to use bcrypt with passwords longer than 72 bytes securely?

3 votes

Is there a number of tries after which Hashcash is guaranted to be solved?

3 votes
Accepted

Transforming Gaussian random $[0,1] $ numbers to uniform $[0,255] $

2 votes

Why develop Edward curve formulas that deviate from unification?

2 votes

Can one construct OTPs without using XOR?

2 votes

How to retrieve the plaintext of a substitution ciphertext?

2 votes

Is it necessary to generate a private key for each encryption process?

2 votes

Trying to understand the constant factors (19 and 38) in Ed25519 ref10 function 'fe_mul'

2 votes

Optimal same-base exponentiation?

1 vote

Elligator-2 against curves over Fq, q mod 4 = 3

0 votes

Why is XOR preferred over XNOR?

0 votes

Chopping off SHA-256 entropy?

-1 votes

Pseudorandom functions: how are functions stored?