26,078 reputation
11847
bio website
location
age
visits member for 2 years, 8 months
seen 1 hour ago

Sep
20
reviewed Approve suggested edit on xts tag wiki
Sep
20
reviewed Approve suggested edit on xts tag wiki excerpt
Sep
20
reviewed Approve suggested edit on mceliece tag wiki
Sep
20
reviewed Approve suggested edit on mceliece tag wiki excerpt
Sep
19
reviewed Approve suggested edit on Generating keys with HKDF from Diffie Hellman agreement
Sep
19
revised Shamir's secret sharing with passwords
A typo that really bugged me...
Sep
19
answered Shamir's secret sharing with passwords
Sep
18
reviewed Approve suggested edit on Encrypting 8 times with 8-bit key beneficial?
Sep
18
reviewed Approve suggested edit on How to choose keys for a block cipher?
Sep
18
reviewed Approve suggested edit on linear-cryptanalysis tag wiki excerpt
Sep
18
reviewed Approve suggested edit on linear-cryptanalysis tag wiki
Sep
18
reviewed Approve suggested edit on modular-arithmetic tag wiki
Sep
18
comment PKCS1 and blind RSA signatures
@neubert: Huh? The EMSA-PKCS1-V1_5-ENCODE is just the padding operation. Are you saying that you'll be doing the padding, but not the RSA part? If not, what are you saying?
Sep
17
answered PKCS1 and blind RSA signatures
Sep
16
comment Explanation of the Decision Diffie Hellman (DDH) problem.
@Alex: when we state "problem X can be reduced to problem Y", we mean that if we are given a solution to problem Y, we can then solve problem X (hence, X is either easier, or as difficult, as Y). In this case, if you are given a magic black box that, given $g$, $g^a$, $g^b$, gives you $F(g^{ab})$, the CDH problem remains hard; we can recover the value of $F(g^{ab})$, however there doesn't appear a way to get the full $g^{ab}$ value demanded by CDH
Sep
12
revised Proof of correct construction of a private key in distributed cryptography
Minor correction
Sep
12
answered Proof of correct construction of a private key in distributed cryptography
Sep
11
revised Recasting randomly generated numbers to other widths
English fixups
Sep
11
answered Recasting randomly generated numbers to other widths
Sep
11
comment Hide a weakness in ECC by choosing the prime or one of the curve coefficients
One note: you can take (5) off the list; it is known that, on a curve of prime order, no member (other than the PoI, of course) is particularly weak; if we can solve the DLOG or cDH problem with one generator, we can solve them with any generator. If there is a weakness, it must reside in the combination of $p$ and $b$.