PGP word list


The PGP Word List is a list of words for conveying data bytes in a clear unambiguous way via a voice channel. They are analogous in purpose to the NATO phonetic alphabet used by pilots, except a longer list of words is used, each word corresponding to one of the 256 unique numeric byte values.

History and structure

The PGP Word List was designed in 1995 by Patrick Juola, a computational linguist, and Philip Zimmermann, creator of PGP. The words were carefully chosen for their phonetic distinctiveness, using genetic algorithms to select lists of words that had optimum separations in phoneme space. The candidate word lists were randomly drawn from Grady Ward's Moby Pronunciator list as raw material for the search, successively refined by the genetic algorithms. The automated search converged to an optimized solution in about 40 hours on a DEC Alpha, a particularly fast machine in that era.
The Zimmermann–Juola list was originally designed to be used in PGPfone, a secure VoIP application, to allow the two parties to verbally compare a short authentication string to detect a man-in-the-middle attack. It was called a biometric word list because the authentication depended on the two human users recognizing each other's distinct voices as they read and compared the words over the voice channel, binding the identity of the speaker with the words, which helped protect against the MiTM attack. The list can be used in many other situations where a biometric binding of identity is not needed, so calling it a biometric word list may be imprecise. Later, it was used in PGP to compare and verify PGP public key fingerprints over a voice channel. This is known in PGP applications as the "biometric" representation. When it was applied to PGP, the list of words was further refined, with contributions by Jon Callas. More recently, it has been used in Zfone and the ZRTP protocol, the successor to PGPfone.
The list is actually composed of two lists, each containing 256 phonetically distinct words, in which each word represents a different byte value between 0 and 255. Two lists are used because reading aloud long random sequences of human words usually risks three kinds of errors: 1) transposition of two consecutive words, 2) duplicate words, or 3) omitted words. To detect all three kinds of errors, the two lists are used alternately for the even-offset bytes and the odd-offset bytes in the byte sequence. Each byte value is actually represented by two different words, depending on whether that byte appears at an even or an odd offset from the beginning of the byte sequence. The two lists are readily distinguished by the number of syllables; the even list has words of two syllables, the odd list has three. The two lists have a maximum word length of 9 and 11 letters, respectively. Using a two-list scheme was suggested by Zhahai Stewart.
HexEven WordOdd Word
00aardvarkadroitness
01absurdadviser
02accrueaftermath
03acmeaggregate
04adriftalkali
05adultalmighty
06afflictamulet
07aheadamusement
08aimlessantenna
09Algolapplicant
0AallowApollo
0Balonearmistice
0Cammoarticle
0Dancientasteroid
0EappleAtlantic
0Fartistatmosphere
10assumeautopsy
11AthensBabylon
12atlasbackwater
13Aztecbarbecue
14baboonbelowground
15backfieldbifocals
16backwardbodyguard
17banjobookseller
18beamingborderline
19bedlampbottomless
1AbeehiveBradbury
1Bbeeswaxbravado
1CbefriendBrazilian
1DBelfastbreakaway
1EberserkBurlington
1Fbilliardbusinessman
20bisonbutterfat
21blackjackCamelot
22blockadecandidate
23blowtorchcannonball
24bluebirdCapricorn
25bombastcaravan
26bookshelfcaretaker
27brackishcelebrate
28breadlinecellulose
29breakupcertify
2Abrickyardchambermaid
2BbriefcaseCherokee
2CBurbankChicago
2Dbuttonclergyman
2Ebuzzardcoherence
2Fcementcombustion
30chairliftcommando
31chattercompany
32checkupcomponent
33chiselconcurrent
34chokingconfidence
35chopperconformist
36Christmascongregate
37clamshellconsensus
38classicconsulting
39classroomcorporate
3Acleanupcorrosion
3Bclockworkcouncilman
3Ccobracrossover
3Dcommencecrucifix
3Econcertcumbersome
3Fcowbellcustomer

HexEven WordOdd Word
80meritintention
81minnowinventive
82miserIstanbul
83MohawkJamaica
84muralJupiter
85musicleprosy
86necklaceletterhead
87Neptuneliberty
88newbornmaritime
89nightbirdmatchmaker
8AOaklandmaverick
8BobtuseMedusa
8Coffloadmegaton
8Dopticmicroscope
8Eorcamicrowave
8Fpaydaymidsummer
90peachymillionaire
91pheasantmiracle
92physiquemisnomer
93playhousemolasses
94Plutomolecule
95precludeMontana
96prefermonument
97preshrunkmosquito
98printernarrative
99prowlernebula
9Apupilnewsletter
9BpuppyNorwegian
9CpythonOctober
9DquadrantOhio
9Equiveronlooker
9Fquotaopulent
A0ragtimeOrlando
A1ratchetoutfielder
A2rebirthPacific
A3reformpandemic
A4regainPandora
A5reindeerpaperweight
A6rematchparagon
A7repayparagraph
A8retouchparamount
A9revengepassenger
AArewardpedigree
ABrhythmPegasus
ACribcagepenetrate
ADringboltperceptive
AErobustperformance
AFrockerpharmacy
B0ruffledphonetic
B1sailboatphotograph
B2sawdustpioneer
B3scallionpocketful
B4scenicpoliteness
B5scorecardpositive
B6Scotlandpotato
B7seabirdprocessor
B8selectprovincial
B9sentenceproximate
BAshadowpuberty
BBshamrockpublisher
BCshowgirlpyramid
BDskullcapquantity
BEskydiveracketeer
BFslingshotrebellion

Examples

Each byte in a bytestring is encoded as a single word. A sequence of bytes is rendered in network byte order, from left to right. For example, the leftmost is considered "even" and is encoded using the PGP Even Word table. The next byte to the right is considered "odd" and is encoded using the PGP Odd Word table. This process repeats until all bytes are encoded. Thus, "E582" produces "topmost Istanbul", whereas "82E5" produces "miser travesty".
A PGP public key fingerprint that displayed in hexadecimal as

would display in PGP Words as

The order of bytes in a bytestring depends on Endianness.

Other word lists for data

There are several other word lists for conveying data in a clear unambiguous way via a voice channel: