Cryptography Things that use Ed25519 (Updated: January 23, 2019). |
- Things that use Ed25519 (Updated: January 23, 2019).
- Cracking a KeePass Database Using Multiple Versions of KDB File?
- Trust Models for Secure Network Connections - DZone Security
- How do people encrypt a plain text of 0 when using RSA encryption
- Pros and Cons
- Mathematical hints for a public key brute force problem
- What hash function should I use, for small inputs (fit in 1-2 blocks of 512) if I want a 196 bit hash that costs about storage of 2^95 of them before finding a collision?
| Things that use Ed25519 (Updated: January 23, 2019). Posted: 05 Feb 2019 02:35 AM PST |
| Cracking a KeePass Database Using Multiple Versions of KDB File? Posted: 04 Feb 2019 01:15 PM PST Hi guys, I have some concerns about a hypothetical attack on a KeePass database, and I wanted to check with this sub to see if those concerns are valid. Hypothetically, let's say that I have a KeePass database. It has dozens of password entries stored in it. It is encrypted with AES, using a master password and a key file. Every so often, after I make some changes to the database or add new entries, I'll back up the database file to a cloud service (but not the key file of course, as that must be kept secure). So my question is this: could an attacker decrypt the database by analyzing a collection of different versions of the database? If they were to acquire over a dozen different versions of the database, which use the same password and key file, is it possible (and practical) to do some sort of cryptographic analysis on the files collectively? I'm asking because I want to make sure that my backups will not collectively become a security vulnerability. [link] [comments]  |
| Trust Models for Secure Network Connections - DZone Security Posted: 05 Feb 2019 02:09 AM PST |
| How do people encrypt a plain text of 0 when using RSA encryption Posted: 04 Feb 2019 10:20 AM PST As the title suggests, I understand the basics of RSA encryption and why when you use 0 as the plain text it does not work. My questions is how is this handled in the real world? Thanks! [link] [comments]  |
| Posted: 04 Feb 2019 03:21 PM PST Can anyone help me with figuring out the best cryptography program? Im looking to compare Veracrypt, Axcrypt, 7-zip and gnu privacy guard. I cant decide. [link] [comments]  |
| Mathematical hints for a public key brute force problem Posted: 04 Feb 2019 07:34 AM PST Charlie has intercepted Alice and Bob public key exchange (Diffie-Hellman). He now wants to crack it by brute force, using parallelization. But Charlie is not so clever and is making some tricky mistakes. This article analyzes some of Charlie naive mistakes and gives some mathematical hints about. https://fedetask.com/brute-force-craking-public-key/ This post doesn't want to give any important insight, but rather analyze some common mistakes that people do when dealing with resource expensive computations [link] [comments]  |
| Posted: 04 Feb 2019 06:58 AM PST I'm considering using the first 96 and last 96 bits of sha2-512. Is there a faster (on cpu) andOr more secure way? When you add or xor a pseudorandom number into a state, you lose about 1 bit. So if theres a loop size 64 in sha2-256, its losing at least about 64 bits of its 256 bit state, and thats only if its a strong pseudorandom per iteration. It may be losing more. So even though sha2-256 has a 256 bit output, if you only gave it a random 2 ^ 256 inputs you'd probably get much less than that possible outputs. I'm skeptical that 192 bits of sha2-256 would solve my problem. Though I havent looked deep into it. EDIT: sha2-512 takes 1024 bit chunks [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