3,700 reputation
1621
bio website
location United States
age
visits member for 3 years
seen 4 hours ago

Oct
10
comment How does MD5 process text which is shorter than 512 bits
en.wikipedia.org/wiki/MD5#Algorithm $\;$
Oct
8
comment How do I generate a number for a lottery and later proves its existence
@tylo : $\:$ I mean a collision with short inputs. $\;\;\;\;$
Oct
7
comment How do I generate a number for a lottery and later proves its existence
@tylo : $\:$ One uses a short collision in the actual hash function. $\;\;\;\;$
Oct
6
comment How do I generate a number for a lottery and later proves its existence
The drawback "of doing this over" a perfectly binding scheme is that, for each hash function, there exists a fast way to break the binding property.
Oct
6
comment How do I generate a number for a lottery and later proves its existence
eprint.iacr.org/2011/223.pdf $\;$
Oct
6
revised How can one recover a message from the RSA system?
fixed title's grammar
Oct
3
revised How can I do minus on plaintexts in the Paillier cryptosystem?
fixed title's grammar
Oct
3
comment Alternative to NSA encryption algorithm
cr.yp.to/codes/mceliece-20080807.pdf $\;$
Oct
2
revised Alternative to NSA encryption algorithm
copy-edited and fixed a tag
Oct
1
comment Witness and Commitment in Commitment schemes
Not necessarily. $\:$ A bit or string is committed to. $\:$ That bit or string might $\hspace{1.8 in}$ happen to be a witness to something else. $\;\;\;\;$
Oct
1
answered Witness and Commitment in Commitment schemes
Oct
1
revised What is h in this RSA variant?
improved title's grammar
Oct
1
comment Why are we not using multiple ciphers per message?
... what it sounds like? They're the potential outputs that one doesn't become sure are not the actual output.
Oct
1
comment Why are we not using multiple ciphers per message?
@mikeazo : You can; it just takes a number of processors proportional to the number of potential outputs that don't get ruled out.
Sep
30
awarded  Explainer
Sep
30
comment Why should CAST5 and 3DES not be used for encrypting files over 4GB?
loose $\mapsto$ lose $\;$
Sep
30
comment Possible Digital Signature Hack?
Someone can't "generate another private key that will match your public key" because known ways to do that with currently existing technology would take too long to have a non-negligible probability of success.
Sep
29
revised How can I extract a X.509 DER certificate from a byte[]?
fixed title's grammar
Sep
28
comment Question about second preimage resistance of hash function combiner
A (1st) pre-image "attack on two combined hash functions" can be made to be "at least as difficult as an attack on the stronger of the two hash functions", but it is far from clear that the OP's combiner does so. $\;$
Sep
28
comment Simpler proof of RSA's correctness
You can only "apply Euler's theorem to $x$ and $p$ and $x$ and $q$ separately" when $x$ is neither a multiple of $p$ nor a multiple of $q$. $\;$