3 ms·
A side issue, but: > It generates those passwords for you, and they're short, one-time-use combinations of three English words If an attacker knows the tool d
by jrochkind1 8y ago
A side issue, but:
> It generates those passwords for you, and they're short, one-time-use combinations of three English words
If an attacker knows the tool does this, doesn't this reduce the keyspace to crack to (number of words in an English dictionary)*3? Is that enough? Am I missing something?
A very complete dictionary has around 170K words, let's generously assume the password generator is willing to use all of them, many that will be unfamiliar and cumbersomely large to an actual native English speaker. So 510K in the keyspace, around 19 bits of "key". Maybe that's enough?
- m45t3r 8y agoIt is not multiplication, it is permutation (170k!). I don't know how big this number is, however it is pretty big. This technic even has a name: diceware [1]. [1]: https://en.m.wikipedia.org/wiki/Diceware https://en.m.wikipedia.org/wiki/Diceware
- m45t3r 8y agoSorry, not factorial either. More like 170k(170k - 1)(170k - 2). Generally I see people using Diceware with more than 3 words too (at least 4 or 5). However if the file does not need NSA levels of security 3 words seems fine.
- zeveb 8y ago> 170k(170k - 1)(170k - 2) Which is 4,912,913,300,340,000 ≈ 2^52. Fifty-two bits of entropy is pretty horrible for anything that you really care about: you want at least 128.
- AnaniasAnanas 8y agoIt's around 2^52 keys, which is pretty bad.
- AgentME 8y agoRight, a 52-bit key would be terrible for symmetric encryption. But that's not what Wormhole does. It uses PAKE, which is an interactive protocol that allows two parties that both know a short password to securely come up with a longer key for symmetric encryption.
- deleted 8y ago[deleted]
- gtank 8y agoIt’s enough because of the underlying PAKE technique. The passwords do not directly become the key, and an unsuccessful bruteforce attempt breaks the session. PAKE isn’t really new, but it’s certainly underused for how much it changes the password game: https://blog.cryptographyengineering.com/2018/10/19/lets-talk-about-pake/ https://blog.cryptographyengineering.com/2018/10/19/lets-tal...
- throwaway415415 8y agoThe server can still bruteforce it though right?
- lotharrr 8y ago(author of magic-wormhole here) Nope, the server gets no more power than a random network attacker. The codes are single-use, enforced by PAKE, so an attacker (or the server) gets at most one chance to guess the code for any single execution of the program.
- lotharrr 8y agomagic-wormhole uses a 256-word list, so the two-word default provides 16 bits of entropy. But the code goes into PAKE, not a symmetric encryption key, so an attacker only gets one shot to guess it (it's an interactive protocol, so they must commit to their guess in the first message, and don't discover whether they're correct or not until the second message). It's basically spending interactivity (and single-use-ness) to buy adequate security for a short secret. Magic-wormhole is not useful for encrypting long-term data-at-rest (because the sender needs to stick around to perform the key-exchange protocol with the receiver), nor is it useful for encrypting data to multiple parties (because the code is single-use). But it's great for getting a single file to a single person, or to establish a full-strength session key for continued use later.