657 reputation
311
bio website
location
age
visits member for 3 years
seen Jun 8 at 20:49

Nov
7
asked Are there any bijective one-way functions not based on number-theoretic hardness assumptions?
Aug
3
awarded  Yearling
Jul
24
accepted Is there any weak message for an ECDSA signature?
Jul
22
asked Is there any weak message for an ECDSA signature?
Jul
8
comment Is there a practical zero-knowledge proof for this special discrete log equation?
To clarify: Since the proof must be practical, I can accept a proof in ROM (using Fiat-Shamir heuristic, for example). I could even accept a proof of knowledge that is not zero knowledge. The key is that is must be practical, and secure regarding some standard security assumptions. Thanks.
Mar
11
comment Can one detect if two pairs of elements in Zp have the same exponential relation?
@poncho: Thanks
Mar
11
accepted Can one detect if two pairs of elements in Zp have the same exponential relation?
Mar
11
comment Diffie-Hellman key agreement with both Server Authentication and Perfect Forward Secrecy
Step 4 is ambiguous, as some other steps. IMHO you should write a technical paper and publish it. Even in that case, analyzing a transport protocol is not an easy task, so it's rarely done for free.
Mar
11
comment Diffie-Hellman key agreement with both Server Authentication and Perfect Forward Secrecy
You're leaving out of the description many important details that are relevant to the protocol security, such as how the message length is sent. Is it encrypted? How? Is is sent in clear text? How is padding specified? It's specified by the AE method used or by any other means?
Mar
11
answered Diffie-Hellman key agreement with both Server Authentication and Perfect Forward Secrecy
Mar
11
comment Can one detect if two pairs of elements in Zp have the same exponential relation?
Great pointer! thanks!
Mar
11
comment Can one detect if two pairs of elements in Zp have the same exponential relation?
@poncho: Could you clarify, in your equivalence between my problem and DDH, which is g,a,b and c from x1,x2,y1,y2,k1,k2?
Mar
9
asked Can one detect if two pairs of elements in Zp have the same exponential relation?
Feb
28
awarded  Nice Question
Feb
24
comment Why nobody considers counter re-keying as a standard Block Cipher Mode?
I inserted the word "standard" in the question.
Feb
24
revised Why nobody considers counter re-keying as a standard Block Cipher Mode?
edited title
Feb
23
revised How hard is a known prefix hash preimage attack?
deleted 23 characters in body
Feb
23
asked How hard is a known prefix hash preimage attack?
Feb
22
comment Why nobody considers counter re-keying as a standard Block Cipher Mode?
@CodesInChaos: Great!
Feb
22
accepted Why nobody considers counter re-keying as a standard Block Cipher Mode?