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

Apr
24
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}$
Apr
24
comment Prime factorization
"... in a time less than 5 hours" on what? $\;$
Apr
24
revised Encryption of plain text using stream cipher algorithm
improved grammar
Apr
24
answered What is the signifcance of inside threat in “How to Construct Multicast Cryptosystems … Secure Against CCA2”
Apr
24
answered Swap $x$ and $k$ in GGM construction
Apr
23
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). $\;\;\;\;$
Apr
23
revised Generating interactive, secure multiple ECC key pairs deterministically
fixed typo in title
Apr
23
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}$
Apr
23
comment what is number of invertible matrix m*m on$ z_n$?
How is this related to cryptography? $\;$
Apr
23
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}$
Apr
23
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. $\;\;\;\;$
Apr
23
revised Deterministic outputs based on non-connected inputs
addressed the OP's comment
Apr
23
comment Deterministic outputs based on non-connected inputs
$o_j = j {}{}\;$
Apr
23
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. $\;$
Apr
23
answered Deterministic outputs based on non-connected inputs
Apr
23
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. $\:$
Apr
23
comment Determine encryption method with input and output
"I the password" ? $\;$
Apr
23
revised Determine encryption method with input and output
improved grammar and changed spacing
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. $\;$