News for hackers. Stuff that matters.
Re:The first chosen-prefix collision for SHA-1 by baddox on Tuesday January 07, 2020 @01:47PM (#21983176)
> Hard to justify going to the trouble of encrypting your backup. 10 years from now, it might be as good as plain text.

When has that happened? Public key cryptography and symmetric key cryptography are still doing fine as far as I'm aware, and the latter doesn't even seem to be vulnerable to quantum computing.

Moreover, SHA-1 has been considered insecure for, what, at least 10 years? The fact that a cryptographic hash function has been widely considered insecure and widely recommended for deprecation a decade before a proof of concept even emerges is, to me, something to feel very good about.

Re:The first chosen-prefix collision for SHA-1 by rakoo on Tuesday January 07, 2020 @02:28PM (#21983714)
"Public/symmetric key cryptography" is just the name of the practice, of course it's doing fine. What's not doing fine is picking a particular set of ciphers/hash functions/signature scheme and expecting to not fail in 40 years.
Re:The first chosen-prefix collision for SHA-1 by xoa on Tuesday January 07, 2020 @04:07PM (#21984862)
Incorrect, particular sets of ciphers are themselves doing just fine. There is no hint of well studied symmetric-key algorithms (like AES, which is in fact now over 20 years old) with long known sufficient key lengths "failing" (in terms of cold ciphertext being cracked) in 40 years, or 400 years for that matter. Even with a fully scalable general quantum computer, the best known improvement is Grover's Algorithm, which results in roughly a quadratic improvement (so a 128-bit key cracked in 2^64 iterations, 256-bit in 2^128, etc). This obviously is trivially defeated by doubling the key length, and AES-256 has been available from the beginning and has been becoming more standard for a while as well.

Now, there are various kinds of hot attacks, such as side channel leaks, that always present a serious challenge in many threat scenarios. And it's certainly possible to have bad implementations of a solid algorithm. But for AES implementations are very mature, and side channel attacks do not apply to data at rest. So in the context of "will my encrypted ciphertext with all my deepest secrets [sitting on a drive/in the cloud/wherever] be crackable in 40 years" no, symmetric-key crypto with 256-bit keys is dependable at this point.

A false sense of defeatism is itself plenty dangerous to security.

Re:The first chosen-prefix collision for SHA-1 by ReidZB on Tuesday January 07, 2020 @04:55PM (#21985390)
DES is a good example here: it was designed ~45 years ago and it's still theoretically surprisingly strong when you compare it with other areas of cryptography. By that, I mean it's held up very well to cryptanalysis that attempts to find faster-than-brute-force techniques, with the best attack taking 2^43 time (vs. the 2^56 brute-force time).

To be clear, 2^56 is trivially brute-force-able today, but that can be mitigated with constructs like 3DES, which are still (barely) secure despite being based on a 45-year-old cipher.

(So no one mistakes my intent, there are many reasons to prefer AES over DES. I just wanted to provide it as an example, especially since it happened to line up with the 40-year timeframe.)

Re:The first chosen-prefix collision for SHA-1 by zwp on Tuesday January 07, 2020 @07:47PM (#21987051)
> 2^56 is trivially brute-force-able today

Youch, this broke my intuition.

https://crack.sh/

"we’ve built a system with 48 Virtex-6 LX240Ts which can exhaust the keyspace in around 26 hours"

Re:The first chosen-prefix collision for SHA-1 by tgsovlerkhgsel on Tuesday January 07, 2020 @08:24PM (#21987298)
> trivially

Having to rent thousands of dollars in GPU-hours or using specialized hardware doesn't sound "trivial" to me. Practical, yes. Accessible even to a layman with money to spare, yes. Trivial? Hell no.

Re:The first chosen-prefix collision for SHA-1 by userbinator on Tuesday January 07, 2020 @11:00PM (#21988171)
It's funny to see how different the various people here have on the definition of "trivial". 10 years ago, I generated MD5 collisions in a few minutes with a tiny little executable I downloaded. That's what I call trivial.

If I had some DES-encrypted files that I'd lost the key to, and they were important enough that I needed their contents, I would probably be happy that I could crack the key today and recover them if I spent enough, but doing so would still not be "trivial".

Re:The first chosen-prefix collision for SHA-1 by ReidZB on Wednesday January 08, 2020 @12:49AM (#21988707)
Oh, sure, maybe trivial isn't the best word for it, but it's all relative (to me). $20k is remarkably cheap for a practical cryptographic attack compared to the rest of the field, and there's plenty of software to do it, and it's been done before (many times).

Apparently there's even a SaaS offering to do it for you in some cases (for staggeringly cheap, like $300), but I had no idea that existed when I wrote my comment.

Re:The first chosen-prefix collision for SHA-1 by xmprt on Tuesday January 07, 2020 @02:36PM (#21983828)
Encrypting is still better than not encrypting and if you care about keeping your data private then you can take additional measures to ensure that. Nothing will last forever but that's not a good reason to be nihilistic.
Re:The first chosen-prefix collision for SHA-1 by mattr47 on Tuesday January 07, 2020 @04:04PM (#21984826)
It's like locking my front door. I chose to lock the door to prevent random acts of burglary. But that lock will not stop someone determined from BnE my house.
Re:The first chosen-prefix collision for SHA-1 by gowld on Tuesday January 07, 2020 @05:51PM (#21986056)
DES Encryption will stop someone from BnE your data.

They might BnE your key though, if you aren't careful enough.

Re:The first chosen-prefix collision for SHA-1 by wbl on Tuesday January 07, 2020 @05:39PM (#21985914)
Triple DES remains as secure today as in 1975.