Comment on IBM releases first-ever 1,000-qubit quantum chip
cyd@lemmy.world 7 months agoHash functions are not known to be quantum vulnerable (i.e., there’s no known quantum algorithm that provides an exponential speedup, best you can do is to use Grover’s algorithm to slightly speed up the brute force search). So maybe never.
threelonmusketeers@sh.itjust.works 7 months ago
So why don’t we use these functions for regular encryption? Or do we?
hansl@lemmy.world 7 months ago
They’re one way functions. Encryption requires decryption, so you cannot lose information.
Hash functions are meant to lose information. They cannot be reversed. What they’re good at is verification; do you have the right password? Do you have a proof that this is your message and not someone else’s?
We already use hash functions where they make sense, but the parent is not entirely right; not all hashes and signatures are equals. Some are very quantum susceptible. Those will likely be broken real soon (think years, not decades). Some are quantum resistant.
threelonmusketeers@sh.itjust.works 7 months ago
Thanks for the explanation!
Kushan@lemmy.world 7 months ago
Hashing is “one way” and produces a fixed length output. It’s useful for things like knowing if data has been modified or in the case of passwords, it’s a way to store a value that lets you check a password is correct without storing the password itself.
You cannot “reverse” a hash by design.
Encryption is reversible, you need to be able to get the original data back.
We do use both together in various ways, wtf encrypt data to protect it and then hash the data to make sure it hasn’t been modified. They go hand in hand.
threelonmusketeers@sh.itjust.works 7 months ago
Thanks for the explanation!