Reputation
421
Top tag
Next privilege 500 Rep.
Access review queues
Badges
1 6 8
Newest
 Yearling
Impact
~41k people reached

  • 0 posts edited
  • 0 helpful flags
  • 4 votes cast
Mar
27
awarded  Yearling
Mar
11
comment Are developers expected to implement Diffie-Hellman key exchange themselves?
Thanks, that makes sense. I recently (after hearing from you and SEPJM) found out that TLS is a lot more flexible / extensible than I previously imagined!
Mar
9
comment Are developers expected to implement Diffie-Hellman key exchange themselves?
SEJPM, both of those options sound promising, thanks!
Mar
9
comment Are developers expected to implement Diffie-Hellman key exchange themselves?
otus, where should such a question be asked instead?
Mar
8
comment Are developers expected to implement Diffie-Hellman key exchange themselves?
SEJPM, thanks for the input! I did look at the TLS package, but I'd probably only use SSL/TLS if there are no other options. My main concern here is that I'm implementing something where clients are communicating through an UNtrusted server. Since I'd like to have OTR-like security properties (end-to-end encryption, preservation of forward secrecy even if the server logs all traffic), I'm not sure if TLS alone will be sufficient.
Mar
8
awarded  Editor
Mar
8
revised Are developers expected to implement Diffie-Hellman key exchange themselves?
added 52 characters in body
Mar
8
asked Are developers expected to implement Diffie-Hellman key exchange themselves?
Nov
25
awarded  Notable Question
Jun
1
awarded  Good Question
Nov
10
awarded  Taxonomist
Sep
29
awarded  Famous Question
Sep
14
awarded  Popular Question
Dec
5
awarded  Nice Question
Sep
25
awarded  Yearling
Sep
15
awarded  Nice Question
Sep
2
awarded  Notable Question
Mar
24
awarded  Popular Question
Jul
14
comment What are the practical differences between 256-bit, 192-bit, and 128-bit AES encryption?
You would use AES 256 to protect against quantum brute force attacks; Grover's algorithm speeds up a brute force attack by the square root of n (see en.wikipedia.org/wiki/Grover's_algorithm)
Jul
14
comment Taking advantage of one-time pad key reuse?
This picture illustrates things beautifully. I guess the spirit of my question was "how would you actually do the statistical analysis once you have $m_1 \oplus m_2$"; a respectable cryptographer would probably say something like "that's trivial".