Reputation
4,932
Next tag badge:
51/100 score
30/20 answers
Badges
1 6 21
Newest
 Yearling
Impact
~47k people reached

Apr
22
comment Why does second pre-image resistance imply pre-image resistance
I gave that example over a year ago. $\;$
Apr
22
comment Double-and-add/Montgomery VS blinding
I suspect that's because blinding is not as good and makes the runtime generally longer, $\hspace{1.04 in}$ even if it seems as good and is cheaper to implement. $\;$
Apr
22
answered Authenticated EC key exchange without a signing/signature scheme?
Apr
22
comment Elliptic curve cryptography G*G
That is the Fixed Pairing Inversion problem. $\;$
Apr
22
answered Elliptic curve cryptography G*G
Apr
22
comment Super-simple encryption of short strings
How many letters long are the initials? $\;$
Apr
22
comment Super-simple encryption of short strings
Is "a symmetric encoding" in the sense of symmetric encryption vs. PKE, or something else? $\hspace{.91 in}$
Apr
20
answered How is the MAC or HMAC secret shared with the other party for verification?
Apr
19
answered Is it ever unsafe to compress an EC point?
Apr
16
revised Are keys generated by the user or block cipher algorithms themselves?
improved grammar
Apr
16
comment SSL / TLS digital signature exchange
@HarshitBhatt : $\;\;\;$ Yes. $\:$ Does the server's public key count as one of the "details" of "the original certificate"? $\:$ ... Almost tautologically, "if they are not used anywhere" then there won't be a use for them. $\;\;\;\;\;\;\;$
Apr
16
comment How do I control an access code safely?
tarsnap.com/scrypt.html $\;$
Apr
15
revised Popularity of ECMQV authenticated key agreement protocol
improved grammar
Apr
15
comment What is the meaning of h(r) in this protocol?
$h$ is a hash function. $\;$
Apr
15
comment Asymmetric encryption that is secure for (almost) any foreseeable future
@HadrienG. : $\;\;\;$ No, since there isn't even a known proof that there is no extremely practical algorithm for QBFs. $\:$ There is a complete PKE scheme, but it's completely impractical. $\;\;\;\;\;\;\;\;$
Apr
15
comment Asymmetric encryption that is secure for (almost) any foreseeable future
"Security is broken if an attacker can ... or reliably forge a message that looks like it has $\hspace{1.1 in}$ been encrypted with the private key" is an odd criterion. $\;$
Apr
14
comment Value of S and r in Fiat-Shamir Protocol
Why would RSA fail in that case? $\;$
Apr
12
comment Prove there is PRG that is not necessarily one-to-one
"one by one" $\: \mapsto \:$ "one-to-one" $\;\;\;$ ? $\;\;\;\;\;\;\;\;$
Apr
12
comment Prove there is PRG that is not necessarily one-to-one
What would it mean for a PRG to be "one by one"? $\;$
Apr
11
comment Zero knowledge proof relation + number is binary
ZNPK $\mapsto$ ZKPK $\:$ ? $\;\;\;\;$