Comments on: Lepron project part 3: A first attempt at pronounceable passwords using dice for quantified strength
You can submit a comment using the box below. You will be challenged with an arithmetic question but an email address is not required. This comment system does not use third-party providers or share data. It was custom-made for Clarion and runs entirely on the web server that hosts the site.
By policy, comments will remain open without a time limit, based on the premise that good comments made years later can be valuable.
- Lepron, a project to develop pronounceable pseudowords for representing binary strings - Part 1: introduction and goals May 2021 An empirical investigation by Stephen Hewitt
- Lepron project part 2: towards public key authentication without central authority using names made of pseudowords August 2021 An open source project by Stephen Hewitt
- How to remember a provably strong password: a new way using ‘constrained choice’ July 2018, Stephen Hewitt. The 2nd Clarion data privacy article
- How to remember a 128-bit key using ‘constrained choice’ August 2018, Stephen Hewitt. The 3rd Clarion data privacy article
- An idea for public key authentication from a name without certificates or central authority May 2021 Stephen Hewitt
- How to use beads to generate random letters and numbers by hand 22 September 2017, Stephen Hewitt. The first Clarion data privacy article
- ars technica article: Anatomy of a hack: How crackers ransack passwords like “qeadzcwrsfxv1331” Dan Goodin, ars technica, 28 May 2013
- Electronic Frontier Foundation article: EFF's New Wordlists for Random Passphrases Joseph Bonneau, Electronic Frontier Foundation, 19 July 2016
- diceware.com article: The Diceware Passphrase Home Page Arnold G. Reinhold, diceware.com,
- XKCD article: Password Strength XKCD, 10 August 2011
- How to Memorize a Random 60-Bit String Marjan Ghazvininejad and Kevin Knight, 2015 (SHA256 of PDF f0e091f445a4f777b123d56153cf149552e51424493ddf276378a709cbf5d79c)