Reputation
4,388
Next tag badge:
45/100 score
28/20 answers
Badges
1 6 21
Newest
 Yearling
Impact
~43k people reached

Apr
28
comment Looking for encryption algorithm not subject to known-plaintext attack with IV reuse
No; they're supposed to output some (random) output in the same format. $\:$ If "he doesn't have a format" then this doesn't help. $\:$ (The OP's formats are string lengths.) $\:$ This doesn't "prevent the standard known-plaintext attacks which are mitiagated by an IV", since his setting provably does not allow preventing them. $\:$ However, it does prevent all other known-plaintext attacks. $\;\;\;\;$
Apr
28
answered Looking for encryption algorithm not subject to known-plaintext attack with IV reuse
Apr
28
comment Is a padding oracle attack possible if data is only encrypted internally on a server (e.g. for storage)?
How is "the data" "displayed in the client / web site" when there is no attack? $\hspace{1.7 in}$
Apr
26
comment Rabin-Williams, blinding and size of Integer r?
I have no clue. $\;$
Apr
26
comment Rabin-Williams, blinding and size of Integer r?
Using "the size of the modulus" will make m*r (mod N) be approximately uniformly distributed. $\hspace{.83 in}$
Apr
26
answered Password length versus hash length?
Apr
26
comment Adding two public keys
Your upper paragraph does squarely address the question. $\:$ I was just wondering if your lower paragraph was more related to the question than it seemed. $\;\;\;\;$
Apr
26
comment Adding two public keys
Do you know of any threshold signature schemes that are not discrete-log based but have better-than-generic performance for combining already-existing verification keys? $\;$
Apr
25
comment Image sharing without data overhead
crypto.stackexchange.com/q/17742/991 $\;$
Apr
25
comment Asymmetric cipher with multiple public keys
en.wikipedia.org/wiki/Ring_signature $\;$
Apr
24
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. $\;\;\;\;\;\;\;$
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? $\;$