Aaron Toponce atoponce

Alternate EFF long list in Deseret and Shavian alphabet characters

An Idea for Passphrases

Knowing the growing support for Unicode support on the web, including HTML forms, such as usernames and passwords, I decided to create two English spelling reform Diceware word lists in the Deseret Alphabet and the Shavian Alphabet.

title

author

date

geometry

header-includes

Another MILLION Random Digits

Aaron Toponce

2020-05-12

margin=2cm

\usepackage{setspace}

\usepackage{lineno}

\usepackage{lscape}

Cryptography, not cryptocurrency

Books

Resources

Playing Card Password Generator

Chris Wellons has done work here with Pokerware, building passphrases from a shuffled deck of cards. This builds using a sufficiently shuffled deck of playing cards, but building random meaningless password strings instead of passphrases.

This is a manual method of password generation without needing a computer. As such, some care must be taken during generation:

Every Mac OS X Unix certification by The Open Group:

10.0 (Cheetah): N/A
10.1 (Puma): N/A
10.2 (Jaguar): N/A
10.3 (Panther): N/A
10.4 (Tiger): N/A
10.5 (Leopard)
10.6 (Snow Leopard)
10.7 (Lion): N/A

The following shell scripts pass POSIX compiance with posh(1) on Debian. They have also been tested in bash(1), ksh(1), and dash(1) (which provides /bin/sh) on Debian.

Feedback of testing with other shells on other systems to target portability is greatly appreciated. I don't get notified of Gist comments, so reach out to me on Twitter instead.

Execute with an argument as a maximum random number, no bigger than 4294967296:

Verifiable brute force strength

Below are table of various projects that can completely exhaust n-bits of keyspace. In other words, counting completely and fully from 0 to 2ⁿ-1.

This Gist implies no discussion about how this is relevant to quantum computing using Grover's algorithm, meet-in-the-middle or birthday attacks, or anything of the like. It's strictly a Gist about raw speed, measuring the result in bits.

If you know of other noteworthy and verifiable brute force searching projects,

Magic Hashes

Motivations

Calculating magic hashes for https://www.whitehatsec.com/blog/magic-hashes/. These strings should probably be put into a blacklist preventing users from using them as passwords to mitigate PHP evaluating hashes starting with "0e" as floats.

	A = [0, 0, 0, 0, 1, 0, 0, 2, 0, 2, 1, 1, 1, 2, 0, 0, 2, 0, 1, 0, 1, 2, 1, 1, 0, 1, 2, 0, 3, 0, 2, 3, 0, 1, 1, 0, 1, 0, 1, 2, 1, 1, 0, 1, 0, 1, 0, 1, 2, 3, 1, 1, 1, 1, 0, 1, 0, 2, 1, 0, 0, 0, 1, 1]

	min-entropy: H = -log2(p_max)
	Shannon: H = -sum(p_i * log2(p_i))
	max-entropy: H = -log2(unique(p_i))

	min-entropy ~= 4.196397212803504
	Shannon ~= 5.158365849770286
	max-entropy = 2

	cantrbry.tar
	cantrbry.tar..
	.*.swp