Reputation
999
Top tag
Next privilege 1,000 Rep.
See votes, expandable usercard
Badges
4 11
Newest
 Yearling
Impact
~13k people reached

Jan
28
revised Understanding the distinguisher for a PRG
deleted 1 character in body
Jan
28
answered Understanding the distinguisher for a PRG
Dec
10
comment Are parts of a pseudorandom string also a pseudorandom string?
@Lemon Yes, you are absolutely on the right track. See also my update.
Dec
10
revised Are parts of a pseudorandom string also a pseudorandom string?
added 1267 characters in body
Dec
9
revised Are parts of a pseudorandom string also a pseudorandom string?
added 304 characters in body
Dec
9
answered Are parts of a pseudorandom string also a pseudorandom string?
Nov
27
comment How to check if a function is significant or not?
@user3193259 Yes it is going to zero. However, it is decreasing very slowly. On your graph it will seem like it is never going towards zero, because for $f(n)$ to be less than, say $1 / 10$, you would need to set $n > 10^{100}$ (with log = base 10)!
Nov
26
comment How to check if a function is significant or not?
@user3193259 The base doesn't matter, it is still going to 0 in the limit (see e.g. here)
Nov
26
comment How to check if a function is significant or not?
@user3193259 You have $f(n) = \frac{1}{\sqrt{\log n}}$ right? This function goes to 0 as $n \rightarrow \infty$. Of course it will never be exactly 0, that is why we are calling it a limit. I know that you were asking about whether it was negligible or not, I just wanted to clarify which function you meant, since you said that it did not tend to 0, which got me confused.
Nov
26
comment How to check if a function is significant or not?
As far as I can tell $f(n)$ do tend towards 0 for $n \rightarrow \infty$. Did you perhaps mean a different function?
Nov
24
revised Key Derivation Function (KDF): Can a key derived from KDF be considered as a secure key?
added 72 characters in body
Nov
24
answered Key Derivation Function (KDF): Can a key derived from KDF be considered as a secure key?
Nov
8
revised Diffie-Hellman using a different modulus on both sides
Converted question to use LaTex formatting. Please let me know if this corresponds to what you had in mind. I am not really sure I understood your last equation, because to me it seems like it was just the same expression on both sides. Is what I wrote now what you had in mind?
Nov
8
suggested approved edit on Diffie-Hellman using a different modulus on both sides
Oct
19
comment What Diffie-Hellman parameters should I use?
I second the recommendation for elliptic curve DH over 2048-bit DH. Maybe you could add this to your answer?
Sep
30
revised How can a Encrypt-And-MAC scheme be insecure if the encryption is CCA secure?
added 575 characters in body
Sep
30
revised How can a Encrypt-And-MAC scheme be insecure if the encryption is CCA secure?
added 2 characters in body
Sep
29
answered How can a Encrypt-And-MAC scheme be insecure if the encryption is CCA secure?
Aug
26
comment Clarification of RFC2246 with regards to Finished Message
Is there a particular reason for why you are using the TLS 1.0 spec and not the TLS 1.2 spec?
Aug
7
comment Are deployed MACs IND-CPA?
And to partially answer your question: Yes, some deployed MACs are also PRFs. Like e.g. HMAC.