26,223 reputation
11947
bio website
location
age
visits member for 2 years, 8 months
seen 11 mins ago

Oct
8
comment How do TLS 1.1 and 1.2 generate IVs (initialization vectors) for each record?
Thomas, I almost always agree with you, but I have no idea why you say "it is unclear whether the third method is safe" (presumbly using the last block of the previous record as the IV; obviously using a fixed IV has issues). It does assume that $E$ "acts as a PRNG", however CBC mode encryption itself essentially makes that assumption, so it seems like a safe assumption. It does leak an additional plaintext/ciphertext pair from the code-book for each message; given that the CBC-mode encryption of a known/guessable N block message already leaks N such pairs, leaking another is not intolerable
Oct
7
revised Is prime regeneration necessary for every new session using a Diffie-Hellman key exchange?
English tweaks
Oct
7
comment Relationship between Elliptic Curve Discrete Log, Integer Discrete Log, and Integer Factorization
@Faith: the mapping is known as 'Weil Descent'; I can't find any good references for the mapping itself; I do see a number of papers talking how it can be used to attack DH problems in various specific Elliptic Curves, such as lab.iisec.ac.jp/~arita/pdf/acrypFinal.pdf
Oct
7
reviewed Approve suggested edit on onion-routing tag wiki
Oct
7
reviewed Approve suggested edit on onion-routing tag wiki excerpt
Oct
7
reviewed Approve suggested edit on poly1305 tag wiki
Oct
7
reviewed Approve suggested edit on poly1305 tag wiki excerpt
Oct
7
answered Is prime regeneration necessary for every new session using a Diffie-Hellman key exchange?
Oct
7
answered Why initialize SHA1 with specific buffer?
Oct
7
comment Is prime regeneration necessary for every new session using a Diffie-Hellman key exchange?
I'm not sure why 'it's a really big number' isn't a sufficient justification. Exercise: estimate plausible values of P and N; compute the expected number of attempts $\frac{P-1}{N}$; compare that to the plausible amount of computing power any attacker may be expected to have. Extra credit: compare the probability of success with, say, someone winning the lottery 10 times in a row...
Oct
6
reviewed Approve suggested edit on functional-encryption tag wiki
Oct
6
reviewed Approve suggested edit on functional-encryption tag wiki excerpt
Oct
6
reviewed Approve suggested edit on dual-ec-drgb tag wiki excerpt
Oct
6
reviewed Approve suggested edit on dual-ec-drgb tag wiki
Oct
4
reviewed Approve suggested edit on adversarial-model tag wiki excerpt
Oct
4
reviewed Approve suggested edit on negligible tag wiki
Oct
4
reviewed Approve suggested edit on adversarial-model tag wiki
Oct
4
reviewed Approve suggested edit on distinguisher tag wiki
Oct
4
reviewed Approve suggested edit on negligible tag wiki excerpt
Oct
4
reviewed Approve suggested edit on distinguisher tag wiki excerpt