17,765 reputation
32063
bio website
location
age
visits member for 2 years, 8 months
seen 8 hours ago

Mar
19
comment Zero Knowledge Proof for Correctness of the product of additive ElGamal Ciphers
I encourage you to put in a bit more effort on formatting the question to be easily readable. Did you know you can use Latex (Mathjax) on this site? See the help center for more.
Mar
19
reviewed Approve suggested edit on Zero Knowledge Proof for Correctness of the product of additive ElGamal Ciphers
Mar
19
revised Entropy when iterating cryptographic hash functions
incorporate comments from fgrieu
Mar
19
comment Entropy when iterating cryptographic hash functions
@fgrieu, great point! For large enough $i$, this formula certainly becomes inaccurate. For instance, when $i \ge 2^{n/2}$, it is likely that the entropy will be about $n/2$ bits, and after a certain point it won't get any smaller no matter how much you increase $i$ (because typically when iterating a large random function, there is a single large cycle of length about $2^{n/2}$ that most inputs feed into). Thank you!
Mar
18
comment Subexponential algorithms for DLP in $\mathbb{Z}_s \times \mathbb{Z}_t$
JasonJones, yup! It does suggest that the DLP is easier to solve than in the corresponding elliptic curve. It does suggest that the DLP can be solved faster than exponential time. The faulty premise is in assuming this means it is claiming that the DLP can be solved in sub-exponential time, e.g., in $L_n[\alpha,c]$ time.
Mar
18
comment Meet in the middle attack - message and key
Read about known-plaintext attacks.
Mar
18
answered Entropy when iterating cryptographic hash functions
Mar
18
comment Subexponential algorithms for DLP in $\mathbb{Z}_s \times \mathbb{Z}_t$
This question starts from a faulty premise. The accepted answer you link to does not suggest that there are subexponential algorithms for solving DLP in $\mathbb{Z}_s \times \mathbb{Z}_t$. (In fact I don't even see the word subexponential in that answer.)
Mar
18
revised Subexponential algorithms for DLP in $\mathbb{Z}_s \times \mathbb{Z}_t$
Add elaboration from my comment.
Mar
18
comment Are there hash algorithms with variable length output?
@curious, again, ask a new, separate question -- and make sure to follow best practices before doing so (e.g., searching to make sure it hasn't been answered before). This is not a discussion forum. One question per question. I'm not going to answer any new questions posed in the comment threads.
Mar
18
comment Are there hash algorithms with variable length output?
@curious, that's a different question, which is probably best answered separatately, but the concise answer is: treat the output of SHA256(m) as a 256-bit integer, reduce it modulo 360, and use the remainder a syour random number.
Mar
17
answered counter to indicate hotp count
Mar
17
answered Why do we apply the concept of circuit in homomorphic encryption schemes?
Mar
16
comment What functions allow for practical indistinguishability obfuscation?
Thanks, @xagawa! On log-size circuits: What is the log of? i.e., log of which parameter? (presumably not the size of the input to the circuit) For normal forms: are there known classes of circuits that have a normal form? I know that BDDs can be put into normal form. That's all I know but I'm guessing probably more is known....
Mar
16
comment How can I create an RSA modulus for which no one knows the factors?
Yes, but the algorithms are not practical for reasonable-sized RSA modulus. I'm pretty sure this has been asked before on this site but I can't seem to find where...
Mar
14
asked What functions allow for practical indistinguishability obfuscation?
Mar
14
comment How to best mix two arbitrary/random n-bit words?
@Mok-KongShen, it would have been better if you had listed those requirements in the question. This is related to why poncho told you your question was too broad/ill-defined. Generally speaking, we tend not to like chameleon questions where someone asks a broad question without listing the requirements, then when they get an answer that answers the question-as-stated, they respond by saying "oh, that wasn't really what I was looking for, I actually had this extra requirement/goal/criterion I didn't tell you about". You can avoid that by asking narrower questions that include all the criteria.
Mar
14
asked Obfuscating point-like functions
Mar
14
comment Is this a pseudo random function (PRF)? F(k,x) = f(k,x) - f(k,x-1)
@Seth, thank you! I have fixed the error you pointed out. (I had miscounted the number of queries made by my distinguishing algorithm. I've revised my answer; should be fixed now.)
Mar
14
revised Is this a pseudo random function (PRF)? F(k,x) = f(k,x) - f(k,x-1)
Address bug from @Seth.