183 reputation
6
bio website mrgeek.me
location London, United Kingdom
age 23
visits member for 1 year
seen Dec 17 at 12:26

Founder at Mr. Geek

I have an infinite curiosity for knowledge.


Feb
17
awarded  Teacher
Jan
5
comment In this example, which is a premaster secret, and which is a master secret?
Okay, assume I meant premaster-secret and master-secret, are they related to the Diffie Helman in any way, because with just RSA as key exchange, there would be no premaster-secret or master-secret. At least this is what Wikipedia depicts in its hadnshake section, which I believe is using the Diffie Helman as Key exchange. Insight is valued.
Jan
5
comment In this example, which is a premaster secret, and which is a master secret?
I did, didn't get the hang of it. Waiting for my fellow Crypto users to answer.
Jan
5
comment In this example, which is a premaster secret, and which is a master secret?
Thanks for your reply but it doesn't answer my question. I think the master key is probably the 2 that's in the end and the pre-master the numbers 6 and 15, but I am not sure, hence the question was asked to solicit expertise.
Jan
5
revised In this example, which is a premaster secret, and which is a master secret?
edited title
Jan
5
asked In this example, which is a premaster secret, and which is a master secret?
Jan
5
asked At what stage is DHE and RSA used during the SSL/TLS handshake?
Dec
9
awarded  Student
Dec
9
comment How does this happen in RSA malleability?
Makes more sense if Wikipedia said congruent to instead of using the equality operator. I believe you're right.
Dec
8
comment How does this happen in RSA malleability?
I have read up but I am not getting this specific example, can you enlighten me how does this come around. I know what congruence is, it means 594 is in the same equivalence class is 34 w.r.t mod 35.
Dec
8
comment How does this happen in RSA malleability?
It's 34. But we have taken the results of c1 and c2 already, which gives us 594. Why should we mod again? @mikeazo At this stage it's like 594 = 34 which is weird.
Dec
8
comment How does this happen in RSA malleability?
Anyone folks? Anyone who can clarify this.
Dec
8
revised How does this happen in RSA malleability?
added 3 characters in body
Dec
8
revised How does this happen in RSA malleability?
added 318 characters in body
Dec
8
asked How does this happen in RSA malleability?
Dec
8
awarded  Commentator
Dec
8
comment Why are these techniques not feasible to crack RSA?
@AFS: You can calculate phi(n) because N , the modulus is public, remember (N,e). So calculating that would be easy, well for smaller number perhaps ? :)
Dec
7
answered why RSA uses Semiprime numbers?
Dec
7
comment Why are these techniques not feasible to crack RSA?
Made some corrections to the formula. There was some trouble in the denominator. It correctly represents d more accurately.
Dec
7
revised Why are these techniques not feasible to crack RSA?
added 3 characters in body