1,175 reputation
311
bio website redtwitz.com
location Paraguay
age 30
visits member for 2 years, 9 months
seen Jul 13 at 0:34

Mathematician. Power user. Coding enthusiast.

flair


Dec
20
reviewed Reviewed Why is it important that phi(n) is kept a secret, in RSA?
Dec
20
reviewed No Action Needed Can one build a one-way function from AES?
Dec
20
reviewed Reviewed Why doesn't this replay attack work on ECDSA?
Dec
20
reviewed Reviewed Information leakage in real-time voice encryption
Dec
20
reviewed No Action Needed Get RSA PlainText without Knowing Private Key
Dec
20
reviewed Reviewed Is Convergent Encryption really secure?
Dec
20
awarded  Custodian
Dec
20
reviewed No Action Needed Need for Twin Elgamal encryption
Dec
20
revised Double Encrypting with two different keys
formatting, made URL legible, changed "unique" to "independent"
Dec
20
comment Double Encrypting with two different keys
It's important that the keys are actually independent, not just unique. To similar algorithms with related keys could go as far as canceling each other out, resulting in unencrypted plaintext.
Dec
20
suggested suggested edit on Double Encrypting with two different keys
Dec
17
revised security of Felix cipher
corrected effective key size, improved attacks
Dec
17
answered AES Key Length vs Block Length
Dec
17
answered Why is h(m||k) insecure?
Dec
16
comment creating a small number from a cryptographically secure random string
@fgrieu: That typo was a byproduct of the edit. Thanks. Which algorithm is the Best is relative. The algorithm provides randomness and is easy to implement, but it generates only 0.79 bits of output for every bit of input. (I assume that's what you mean by odds of failure.) Of course, if $x^2 \leq n$, the algorithm becomes rather inefficient.
Dec
16
revised creating a small number from a cryptographically secure random string
edited body
Dec
16
revised security of Felix cipher
added 3259 characters in body
Dec
16
revised creating a small number from a cryptographically secure random string
added 1281 characters in body
Dec
15
comment creating a small number from a cryptographically secure random string
@neubert: See comment above.
Dec
15
comment creating a small number from a cryptographically secure random string
@Thomas: I see what you mean. I'll expand on that when I have a little more time. The division in X < (N / K) * K is integer division. If we were interested in integers below 100, we can use all X such that X < (256 / 100) * 100 = 2 * 100 = 200. With X < K, there would be no need for the modulus.