An open API service indexing awesome lists of open source software.

https://github.com/robcranfill/nice-combo

Find a nice mnemonic-friendly 4-to-6-digit combination for a Kidde 10-digit lockbox or the like.
https://github.com/robcranfill/nice-combo

Last synced: 26 days ago
JSON representation

Find a nice mnemonic-friendly 4-to-6-digit combination for a Kidde 10-digit lockbox or the like.

Awesome Lists containing this project

README

          

# nice-combo
Find a nice mnemonic-friendly combination to use with a Kidde "KeySafe" 10-digit lockbox or the like.

This program finds 4-to-6-digit combinations (that length was chosen for [these reasons](https://boards.straightdope.com/sdmb/showthread.php?t=791728)) that have a common English word mnemonic, using one of the Linux dictionaries and some Java code to create a list of all found combinations; this is then stored in a simplistic fashion in a dictionary that the Javascript on the web page picks a random pair out of.

We use a telephone keypad as the way to map numbers to letters. One disadvantage of using the phone keypad for mapping is the combination will never have any zeros or ones in it, so the number of possible combos is smaller - and if the Bad Guy knows this, the search area for a brute-force attack is smaller too. (But they probably don't know this, so we're probably OK.)

The important thing to note about these lock-boxes is that the combination is *not* order-dependent; that is, "123" is the same as "321" and "312" and all other permutations of those three digits. :-/ And repeats don't matter, either, so "12131213111" is effectively the same as that simple three-digit combo.

The upshot of all this is there are only a few hundred "good" combinations of 4-6 digits, making a brute-force attack more feasible; but that's still hundreds of tries, and I think any Bad Guy would give up before then.

If all goes as planned, you can run this code here:
http://robcranfill.net/combo