Cryptography Matthew Green on RSA's backdoored BSAFE TLS library |
- Matthew Green on RSA's backdoored BSAFE TLS library
- How does quantum key distribution work?
- What do you think is the most secure veracrypt algorithm?
- A hopefully brief question about 2 FA back up codes
- Undergraduate research opportunities?
- Elliptic Curve Cryptography Visualization
- In AES-128 in CBC mode, should the ciphertext output after each "round" have a length that is 16 bytes?
| Matthew Green on RSA's backdoored BSAFE TLS library Posted: 18 Dec 2017 04:15 PM PST |
| How does quantum key distribution work? Posted: 19 Dec 2017 02:17 AM PST What are the methodologies to distribute quantum keys? [link] [comments]  |
| What do you think is the most secure veracrypt algorithm? Posted: 19 Dec 2017 02:01 AM PST I'm curious to see what everyone thinks is the most secure algorithm currently implemented in Veracrypt. At first glance i'd assume one of the cascading-cypher modes, but then again, no cryptanalysis exists for twofish, but it is possible a cascading cypher could undo itself, so to speak. [link] [comments]  |
| A hopefully brief question about 2 FA back up codes Posted: 18 Dec 2017 09:01 PM PST So I want thinking about how 2 fa works and a lot 2 fa systems have back up codes, and well doesn't that defeat the point? I mean they are precomputed hash seeds right? So doesn't that kind of make 2fa moot? am i missing something? Like i get the concept of timing base 2 fa stream cipher linked to an account but i am not sure how that can mesh with back up code with ut there being a massive security hole. [link] [comments]  |
| Undergraduate research opportunities? Posted: 18 Dec 2017 08:01 PM PST I'm a fourth year undergraduate math student, with one extra semester to finish up next fall. Does anyone know of any good summer research opportunities related to crypto? A bit of background:
For what it's worth, I'm located in Canada, but I'd really like to travel, so location isn't an issue for me. If I could score something in Europe that would be awesome. I'm open to stuff in academia or industry. Let me know if there's any more info I can supply. If anyone has any suggestions I'd be very grateful. [link] [comments]  |
| Elliptic Curve Cryptography Visualization Posted: 18 Dec 2017 02:22 AM PST |
| Posted: 18 Dec 2017 05:21 PM PST I'm currently working on the cryptopals challenges and am conflicted/stuck on challenge 10. I know that in CBC mode, prior to encryption, each block of plaintext is XORed with the CT of the previous block, the first block being the exception where it is instead XORed with a 16 byte IV. The trouble I'm running into is with the XORing of each block of plaintext with the ciphertext of the previous block. The issue is that after the first block, I'm left with a block of ciphertext that is not 16 bytes in length, regardless of the encoding scheme. This means that all future XORs will be like repeating key XORs which I don't think is correct. I think it should be a fixed XOR of two strings of the same length (at least that's what I got from the challenge). I'm a bit confused though because the challenge says to implement CBC by taking our ECB code, making it encrypt, the using our XOR code from a previous exercise to combine things. My question then is, is there an error (likely) in my first block encryption or will I need to do some padding (unlikely)? Basically, should my encryption function always output a ciphertext block of size 16 bytes, or will I need to pad the plaintext to the ciphertext block length from the previous block? [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