Cryptography Does knowing an substring of encrypted text make decryption easier? |
- Does knowing an substring of encrypted text make decryption easier?
- Strong two factor authentication?
- Pure Go implementation of the Ristretto prime-order group built from Edwards25519
- Input encoding for Ripemd160 / MD4
| Does knowing an substring of encrypted text make decryption easier? Posted: 04 Jun 2018 10:04 AM PDT I recently watched The Imitation Game. In it (and I'm assuming it was reasonably accurate to the true story) the Turing machine could not try every configuration of enigma in a useful amount of time. The Germans changed the code every day and the Turing machine was taking longer than a day to go through all the combinations. The breakthrough was when Turing realized he didn't need to try every configuration. They knew when the Germans gave a weather report, and they also knew every message would include "Heil Hitler." So they just needed to wait for the Germans to release the weather report in the morning. Then, the Turing machine didn't need to try every configuration. It just needed to try the configurations that included keywords related to the weather and "Heil Hitler." Does this apply to modern encryption methods? And, if not, how do modern encryption algorithms patch this weakness? As an example, I use the KeePass password manager. KeePass doesn't just encrypt the passwords in it. It also encrypts the usernames, notes, etc. My email address is used many times throughout my KeePass file because it is the username to most of my accounts. So, would a potential hacker have an easier time decrypting my KeePass file if they knew my email address? Edit: fixed formatting [link] [comments]  |
| Strong two factor authentication? Posted: 05 Jun 2018 12:38 AM PDT The way modern 2FA works is that you have a shared secret that is used to generate random codes based on the current time. This protects against people guessing your password, but it doesn't protect against employees simply stealing the data. Is there a form of 2FA code that changes every 30 seconds that is an absolute cryptographic requirement in order to access the data? [link] [comments]  |
| Pure Go implementation of the Ristretto prime-order group built from Edwards25519 Posted: 04 Jun 2018 02:13 AM PDT |
| Input encoding for Ripemd160 / MD4 Posted: 04 Jun 2018 06:22 AM PDT Hi all, I am implementing Ripemd160 currently in plain javascript, because the existing implementations do not fully meet my requirements (e.g. accept hex input instead of utf8 characters only). However, the results I get (for an empty string in my case) do not match the expected results and I verified that my implementation of the algorithm itself is correct (as far as I were able to verify it). Now the point where I guess my mistake to be is the encoding of the input for the algorithm which seems to be the exact same encoding as it is for MD4 (512 bit blocks, divided in 16 32-bit words). So I followed the format in The RFC of MD4, chapter 3, to correctly encode an empty input (which is just nothing if I understand correctly). So in my opinion I have to start with a single '1', then only zeroes to fill up to 448 bits, and finally the 64 bits for the message length (which is zero). So I end up with The first '8' is because of the first bit needs to be a '1' to signal that the padding begins, so the first byte would be '10000000', or 80 in hex. Is that the correct input for an empty string? If not, what is the correct input instead? Or is the empty string represented by a NUL byte? Thanks a lot in advance [link] [comments]  |
| You are subscribed to email updates from Cryptography news and discussions. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States | |
No comments:
Post a Comment