This is a simple Ruby script that helps you memorize a password by making you type it over and over again. It first breaks the password into chunks of 4 characters, helps you to memorize each chunk, then every consecutive pair of chunks, then every consecutive triple... and so on, until you're typing the entire password from memory.

I was able to completely memorize a 131-bit password (20 printable ASCII characters, completely random) in about 20 minutes using this script.

You'll need the 'highline' gem to run this script: gem install highline.

# Ruby Password Trainer require 'highline/import' TIMES_TO_TYPE = 5 CHUNK_SIZE = 4 puts "This is a script that helps you memorize a password." puts "WARNING: Make sure nobody is watching you while you use this script!" print "\nYour password: " password = gets.chop password_chunks = password.split("").each_slice( CHUNK_SIZE ).to_a def gets_noecho ask("") { |q| q.echo = false } end def clear system("clear") end def continue?(round) print "Round #{round} finished. Again? [Y/n] " return gets =~ /^y$/i end def chunks(num_chunks, password_chunks) password_chunks.each_cons( num_chunks ) do |portion| part = portion.join("") # Training left = TIMES_TO_TYPE while left > 0 puts "Type \"#{part}\" #{left} times..." input = gets_noecho if input == part left -= 1 else puts "WRONG! You typed \"#{input}\"" left += 2 end end # Recall test left = TIMES_TO_TYPE wrong = false while left > 0 and not wrong clear puts "Type the same thing #{left} times..." input = gets_noecho if input != part wrong = true else left -= 1 end end print ">> You got #{TIMES_TO_TYPE - left}/#{TIMES_TO_TYPE} right.\n\n" if wrong puts "Try again..." redo end end end round = 0 begin clear 1.upto( password_chunks.length ) do |num_chunks| chunks(num_chunks, password_chunks) end round += 1 end while continue?( round )

Other articles

Increasing Collisions in Password Hashing

Tue 11 December 2012
By Taylor Hornby

In security.

tags: passwords hashing

With this post I will try to show how, in a theoretical scenario, deliberately weakening the collision resistance of a password hash function can increase security. This is by no means a formal proof.

Suppose Alice has an account on two computer systems X and Y. She uses the same ...
read more
Coders, PLEASE STOP inventing your own hash functions!
Tue 21 August 2012
By Taylor Hornby

In security.

tags: passwords hashing

Today, I came across an article on password cracking. In the comment section I saw someone had posted (presumably right after they just read about salting) the following reply:
```
My solution: don't store hashes as a single SHA1 or MD5 result ...
combine it for further obfuscation. A hash is ...
```
read more
Cracking eHarmony's Unsalted Hashes with CrackStation

Sat 09 June 2012
By Taylor Hornby

In security.

tags: passwords hashing eharmony

This week, LinkedIn, eHarmony, and last.fm have all confirmed that their password hash databases have been breached. In all three cases, passwords were stored as an unsalted hash. I've already reported the results of cracking LinkedIn's password hashes with CrackStation, now it's eHarmony's turn.

eHarmony ...
read more
Cracking LinkedIn's Hashes with Crackstation

Fri 08 June 2012
By Taylor Hornby

In security.

tags: passwords hashing linkedin

LinkedIn's user database has been breached. The passwords were hashed with SHA1, but salt was not used. 6 million of them have been published to the internet. You can download them via torrent or via HTTP from defuse.ca's mirror. 3.5 million of them have had their ...
read more
The Economics of Password Cracking

Sat 05 May 2012
By Taylor Hornby

In security.

tags: passwords hashing cracking

We know that it's possible to come up with a password that no computer on earth can crack. Use true random data to generate a sequence of 20 characters from the full ASCII printable set, spend an hour memorizing, and you're good. We also know that most people ...
read more

Other articles

social