Reputation
44,914
Next tag badge:
392/400 score
82/80 answers
Badges
1 51 107
Newest
 Nice Answer
Impact
~746k people reached

Feb
10
comment How to design a deliberately weak PRNG for experimentation?
@pg1989: actually, the weaknesses in MT would be far too subtle for an ML to pick up on. It would appear that someone would need to select the biases, and then create a PRNG that deliberately achieves those biases.
Feb
10
answered Determining collision resistance of a function?
Feb
10
comment RSA private key finding method
Maybe she tries the various possibilities of $d$ until she hits one where $(M^e)^d = M$. With these toy parameters, that is eminently doable...
Feb
9
revised OpenSSL & TLS1.2 with aes-cbc and initialization vector
added 426 characters in body
Feb
9
answered OpenSSL & TLS1.2 with aes-cbc and initialization vector
Feb
9
comment Security of a parallelizable block cipher mode
@Melab: so, you're doing 2 Encrypt operations per plaintext block???
Feb
9
comment What are possible caveats when generating a group for use as parameters for Diffie-Hellman key exchange?
Do you really need to convince someone that you haven't deliberately introduced a backdoor? After all, if I am exchanging keys with you, I could easily post our shared keys on facebook, should I choose to. You can't check for that, hence you need to trust that I wouldn't. What I might need to prove is that I haven't accidentally introduced a backdoor, by selecting bad parameters...
Feb
8
comment Permuted Hash Table
Is the transform from $H(a)$ to the index $i'$ deterministic? If so, then someone who sees two values $a, b$ hashing to the same entry in the table can immediately deduce that $H(a) = H(b)$. This implies that if they know what $a$ is, they reduce the number of possible values of $b$ significantly.
Feb
8
comment How to find roots of equation $f(x)=0 \pmod p $, where $p$ is prime number?
@DilipSarwate: I'm not understanding the point you're trying to make; the original equation was over the field $GF(p)$; if it were to have a solution if we modified the equation to be over $GF(p^2)$, I don't see how a solution to that modified equation would be relevant to the original question...
Feb
8
answered AES128 Decryption in Objective-C just slightly off
Feb
8
comment block cipher secure as ind - cpa
We don't care for questions that depend on links to other sites - if the link breaks, the question becomes useless. Instead, you should paste the block cipher into your question.
Feb
8
answered What are possible caveats when generating a group for use as parameters for Diffie-Hellman key exchange?
Feb
7
comment How to find roots of equation $f(x)=0 \pmod p $, where $p$ is prime number?
@DilipSarwate: if the squareroot does not exist (in the prime field), then I believe that the quadratic equation does not have a solution.
Feb
7
comment How to find roots of equation $f(x)=0 \pmod p $, where $p$ is prime number?
@DilipSarwate: actually (assuming $p>2$), the standard quadratic equation, with the squareroot and the division evaluated modulo $p$ should work; no need to bring an extension field into play...
Feb
7
answered Why does a non-prime DH modulus creates a “NOBUS” backdoor
Feb
6
awarded  Enlightened
Feb
6
awarded  Nice Answer
Feb
6
comment Encryption of Real Time UDP packet
How about DTLS (or SRTP, if the traffic you're protecting is RTP)?
Feb
6
comment How to encrypt incomplete block with RSA as a block cipher?
You'd pad it somehow; that is, you fill in some data to extend the 'd' to a full block size. There's no standard way to do this, as we never use RSA this way...
Feb
6
answered Comparison Affine Coordinates and Projective Coordinates Addition in Excel