3 reputation
1
bio website
location
age
visits member for 10 months
seen Nov 16 '13 at 1:58

Nov
14
comment modfied man in the middle attack diffie hellman
Well if I'm asked to prove that the key size is of size m, then g^aq mod (mq) must take on m values. I'm really not sure how to show this though. Although I do want to learn and have looked through some material on the chinese remainder theorem, I'm lost.
Nov
13
comment modfied man in the middle attack diffie hellman
My assumption is that it takes on the smaller of the two, since that would give me that aq mod(qm) takes on m values, which is what I require. Thanks so much for the help :).
Nov
13
comment modfied man in the middle attack diffie hellman
aq mod m should only be able to take on m values correct? The Chinese remainder theorem talks about solving a system of equations. I seem to be missing why its applicable here.
Nov
13
comment modfied man in the middle attack diffie hellman
That second part was what I've come up with so far. But I have no idea how to show that aq mod p can actually only take on m values. Shouldn't it be able to take on a mod p values?
Nov
12
asked modfied man in the middle attack diffie hellman
Nov
12
awarded  Scholar
Nov
12
accepted Why is appending the key to a mesage and then hashing that insecure if the hash isn't weakly collision resistant?
Nov
12
comment Why is appending the key to a mesage and then hashing that insecure if the hash isn't weakly collision resistant?
Yes, I am indeed asking the same thing. However, I just wanted to make sure I'm correct in my understanding of what is mentioned there.
Nov
11
asked Why is appending the key to a mesage and then hashing that insecure if the hash isn't weakly collision resistant?