https://github.com/jbclements/molis-hai

Password Generation using Markov models, Huffman trees, and Charles Dickens
https://github.com/jbclements/molis-hai

huffman-tree markov-model molis-hai racket

Last synced: 1 day ago
JSON representation

Password Generation using Markov models, Huffman trees, and Charles Dickens

• Host: GitHub
• URL: https://github.com/jbclements/molis-hai
• Owner: jbclements
• License: mpl-2.0
• Created: 2015-03-25T03:25:16.000Z (almost 10 years ago)
• Default Branch: master
• Last Pushed: 2019-02-11T11:29:27.000Z (almost 6 years ago)
• Last Synced: 2025-01-29T06:54:03.847Z (3 days ago)
• Topics: huffman-tree, markov-model, molis-hai, racket
• Language: Racket
• Size: 2 MB
• Stars: 43
• Watchers: 4
• Forks: 6
• Open Issues: 4
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

• awesome-racket-and-scheme - molis-hai

README

        
# molis-hai

Password Generation using Markov models, Huffman trees, and Charles Dickens

This repo contains the Racket code that I used to generate markov models and

huffman trees for [Molis Hai](http://www.brinckerhoff.org/molis-hai/pwgen.html),

a random password generator that generates relatively memorable strings.

It's a Racket Package, which means you can install it using

```

raco pkg install molis-hai

```

You can run it using

```

raco molis-hai

```

This will give you a single password using an order-2 model and 56 bits of entropy.

You could instead run

```

raco molis-hai -o 3 -b 80 -n 4

```

to generate 4 passwords using a third-order model with 80 bits of entropy each.

When I'm generating secure root passwords, I generate 8 passwords using 59 bits

of entropy, and then pick the one I like the best. This guarantees at least 56

bits of entropy in the resulting password.

Give it a try!