meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 6 months |
| seen | 1 hour ago | |
| stats | profile views | 2 |
Math and CS student at IU
|
Mar 20 |
comment |
Block ordering and security in a MAC? Is this problem 4.4b of Katz-Lindell? If so, think about how the authenticating party would verify the MAC. What information would they need? How would they get it? |
|
Mar 20 |
awarded | Commentator |
|
Mar 20 |
accepted | Why do all hash functions use big-endian data? |
|
Mar 20 |
comment |
Why do all hash functions use big-endian data? You're absolutely right, I didn't do my research :) Thanks much. |
|
Mar 18 |
awarded | Scholar |
|
Mar 18 |
comment |
Are there any signature schemes that protect against collusion by multiple parties? Interesting. Thanks for providing some food for thought. |
|
Mar 18 |
accepted | Are there any signature schemes that protect against collusion by multiple parties? |
|
Mar 18 |
asked | Are there any signature schemes that protect against collusion by multiple parties? |
|
Mar 16 |
asked | Why do all hash functions use big-endian data? |
|
Jan 16 |
awarded | Teacher |
|
Dec 12 |
answered | ElGamal: Multiplicative cyclic group and key generation |
|
Dec 10 |
awarded | Student |
|
Dec 9 |
awarded | Editor |
|
Dec 9 |
revised |
Demonstrating the insecurity of an RSA signature encoding scheme added 2 characters in body |
|
Dec 9 |
comment |
Demonstrating the insecurity of an RSA signature encoding scheme Ok how's this: Since padding a binary number with zeros is just multiplication by 2, we can pick any message m of length (9L/10) - 1, prepend a zero, and multiply it by the eth root of (2^(L/10)). Then when verification happens, the exponentiation by e will cancel out the root and shift the message prepended with a zero into the correct configuration for the encoding check to pass. EDIT: oh and I guess you have to take the eth root of 0||m to get arbitrary messages. |
|
Dec 9 |
comment |
Demonstrating the insecurity of an RSA signature encoding scheme Right, sorry... |
|
Dec 9 |
comment |
What is the relation between RSA & Fermat's little theorem? W.r.t the fact that the phi function is multiplicative, there's a neat little proof using the Chinese remainder theorem on the phi function's wikipedia page. |
|
Dec 9 |
comment |
Demonstrating the insecurity of an RSA signature encoding scheme I need to know how to find a forgery on an m not in Q, where Q is the set of queries to the adversary's signing oracle. Is there something dead simple that I'm missing about this? |
|
Dec 9 |
asked | Demonstrating the insecurity of an RSA signature encoding scheme |
|
Dec 6 |
comment |
Generalizing the conversion of Diffie-Hellman to El Gamal Random question: Are you (the OP) a graduate student at IU? Barring some kind of bizarre coincidence, your question is identical to one of my current homework questions, even down to my professor's hint on the problem. |
