LUKS/Advanced: Difference between revisions
move Disk Setup to intermediate |
|||
| Line 49: | Line 49: | ||
<code>argon2i 4 iterations, 735656 memory, 4 parallel threads (CPUs) for 256-bit key (requested 2000 ms time)</code> | <code>argon2i 4 iterations, 735656 memory, 4 parallel threads (CPUs) for 256-bit key (requested 2000 ms time)</code> | ||
<code>argon2id 4 iterations, 842046 memory, 4 parallel threads (CPUs) for 256-bit key (requested 2000 ms time)</code> | <code>argon2id 4 iterations, 842046 memory, 4 parallel threads (CPUs) for 256-bit key (requested 2000 ms time)</code> | ||
<code> Algorithm | Key | Encryption | Decryption</code> | <code> Algorithm | Key | Encryption | Decryption</code> | ||
<code> aes-cbc 128b 594.1 MiB/s 1434.3 MiB/s</code> | <code> aes-cbc 128b 594.1 MiB/s 1434.3 MiB/s</code> | ||
<code> serpent-cbc 128b 59.8 MiB/s 371.1 MiB/s</code> | <code> serpent-cbc 128b 59.8 MiB/s 371.1 MiB/s</code> | ||
Latest revision as of 01:29, 1 July 2026
This is an Advanced complexity guide. All versions:
For more more info on this topic, check the cryptsetup FAQ, the Arch Wiki.
Guide to Decent LUKS Security on Linux
The Intermediate Guide gives a high level overview of what different LUKS options can do, but this page intends to go into as much detail as possible about them while still aiming to be easy to understand. If you just want to know the "best" command to run, you can skip to the bottom. But reading this Guide is encouraged, as it will give you a better understand of what the options do, and how they will affect the security of your data!
Ciphers
Ciphers are the algorithms used to encrypt data. Picking the best algorithm is very important for ensuring your data is secure. If your cipher can be broken, then your data can be accessed without the key.
Of the widely supported options, the two most worth considering are Serpent and AES.
Twofish may be better in lower-security applications where there's no AES acceleration and writes happen more often than reads, but generally, not a great option.
Serpent may theoretically be more secure, though in practice its potential advantages seem pretty minimal. It also hasn't been tested as much as AES, so it may have potential vulnerabilities not yet known about .
Another consideration is the actual implementation. Serpent has potential vulnerabilities depending on the details of the implementation. Without looking into the specific implementation in-depth, it's hard to say how secure it is.
On the other hand, having hardware acceleration for AES has a number of advantages for security, most notably resistance to side-channel attacks, but of course also speed. Some CPUs however, usually CPUs that aren't x86 based, do not have hardware accelerated AES. While it's theoretically possible that your CPU may have a vulnerability, as far as we are aware, no vulnerabilities have been reported on any present or past chip with AES support. Make sure your microcode is up to date! Practically speaking, the advantages of having hardware accelerated AES make it more secure than using Serpent in nearly all cases.
On-disk Format
The on-disk format defines how the encrypted data is stored on the disk itself . While you could just write the encrypted blocks directly to the disk , you would be at risk of a number of different attacks. CBC is an older on-disk format and should not really be used. It has malleability vulnerabilities, and also, specially-crafted files can be fingerprinted. XTS is better at mitigating these issues, so it's the recommended default. It's also hardware accelerated on modern x86 CPUs. If your CPU does not have hardware accelerated AES and XTS, you may want to use CBC, for better speeds.
Initialization Vectors ( IV )
The purpose of IV is to add some randomness different blocks of the disk, so that overall patterns cannot be discovered. ESSIV was previously set as default for CBC to mitigate the fingerprinting issue, but this does not help CBC's issues with malleability. Since XTS has been used, plain64 has been the default. Since XTS is not vulnerable to fingerprinting, it does not need the added overhead of ESSIV.
Password Hashing
The hashing algorithm is intended to make weak passwords harder to break , so a very good password does not really need much hashing. Since it's hard to make ( and remember ) a very secure password, it's still a good idea to hash your password.
The best option is generally Argon2, since it is optimized to be impossible to brute-force on devices with limited memory, like GPUs. The point is to force the attacker to use their CPU, which is not usually not nearly as quick as a GPU for this kind of task. Unless you're primarily concerned about some APT trying to decrypt your data, it is a pretty good tradeoff.
Argon2 has a few different variants. Argon2i is weakest to brute-forcing, but has strong side-channel protection. It's generally not safe to use 2i with anything less than 10 iterations. Similarly, while Argon2d is most secure against brute-force attacks, it is more susceptible to side-channel timing attacks than Argon2id . Unless you are really not concerned about side-channel attacks , Argon2id is the most well rounded and therefore the best choice.
If your device is very memory constrained (like under 4GB), you may want to consider using PBKDF2 instead. You will want to increase the iteration time as high as you can tolerate, as it is far weaker to GPU brute-forcing.
Iteration Time
This defines how long your computer is going to spend hashing the password. More iteration is better, and it's just a question of how long you are willing to spend waiting for your computer to has your password. If your password is very insecure though, a long has will not slow down an attacker much. 2 seconds ( 2000ms ) is the recommended default. Make sure your computer is not set to any "low-power mode" when setting up the disk, as this will affect the time it takes to hash.
See the Password Guide for more information about making a secure password.
Benchmarking
If you want to see for yourself how fast these various algorithms will run on your computer, you can use cryptsetup benchmark.
# Tests are approximate using memory only (no storage IO).PBKDF2-sha1 1736052 iterations per second for 256-bit keyPBKDF2-sha256 3355443 iterations per second for 256-bit keyPBKDF2-sha512 1096836 iterations per second for 256-bit keyPBKDF2-ripemd160 434733 iterations per second for 256-bit keyPBKDF2-whirlpool 364088 iterations per second for 256-bit keyargon2i 4 iterations, 735656 memory, 4 parallel threads (CPUs) for 256-bit key (requested 2000 ms time)argon2id 4 iterations, 842046 memory, 4 parallel threads (CPUs) for 256-bit key (requested 2000 ms time)Algorithm | Key | Encryption | Decryptionaes-cbc 128b 594.1 MiB/s 1434.3 MiB/sserpent-cbc 128b 59.8 MiB/s 371.1 MiB/stwofish-cbc 128b 123.5 MiB/s 200.0 MiB/saes-cbc 256b 423.9 MiB/s 1284.2 MiB/sserpent-cbc 256b 61.0 MiB/s 394.5 MiB/stwofish-cbc 256b 136.8 MiB/s 240.4 MiB/saes-xts 256b 2196.7 MiB/s 2414.8 MiB/sserpent-xts 256b 445.6 MiB/s 401.0 MiB/stwofish-xts 256b 220.3 MiB/s 236.9 MiB/saes-xts 512b 2031.5 MiB/s 2117.4 MiB/sserpent-xts 512b 445.2 MiB/s 437.6 MiB/stwofish-xts 512b 221.9 MiB/s 249.3 MiB/s
As you can see from this sample output, aes-xts is the fastest! Assuming you're on an x86 machine, this will almost certainly also be the case for you. You'll also notice Argon2i only has 4 iterations here, making it unsafe to use. You can add -i 5000 to test 5000ms as an example, to see how many iterations it achieves.
Though unlikely, to avoid an entropy starved situation, you can use --use-random when setting up the disk.
There's a lot of debate and conflicting information online about the difference between /dev/random and /dev/urandom online. The main difference is that /dev/random will wait until it detects enough entropy has been gathered. Since it only affects when you initially setup the disk though, waiting for it to gather enough entropy is generally a good idea. Whether its method of ensuring it has gathered enough data is effective, is also somewhat debated, but it certainly doesn't hurt.
An easy way to ensure you have enough entropy, is to gather it from an external source. For example, you can run: curl -Ss https://www.random.org/cgi-bin/randbyte?nbytes=16384&format=f > /dev/random. This command gathers random bytes from random.org. Using an external source like this is ok, since Linux has ways to gather entropy besides this that an attacker would not be able to replicate.