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

10h
comment Asymmetric cipher with multiple public keys
en.wikipedia.org/wiki/Ring_signature $\;$
13h
comment Which one these alternatives using authentication and encryption will solve this multiple-user database problem?
@fgrieu : $\;\;\;$ "We can assume that every user $A$ has a private RSA key ..." $\:$ However, by default, this answer is wrong about RSA being deterministic. $\;\;\;\;\;\;\;$
1d
comment Prime factorization
I'm pretty sure the answer is either a prime or a power of two, since those are really easy to factor. $\hspace{.5 in}$
1d
comment Prime factorization
"... in a time less than 5 hours" on what? $\;$
1d
comment Why use randomness in digital signature algorithms?
No. $\:$ In SUF-CMA, the adversary could also succeed by producing an accepted signature-message pair such that the signer did produce that signature, but not for that message. $\:$ Also, in both cases, the adversary could succeed by producing any accepted signature-message pair for a message that the signer did not sign, including if the signer already produced that signature (on one or more different messages). $\;\;\;\;$
1d
comment Why use randomness in digital signature algorithms?
@user3491648 : $\:$ As far as I'm aware, the security arguments for all versions of RSA mentioned on $\hspace{.4 in}$ this page work equally well for both criteria, but SUF-CMA is a stronger criterion than EUF-CMA. $\hspace{.58 in}$
2d
comment what is number of invertible matrix m*m on$ z_n$?
How is this related to cryptography? $\;$
2d
comment Deterministic outputs based on non-connected inputs
No. $\:$ Also, if you want the length of the $o_j$s to not depend on $j$, then you should instead [let the public shared data be an ordered triple whose additional entry is a collision-resistant hash function] and $\hspace{.51 in}$ [let each $o_j$ be PRF(CRHF(j)) rather than PRF(j)]. $\:$ In that case, the "full-domain" part can be dropped. $\hspace{.31 in}$
2d
comment Deterministic outputs based on non-connected inputs
Now the outputs are random-looking to those who don't have the shared data. $\:$ If you want it to look random to those who can deterministically generate them on their own, then you'll need either a random oracle or a more precise definition of what you mean by that. $\;\;\;\;$
2d
comment Deterministic outputs based on non-connected inputs
$o_j = j {}{}\;$
2d
comment Deterministic outputs based on non-connected inputs
The inputs' left half being all zero is a way to make sure that the $\hspace{.04 in}f_j$s are one-way. $\;$
2d
comment How are onetimepads distributed?
The receiver doesn't need the "key before the message is" sent; the receiver only $\hspace{1.45 in}$ needs the key in order to decrypt the message. $\:$
2d
comment Determine encryption method with input and output
"I the password" ? $\;$
2d
comment Why does second pre-image resistance imply pre-image resistance
I gave that example over a year ago. $\;$
2d
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
comment Elliptic curve cryptography G*G
That is the Fixed Pairing Inversion problem. $\;$
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
17
comment What type of encryption is this?
You could try to find what the encryption scheme was (assuming it is encryption). $\;$
Apr
17
comment What type of encryption is this?
Maybe. ${}{}\;$