this post was submitted on 19 Jun 2024
110 points (99.1% liked)

Privacy

31859 readers
151 users here now

A place to discuss privacy and freedom in the digital world.

Privacy has become a very important issue in modern society, with companies and governments constantly abusing their power, more and more people are waking up to the importance of digital privacy.

In this community everyone is welcome to post links and discuss topics related to privacy.

Some Rules

Related communities

Chat rooms

much thanks to @gary_host_laptop for the logo design :)

founded 5 years ago
MODERATORS
 

This is really good for encrypted content such as a hard drive, password vault or gpg key

you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 4 points 4 months ago (1 children)

I also think encryption password security depends heavily on the hash. A hash that's takes along time to break will be more secure and will require a shorter password to be secure

[–] [email protected] 3 points 4 months ago (2 children)

Yeah, that is what I meant by "strength of the hash". Probably should have been more clear. Basically the amount of resources it takes to calculate the hash will have to be spent by the attacker for each guess they make. So if it takes 1s and 100MiB of RAM to decrypt your disk it will take the attacker roughly 1s and 100MiB of RAM for each guess. (Of course CPUs will get faster and RAM will get cheaper, but you can make conservative estimates for how long you need your password to be secure.)

[–] [email protected] 1 points 3 months ago* (last edited 3 months ago)

Parallelism 1, iterations 15, memory 512mb

New status unlocked! LUNATIC

[–] [email protected] 1 points 4 months ago (1 children)

Keep in mind they will be using GPUs with lots of ram and cores so that 1s will be more like hundreds or thousands a second.

[–] [email protected] 2 points 4 months ago

It depends a lot on the hash functions. Lots of hashes are believed to be difficult to parallelize on GPUs and memory hard hash functions have different scaling properties. But even then you need to assume that an adversary has lots of computing power and a decent amount of time. These can all be estimated then you give yourself a wide margin.