fmaury/seirdy.one
1
0
Fork 0
mirror of https://git.sr.ht/~seirdy/seirdy.one synced 2024-12-17 22:32:10 +00:00
Code Issues Projects Releases Wiki Activity

Re-word statement on not detailing crypto algos

Browse source
This commit is contained in:
Rohan Kumar 2021-01-17 11:41:25 -08:00
parent f22692d836
commit 0085518b41
No known key found for this signature in database
GPG key ID: 1E892DB2A5F84479
2 changed files with 11 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
content/posts/password-strength.gmi
View file

@ -61,10 +61,12 @@ A brute-force attack will just guess a single password until the right one is fo
When estimating, we'll prefer higher estimates that increase the odds of it guessing a password; after all, the point of this exercise is to establish an *upper* limit on password strength. We'll also simplify: for instance, the MOAC will not waste any heat, and the only way it can guess a password is through brute-forcing. Focusing on too many details would defeat the point of this thought experiment. When estimating, we'll prefer higher estimates that increase the odds of it guessing a password; after all, the point of this exercise is to establish an *upper* limit on password strength. We'll also simplify: for instance, the MOAC will not waste any heat, and the only way it can guess a password is through brute-forcing. Focusing on too many details would defeat the point of this thought experiment.
I won't address any particular encryption algorithms; this is just a pure and simple brute-force attack given precomputed password entropy. Furthermore, quantum computers can use Grover's algorithm for an exponential speed-up; to account for quantum computers using Grover's algorithm, calculate P(n/2, e) instead. Quantum computers can use Grover's algorithm for an exponential speed-up; to account for quantum computers using Grover's algorithm, calculate P(n/2, e) instead.
=> https://en.wikipedia.org/wiki/Grover%27s_algorithm Grover's algorithm (Wikipedia) => https://en.wikipedia.org/wiki/Grover%27s_algorithm Grover's algorithm (Wikipedia)
Others are better equipped to explain encryption/hashing/key-derivation algorithms, so I won't; this is just a pure and simple brute-force attack given precomputed password entropy, assuming that the cryptography is bulletproof.
Obviously, I'm not taking into account future mathematical advances; my crystal ball broke after I asked it if humanity would ever develop the technology to make anime real. Obviously, I'm not taking into account future mathematical advances; my crystal ball broke after I asked it if humanity would ever develop the technology to make anime real.
Finally, there's always a non-zero probability of a brute-force attack guessing a password with a given entropy. Literal "immunity" is impossible. Lowering this probability to statistical insignificance renders our password practically immune to brute-force attacks. Finally, there's always a non-zero probability of a brute-force attack guessing a password with a given entropy. Literal "immunity" is impossible. Lowering this probability to statistical insignificance renders our password practically immune to brute-force attacks.

13
content/posts/password-strength.md
View file

@ -106,11 +106,14 @@ password strength. We'll also simplify: for instance, the MOAC will not waste an
heat, and the only way it can guess a password is through brute-forcing. Focusing on heat, and the only way it can guess a password is through brute-forcing. Focusing on
too many details would defeat the point of this thought experiment. too many details would defeat the point of this thought experiment.
I won't address any particular encryption algorithms; this is just a pure and simple Quantum computers can use [Grover's
brute-force attack given precomputed password entropy. Furthermore, quantum computers algorithm](https://en.wikipedia.org/wiki/Grover%27s_algorithm) for an exponential
can use [Grover's algorithm](https://en.wikipedia.org/wiki/Grover%27s_algorithm) for speed-up; to account for quantum computers using Grover's algorithm, calculate
an exponential speed-up; to account for quantum computers using Grover's algorithm, `P(n/2, e)` instead.
calculate `P(n/2, e)` instead.
Others are better equipped to explain encryption/hashing/key-derivation algorithms,
so I won't; this is just a pure and simple brute-force attack given precomputed
password entropy, assuming that the cryptography is bulletproof.
Obviously, I'm not taking into account future mathematical advances; my crystal ball Obviously, I'm not taking into account future mathematical advances; my crystal ball
broke after I asked it if humanity would ever develop the technology to make anime broke after I asked it if humanity would ever develop the technology to make anime