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
|
1h |
comment |
How much data can I encrypt with AES before I need to change the key in CBC mode? This previous question about CBC is similar: crypto.stackexchange.com/questions/2467/… |
|
May 18 |
comment |
What are the potential security impacts of using CRAM-MD5 for Emails, when not using an SSL connection? Downvoter: care to explain? |
|
May 17 |
comment |
What are the potential security impacts of using CRAM-MD5 for Emails, when not using an SSL connection? I can't in good faith comment on CRAM-MD5; I had never even heard of it before you posted your question. A google search for 'CRAM-MD5 vulnerability' returns many examples of potential exploits for the protocol. |
|
May 15 |
comment |
Can I encrypt user input in a way I can't decrypt it for a certain period of time? I had an idea that isn't answer-worthy: Cron jobs on an EC2 instance. Register a new micro instance, make the password a random string so you can't get back in after you log off once. Put the passwords in an python script that sends an email. Put the script in a cron job and log off the instance. It's an ugly hack but it's fairly low-tech. |
|
May 15 |
comment |
How to decipher this morse-like code message? These look like a bunch of emoticons. |
|
May 13 |
comment |
What kind of adversary is the cloud? Yeah but the documents will still be encrypted in the cloud server, so even if the NSA gets them they'll need to break whatever block cipher we use to encrypt them. |
|
May 9 |
comment |
Recommended Books for Cryptography : Theory and Implementation Katz/Lindell is a great intro to the theory side of things. The title is "Introduction to Modern Cryptography". |
|
Aug 17 |
comment |
Is a continuous stream of encrypted data embedded in garbage more or less secure than only encrypting the data? Thanks for the discussion, guys. I don't even mind the downvotes. |
|
May 24 |
comment |
what is the required protocols to make share the key? I'm confused, could you be a little more specific? What kind of key? |
|
Apr 24 |
comment |
Are asymptotic lower bounds relevant to cryptography? You're wrong. P vs NP affects every. single. aspect. of cryptography, in theory and in practice. To deny it is to deny the existence of cryptography as a formal system. |
|
Mar 22 |
comment |
Block ordering and security in a MAC? Most likely a keyed hash function. |
|
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 |
comment |
Why do all hash functions use big-endian data? You're absolutely right, I didn't do my research :) Thanks much. |
|
Mar 18 |
comment |
Are there any signature schemes that protect against collusion by multiple parties? Interesting. Thanks for providing some food for thought. |
|
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 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. |
