3,577 reputation
1519
bio website
location United States
age
visits member for 2 years, 10 months
seen 8 mins ago

Jul
21
comment Lowest number challenge scheme
@Seth : $\;\;\;$ It's at least approximately that problem. $\:$ If ties are supposed to be broken at random, $\hspace{.41 in}$ then this question's problem may be more difficult. $\;\;\;\;\;\;\;$
Jul
21
comment Allowing multiple password reset tokens, and a question on random number predictability
This is quite clever. $\:$ On the other hand, it requires that the reset component have access to the password-hash component, which would stop one from isolating the latter. $\:$ Related to that, RNG does matter, since if the token validity period is decreased by the same amount of time as passed between two token requests by the same user, then an eavesdropper on however the tokens were sent can tell whether or not the same password-salt combination was reused. $\;\;\;\;$
Jul
21
comment Allowing multiple password reset tokens, and a question on random number predictability
What is r? $\;$
Jul
21
comment Is there a generic attack on encrypted CRC32 when used as a MAC?
@fgrieu : $\:$ Is there such an attack when the hash goes before the plaintext? $\;\;\;\;$
Jul
21
answered Is there a generic attack on encrypted CRC32 when used as a MAC?
Jul
21
comment Allowing multiple password reset tokens, and a question on random number predictability
I'm less suited to address the follow-up to (4) than a large number of other users on this site; I also think that should be a separate question (though perhaps mentioning this application). $\:$ The RFC on UUIDs states that "The requirements for" name-based "UUIDs are as follows: The UUIDs generated at different times from the same name in the same namespace MUST be equal. ...". $\;\;\;\;$
Jul
20
answered Allowing multiple password reset tokens, and a question on random number predictability
Jul
20
comment Security equivalent to Diffie–Hellman problem?
This assumes the group's order is known. $\:$ Also, if the group's order is a composite with a small factor and $b$ is chosen to be a unit modulo it, then as far as I can see this only gives a complexity-theoretic equivalence rather than a cryptographic equivalence. $\;\;\;\;$
Jul
16
comment Leak-proof protocol: is such a thing possible?
Using scrypt would reduce the leakage rate by making it more difficult to find a $\hspace{1.33 in}$ plaintext that will produce a suitable ciphertext. $\:$
Jul
12
comment Does CCA security imply authenticated encryption?
... in terms of existence of schemes or particular schemes? $\;$
Jul
12
revised How does recovering the public key from an ECDSA signature work?
fixed grammar
Jul
10
comment What is a proof of data possession that accounts for fake mirrors?
Alice can get a very low ping connection to one of the places and require that she receives a response faster than it would take for a light-speed signal to go back and forth between that place and the closest other relevant place. $\;$
Jul
9
revised How can I calculate the Rijndael SBox?
improved grammar
Jul
9
revised McEliece and cryptanalysis
removed extra spaces and changed "Mceliece" to "McEliece"
Jul
7
comment Password-based encrypted key storage?
"passphrase" $\: \mapsto \:$ "passphrase and salt" $\;\;\;\;$
Jul
3
comment Can a homomorphic encryption scheme be made CCA2 Secure?
You might find this paper interesting. $\;$
Jul
3
answered Problem with Python Implementation of Key Exchange part OTR Protocol
Jul
3
answered Is a keyed PRF a MAC?
Jul
3
revised Elliptic Curve Crypto, is a distributed signing method possible using Shamir's Secret Sharing?
improved grammar and changed spacing
Jul
2
awarded  Curious