A Practical Hand-Operated One-Time Pad Cipher System

As a process for encrypting high-security data for communication and archival purposes. by Wolfgang Hammersmith
cipherwise@gmail.com Copyright (c) 2013 by the author. 18 October 2013

Abstract This paper details a hand encryption (pencil and paper) method for encrypting limited plaintext character sets with a One-Time Pad Cipher (OTPC) utilizing the proven five 10-sided dice method for developing cryptographically acceptable random numeric keys. Strict procedures are emphasized in order to produce high quality ciphertext that remains unbreakable now and in the future. No electronic means are used in the encryption and decryption process or in the production of sufficiently random keys. While polyalphabetic and alphanumeric variations of the OTPC exist, this hand-operable method produces numeric ciphertext having the character set !!!!!!! ! !!!. Conversion Table codes are utilized to broaden the scope of the plaintext character set and any other phrase-based codes can be inserted in the plaintext that reduce workload volume while adding yet another dimension to the security of the already indecipherable ciphertext1.

The extra security dimension is that codes, taken by themselves, are unbreakable and must be attacked either by obtaining the codebook, through the correlation of observed activities, or by applied social science.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4!

Development History The simple, yet unbreakable One-Time Pad Cipher has a fasintriguing development history, with precedents dating back to 15532. First invented in 1882 by Sacramento banker Frank Miller3 4, a man difficult to profile due to lack of surviving records and a common name, it was rediscovered in 1917 by Gilbert S. Vernam of Bell Telephone Laboratories and Joseph O. Mauborgne of the U.S. Army Signal Corps, and there is some evidence that Mauborgne knew of Millers work through a common associate, Parker Hitt. However, J Mauborgnes work was substantially different from Millers Telegraphic Code to Insure Privacy and Secrecy in the Transmission of Telegrams. Miller used a 14,000-word codebook that reduced telegraph costs by representing common phrases as three and five letter codes that could be customized to the users needs with instructions for adding (modulo 14,000) a series of randomly selected (technically not a random series) shift numbers to the coded phrases. The shift numbers, when used, were erased and the sequence was never used again. By way of contrast, in 1917, Gilbert Vernam, a research engineer for AT&T, developed an electromechanical system to encrypt Teletype communications that differed in principle function from Miller's pencil-and-paper algorithm. In fact, there are enough differences between the two ideas that it may be unlikely that Vernam's invention, although it resembled Miller's working system, was a copy of it. Vernam used a five-bit Baudot-coded punched paper tape that held the coded plaintext message with a second looped punched paper tape of random five-bit values and combined them using a bit-wise XOR (essentially, addition modulo 2). The message and key tapes were synchronized on sending and receiving TELEX machines, forming the first automated repetitive-key encryption system. While studying the Vernam System, Captain Joseph Mauborgne, who later became Chief of the U.S. Signal Corps, proved that the looped-key double tape system could not resist cryptanalysis in depth. Mauborgne rightly postulated that a sufficiently random key tape as long as the message and used only once would produce unbreakable ciphertext. ATT&T marketed the modified Vernam System without success. Then, in 1921, three German cryptologists, Werner Kunze, Rudolf Schauffler, and Erich Langlotz, were working on breaking French diplomatic traffic that utilized pencil-and-paper numerical codes to convert words and phrases into digits. The French innovation was to add (mod10) a short looped numeric key sequence to encrypt the code book values in a process remarkably parallel to the Vernam System. The German cryptologists soon realized that adding a random key digit to each code digit would make the message unbreakable if the random key digit series was only used once. The brilliant German team created a system using paper sheets that contained a series of random digits as a key, one copy for the sender and one identical copy for the receiver, where each key was used only once and destroyed after use, essentially reinventing elements of Millars 1882 system and Mauborgnes later work.
2 3

See http://en.wikipedia.org/wiki/Vigenre_cipher and http://en.wikipedia.org/wiki/Beaufort_cipher Frank Miller, (1882), Telegraphic code to insure privacy and secrecy in the transmission of telegrams, CW Cornwell. 4 Bellovin, Steven M. (July 2011). "Frank Miller: Inventor of the One-Time Pad". Cryptologia 35 (3). doi:10.1080/01611194.2011.583711. Retrieved 2011-08-03 20:53:59.
A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4!

By 1923, the unbreakable German OTPC system was in use with their foreign office protecting sensitive traffic and it migrated from there into widespread use by several nations during WWII. In an odd twist to history, it wasnt until 2011 that Miller's 1882 lightning-bolt realization of a perfect cipher was rediscovered in archives and he finally received posthumous credit for his pioneering work. Regardless of multiple points of origin throughout its rich history, the One-Time Pad Cipher clearly stands today as the only cryptographic algorithm that is absolutely unbreakable in the face of any level of analytic technology available now, or in the future.5 The OTPC is easy to implement with hand encryption techniques and, when sufficiently random OTPC key vectors are used, it produces unbreakable ciphertext. The hand encryption OTPC method detailed herein is a practical, efficient process for encrypting low-volume critical data at rest or in motion without resorting to computers at any stage, including key production. There is much controversy in this field about which non-electronic, electronic, and hybrid methods produce keys with a degree of entropy adequate to maintain perfect security of the final ciphertext. Since the level of entropy present in the random key vector equals the level of entropy in the ciphertext, the One-Time Pad Cipher must employ a key that is significantly random by cryptographic standards in order to produce unbreakable ciphertext. Using five 10-sided dice, rolled in a specific manner where numerals are harvested using a tested process, creates a vector with an acceptable degree of randomness for unbreakable cryptography. Methodological History This manual OTP Cipher System method is identical to techniques used by the Russian NKVD, the German intelligence and military orgs, British SOE, and various American intelligence services during and after World War II to present day. This method has withstood intense analysis under the formerly secret USG Venona Project6, which was the first time that hundreds of thousands of messages, encrypted both properly and improperly by a numeric OTP Cipher System, were attacked continuously for 37 years from 1943 to 1980. The NKVD unwittingly contributed to a fantastic moment in history, setting up a statistically viable sample containing two states: the proper and improper operation of the OTPC. The only yield from the Venona Project came from a small subset of messages within the total sample that were encrypted with duplicate keys manufactured during a short period in 1942 when cipher clerks at the NKVD, working under tremendous time pressure, committed a cardinal error by duplicating entire key sets and then using segments of them to produce multiple key books. These key books were distributed to unsuspecting operators who then used these duplicated keys for several years, unknowingly breaking the prime commandment of the OTPC: Thou Shalt Not Reuse Keys (as the name One-Time Pad suggests). Messages created with duplicate keys peaked in 1944, shown by the relative decryption success for messages intercepted in that year. The Venona Project established a base line and documented proof of the unbreakable nature of the OTPC with bi-state verification, for which we can sincerely thank the NKVD.
5

Some writers add the warning phrase, only when used properly but this is, being gentle, highly irrational. Its like writing that a car, used without crashing it into a building, will transport a person to a destination. A car or any cipher must be used properly as an unspoken basic tenant of its operation, or why bother using it at all? 6 http://en.wikipedia.org/wiki/Venona_Project
A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4!

It is estimated in hindsight that the duplicate key books were completely used up and out of service by 1945, resulting in the following data showing decryption success by year, (Table 1). 1942: 1.8% 1943: 15.0% 1944: 49.0% 1945: 1.5%
Table 1. Decryption success percentages for messages intercepted by year over a total sample of hundreds of thousands of messages.

Despite having a large sample of ciphertext of more than 300,000 encrypted messages, less than 3,000 were wholly or partially decrypted. The decryption success rate was, in fact, zero for messages encrypted properly with a single-use random key, empirically proving the strength of the OTP Cipher.7 However, that very proof of invulnerability, along with its inherent mandatory key requirements where the length of the key is equal to the length of the plaintext, resulted in this cipher being intentionally sidelined and downplayed within the cryptographic community and educational institutions actually banned it from further research and development for more than 60 years. Instead, the new and as it turned out, tragically misplaced focus8 was on the development of classes of breakable ciphers that are today causing tremendous and continually escalating problems for governments, businesses, and individuals alike. And research is being funded to create another wave of breakable ciphers. Because of their weaknesses, they remain ultimately breakable and thereby acceptable for general public and top-secret use. However, in the midst of the current rush to create more breakable ciphers to replace the current AES, the humble OTPC cipher is making a comeback. It wasnt until the invention of the OTPC-powered AlphaCipher System by this author that the OTP Cipher began its resurrection toward becoming the last cipher left standing amidst the cipher wars of the 2000s as AES and other breakable encryption are rapidly falling to advanced hyper-fast (by todays standards) computers using uniformly effective cracking algorithms and morphing programs. But there are problems with encrypting information using the computers made today. The AlphaCipher Development Team dealt with these issues successfully in AlphaCipher Products. The following information is not about how to use computers with OTPC Systems, but rather to further characterize support for the use of a manual OTPC System for short messages.

7 8

Those who claim that advanced technology can break any cipher, including the OTPC, are simply misinformed. This focus was misplaced only in the view of the knowledgeable public users of AES, RSA, and other breakable systems. The NSA and equivalent agencies of other nations were pleased and enthusiastically supported the promotion of breakable ciphers for use by the public and even in government, where the breakable AES 256 was mandated for Secret and above information. In 2013, an undisclosed NSA employee was reported by The Guardian as saying, Its perfect for us to have everyone desire and use technology and ciphers that we can freely read. That couldnt have worked out better. NSAs policy is just as vital today as it was when defined by its founder: The NSA must have unfettered access to and understand everything spoken or written by everyone everywhere. This policy has undoubtedly saved many lives, but debates on whether this infringement of freedom and loss of privacy is necessary in a free society will continue to rage with no resolution in sight at this time.
A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4!

Here are a few of the nonhuman-based security and procedural issues encountered by the AlphaCipher Development Team: 1. Computers that have ever been or are connected to the Internet, however briefly, and all computers manufactured since January, 2009 are permanently compromised and should never be used with any type of encryption system to originate or encrypt critical data. 2. The digital keys must be kept securely on passive media in a shielded offline ecosystem. 3. The computer used for plaintext origination must never be powered up without adequate shielding such as a Faraday Cage or a Tempest Computer enclosure, and Internet connection capability must be removed or destroyed (impossible on newer computers). 4. The computers operating system (OS) must allow operation without Internet connection. 5. The encryption/decryption environment must have sound-deadening materials installed that prevent recording of keyboard sounds as the plaintext messages are originated. 6. The storage media used to transfer encrypted files from the origination computer to the Net for distribution or to a storage facility must be new media, never reused or repurposed, to prevent malware from being transferred back to the originating system. 7. The alternating current power supply to the encryption and decryption computer systems must be isolated from the national power grid, completely shielded, monitored, and selfcontained. While the AlphaCipher Systems Development Team successfully overcame these and other wellknown and newly-discovered disadvantages to a computer-based OTPC, creating a suite of strong, fast, and secure practical encryption products, there remain numerous applications for a pencil-and-paper based unbreakable encryption system that doesnt suffer from the challenges inherent with encrypting digital information. With the manual OTPC, the final ciphertext is exposed as a digital file only if email or text services are used to distribute the ciphertext. As the old saying goes, Data written by hand on paper cant be electronically hacked. In Summary: The OTPC Method described here has withstood concentrated attacks where the proof of its invulnerability was supported by extensive analysis of a statistically significant ciphertext sample containing instances where the cipher was operated both correctly and incorrectly. The well-supported facts that the OTPC is, (i) indecipherable, (ii) easy to operate with pencil and paper without electronic means, and (iii) that high-quality keys can be produced without electronic devices, indicate that the hand-operated OTPC is a powerful cipher for lowvolume critical text including raw intel, classified intel, and data in cosmic top secret silos. Design Elements Overview The Form. This method of the hand-operated OTP Cipher is best operated accurately using the form provided in the Appendix. This form is simple, well-organized, user tested, and can be created with nothing more than grid paper and a pencil. Alternatively, cipher operations can be done on blank paper as well, but careful attention to column and row alignment then becomes paramount to maintain accuracy. The open space at the top of the form below the header is used to design brief but clear plaintext and imbed codes prior to encryption. Upon decryption, the plaintext is displayed on the top line of each grid row and can be copied to the open area to be decoded.

A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! Conversion Table. A conversion table of some type is necessary to translate a larger plaintext character set containing codes, English capital letters, symbols, and numerals, into a smaller set of numerals, !!!!!!! ! !!!. This conversion table supports the following plaintext set, where commas and vertical lines are used in Figure 1 to separate some of the set members: {{A,B,C, Z}, |line feed|, ), (, %, !, @, +, -, |period|, |space|, \, /, |comma|, =, |.com|, |www.http//|, |start|, |end|, , :, {0,1,2 9}}
Figure 1. The Conversion Table character set.

The conversion table used in the example herein is based upon historic models with modern updates and extensions, but any conversion table can be used if it offers sufficient scope to encode the range of required plaintext elements. Since converting the larger plaintext into a smaller set of numerals is required, there is an expansion penalty where the ciphertext is longer than the plaintext, and this is discussed below.

Figure 2. Example Conversion Table.

There is an issue that 99 is used to designate the start of a three-numeral code and for other functions. The Switch Indicator, 98, is used as a preface to access, or switch to, the second bank of conversion digits from 80 99. As examples, the colon converts to 9887 and a period to 9884. The cipher operator must use ordinary logic to sort out these overlays after decryption. Notice also that the letters in the phrase RATNOISE are converted to single digits because they are the most-commonly used letters in the English alphabet. On the last line, numerals are coded as duplicates of themselves where, for example, the numeral 9 is represented as 99. Encryption/Decryption. There are several methods for combining key vectors with plaintext vectors, including XOR and modular addition and subtraction. XOR is preferred when dealing with bits, but for manual operations involving numerals, subtraction !!"# !!"! during encryption and addition !"# !!" !during decryption have shown to be fast and easy with high marks for accuracy during human trials. Encryption and decryption methods are detailed under Process.
A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4!

Key Production. There are also many methods for random key vector production, the best of which are time-consuming. The top choice for this OTPC method is a specific way to roll ten, 10-sided dice because dice can be easily transported, yield cryptographically secure random numbers when used properly, and require no electronic instrumentation or computers to operate. While it is difficult to obtain a sample large enough for adequate testing using the NIST Test Suite or other tests that can indicate the degree of randomness9 present in a vector, the mathematical parameters, performance, and variant statistics of 10-sided dice are well known. Numerous reliable predictions have been made as to the degree of randomness of key vectors produced by five or more of these dice rolled concurrently with a specific technique under uniform conditions. Each roll of the dice produces sub-vectors that are concatenated, creating the final random key vector. It has been shown that key vectors produced in this way contain entropy that exceeds cryptographic standards for unbreakable cryptography using mathematical extension as a replacement for large sample size.10 Random key vectors are usually kept in a handwritten11 key book, identical copies of which are distributed to the members of the cipher group. The key book is never created on any electronic device because the privacy of any computer can be compromised in several ways, even if the computer has never been connected by any means to the Internet. When the cipher is being used to archive data in a common-access medium such as a cloud, only the archivist needs to keep a single copy of the key book (and codebook, if used). The method for using 10-sided dice is explained under Process, below. To produce keys for this OTPC System, obtain 10 ea. 10-sided dice, Figure 3. The standard dice notation as used in this paper12 is 10d10.

Figure 3. Ten 10-sided dice, pentagonal trapezohedron or deltohedron, 10d10.

It isnt possible to declare that a numeric series is random. There are measureable degrees of randomness, and even those determinations are under constant debate. The study of how entropy is captured and measured is certainly fascinating, but that work stands just outside the scope of this paper. 10 See http://en.wikipedia.org/wiki/Randomness_tests and http://www.math.umbc.edu/~rukhin/papers/talk.pdf by Andrew Rukhin et. al., http://en.wikipedia.org/wiki/Uniform_distribution_(discrete) and the References section. 11 Random vectors are specifically not created on a computer or electronic device, and not kept in any form electronically. 12 http://en.wikipedia.org/wiki/Dice_notation#10-sided_variations. This OTPC key creation system uses 10d10.
A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4!

Symmetrical Effort. Another design consideration was that the expenditure of effort to encrypt and decrypt should be approximately equal. Bidirectional symmetrical effort, normally present in an OTPC, was preserved in this design. In Summary: The design of this method is historically based, well researched and tested, and stands on the shoulders of giants in the field who faced life-or-death situations that demanded an unbreakable cipher perform with perfect security. Nothing has changed with regard to OTPC methods since that time and this process for a hand-operated OTPC directly inherits all the wellknown benefits of that research. The main difficulty with any OTPC is that key vectors are as long as the plaintext, but this is the nature of the beast and while research is underway concerning compression of a random vectors (classically thought of as impossible), the fact remains that the long, random OTPC Keys, like any other cipher keys, must be kept properly secured. If this is the simple cross that must be borne for perfect security, so be it. Message Preparation Some of this section is shared with the white paper on the RAMBDICT Cipher since message preparation is, in many ways, similar for both ciphers. As with any communication, brevity is the opposite of clarity. The plaintext message should be constructed to reduce errors in understanding, yet be as brief as possible. Care should be taken to design the plaintext to be short and simple, thus minimizing the workload of the receiving operator, reducing error propagation. However, in every case the design should favor clarity regardless of length. Imbedding codes from a well-written codebook can reduce the volume of the work considerably while substantially increasing the degree of understanding. While the design of a codebook is outside the scope of this paper, myriad examples exist from published commercial codes to codebooks used in clandestine situations circa WWII, all available on the Internet. Older codebooks can be repurposed by changing the meanings assigned to the codes. Codebooks can be obtained from open public resources and modified for this cipher without damaging the security of the ciphertext.13 Unpublished codes, analyzed by themselves, are unbreakable14, and there are many applications where codes are preferred over ciphers. In fact, wherever practical, codes should be used before ciphers are employed but codes have fixed meanings and, unless they expand to a size approximately equivalent to a language (which is a complex type of code), they have a limited and frequently insufficient scope. Linguistic codes, such as the brilliant Idiot's Code15 are in fact redundant when used within a cipher. However, nonlinguistic codes, where meanings are assigned to a short series of symbols, classically three to five per group, can be imbedded to reduce operator encryption and decryption workload and increase clarity.

13

The Adams Cable Codex, https://archive.org/details/adamscablecodex00cogoog and Bentleys Complete Phrase Code, https://archive.org/details/bentleyscomplete00bentrich are examples that are used today for various purposes. 14 Codes represent value by assignment, having no intrinsic value, whereas ciphers represent value imbedded in symbols by method. 15 http://en.wikipedia.org/wiki/Idiot_code#Idiot_code
A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4!

<

Another benefit of imbedding a nonlinguistic code within ciphertext is that it prevents the compromise of the code phrase through observed activity. For example, if a subject repeatedly receives the numerals 335 sent in the clear on a routine basis, and upon receipt s/he immediately goes to the Skinny Bridge in Amsterdam at 1000H local time, the meaning of the code phrase can be inferred through multiple behavioral observations. Imbedding a code within an OTPC, where the resulting ciphertext for the same repeated code phrase would always be unique for every instance, helps prevent associations between the code phrase and the directed action, reducing observationally supported associations that can render specific code phrases ineffective over time. In Summary: To re-emphasize, brevity is the opposite of clarity; the plaintext should be designed foremost to be clear while being as short as possible. The primary advantages of imbedding code phrases within hand-operated ciphers are that the work to operate the cipher is shortened, clarity is improved, and the potential for operator-induced errors is reduced. Keep in mind that codebooks are useful to the opposition only if they are in possession of the original or decrypted plaintext and the codebook. The codebook could be openly published, and many are, since there is no detectable relationship between the OTPC ciphertext and the contents of the codebook. Worksheet Setup Laying out a worksheet speeds up processing, reduces error propagation, and helps track down errors and correct them as they are discovered. Copy and use the sample form (worksheet, see the Appendix) for several practice sessions and become familiar with it and the cipher's workflow before using it for critical traffic or modifying it. It was developed through extensive testing to be easy to remember and simple to create with nothing but pencil and paper, and it supports efficient workflow. Everything about the form is easily modifiable as better ideas are developed. The form is designed for a maximum plaintext length of 175 characters on an 8.5 x 11, or A4 page, but more plaintext characters can be comfortably processed through encryption or decryption by using additional pages. Using ! inch or 6mm square grid paper, considered necessary, helps reduce errors. Plain paper has been used in testing but it is, of course, essential that rows and columns be kept absolutely aligned. Grid squares smaller than ! inch are especially hard to use in low light levels under poor conditions, especially when eyesight variation between operators is considered. The following instructions for cipher operations are not complex, but accuracy is extremely important, especially in copying the random key vector into the form. An offset of even one key numeral will render the subsequent plaintext unrecoverable by the recipient. In Summary: The time penalty to prepare a form, or worksheet, is negated by the increases in accuracy and efficiency for each stage. The overall process is faster because tracking and correcting errors is much easier during the mandatory rechecking process. The more sensitive or critical the data, the more important it is to check the work, catching and correcting errors as early in the process as possible. The form also organizes workflow, keeping it consistent message to message.

A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! => The OTPC Key Development Process

Creating OTPC Keys

OTPC Keys are created using mechanical means that have been thoroughly researched and proofed to ensure they produce cryptographically viable random vectors sufficient to produce unbreakable ciphertext. The method uses ten 10-sided dice and a specified 10d10 rolling event process and environment. Keys can be thought of as an infinitely long vector where subsections of it are used for encryption. The random key vector becomes a precious object and must be guarded as soon as it is created and distributed to operators because messages encrypted with any proper OTPC key are not recoverable by any means without the key used to encrypt them.16 Precision is critical when indexing OTPC keys. An offset of one in either direction will result in an unrecoverable ciphertext while a single substitution only effects one character of plaintext. Keys used for communication between two or more stations can be kept in a key book with one key per message on one individual page or group of pages for long messages. When destroyed after encryption, only the key for that message is destroyed. When OTPC keys are created for archiving data, the archivist keeps the keys in a key book that has multiple keys on one page. The latter method requires a slightly more complex indexing system and is detailed first. The former method simply requires that one key per message be kept on one page, so the indexing system is simpler. This method is explained last. Both methods utilize 10-sided dice as a random number generator and the method defined here is not exclusive; other proven-random rolling techniques may be used. Multiple keys per page are normally used to encrypt communications messages but for archiving, the key cannot be destroyed after encryption. Read through and understand the entire key generation instruction set before proceeding. OTPC Random Vector Key Creation. Place ten 10-sided dice, available at game stores, in a feltlined dice cup and shake them while inverting the cup at least five times before rolling them (10d10) so they leave the cup from a height greater than 7.6 cm/3 in. onto a felt-lined square surface measuring not less than 61 cm/2 ft. per side having a felt-lined backstop on one side that is 12.7 cm/5 in. high with enough force that all 10 dice rebound from the backstop but remain on the felt surface. With a ruler or other convenient straight-edged device, move the dice toward the backstop until all of the dice are sufficiently aligned enough to be read in a sequence while being careful not to rotate any dice. Read the sub-vector from left to right (or, arbitrarily, right to left) and write it onto a piece of grid paper and repeat the process, concatenating sub-vectors to produce a continuous random vector. Indexing multiple keys per page. Fill a sheet of ! inch grid paper with the concatenated random vector, leaving two rows of empty squares at the top and bottom of the page with each row containing 30 numerals as shown on the partial key page in Figure 4. Mark the top of the page with the keypad name. Then move down the page, marking off groups every 10 rows with a line across the page. If using ! inch grid squares on 8.5 x 11 inch paper, there will be 4 groups of 10 rows containing 30 numerals per tow with a margin of approximately two empty rows of squares at the top and bottom. Mark these groups as 1 through 4, using Gn written in the margin at the start of each group.
16

http://www.bbc.co.uk/news/uk-20456782 and Reference Links herein.

A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! == Mark off divisions of five numerals across the page, resulting in six columns of five numerals. See the partial key page shown in Figure 4.

Figure 4. Part of a key page for keys used in multiple messages, normally used for archival purposes.

Since each Group contains 300 numerals, it is probable that a key Group will provide keys for more than one message. The keys for multiple messages encrypted within one Group can be separated using a Key Designator, which is the first 5 numerals at the start of a keys vector. The Key Designator is not used to encrypt plaintext, but is solely an indicator for the start of a key within a Group and the squares containing it are usually outlined at the time of encryption to separate the Key Designator from the message key itself. Indexing data on an encrypted message must show, !!! ! !!!!! !!!!!!!!!!!!! !! !! !! !! where, for example, P28/G2/66143 at the start of a message tells us that the key can be found on Pad 28, in Group 2, starting after designator 66143. Never include the Key Designator as part of the key used to encrypt the message. The Key Designator functions as an indexing start code, not part of the key, and therefore sending it in the clear has no effect the security of the ciphertext. While it is remotely possible in any random sequence to have a five-numeral duplicate Key Designator inside one Group, it isnt probable. However, if this occurs simply cross off the duplicate Key Designator and use the next five numerals instead. If a duplicate Key Designator happens to occur in different groups, no special handling is necessary as the Group number will be different for each Key Designator. Finally, when possible, highlight the sections of used key with alternating colors as messages are encrypted. For archived ciphertext where the key is kept in a separate, secure location17 by the operator, the Key Designator on the encrypted message can be color-coded with the same highlight color as its key on the key book page, making decryption faster and easier.
17

OTPC ciphertext can be archived openly on Internet services that provide virtual drives with no concern that it will ever be decrypted except by the key holder.
A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! =5 Indexing OTPC Communications Keys. A different method of key indexing is typically used when OTPC keys are employed for data in motion between two or more recipients. Normally, communications keys (comm keys) are destroyed immediately after they are used to encrypt traffic, so the key for each message can be kept by itself on a single key book page or group of pages designated for one message. The key book identification and page number then become the only index elements necessary for the recipient to decrypt the message from a duplicate key book as, for example, Key Book KX112, page 110. It isnt necessary to include a length variable because the key is only as long as the message it encrypts, so the operator discards any key left over on a page or group of pages designated for each message. In fact, the usual practice in most deployments of the OTPC was simply, encrypt the message and then destroy the key pages. The message can no longer be decrypted at the point of origin and, if the opposition seized the remaining key, it would only contain unused key vectors. However, those unused random key vectors allow the decryption of messages sent from the remote encryption station to the locally compromised location, and more importantly, the opposition can send false messages out to the remote receiving station making it appear that the local station was still in normal operation. This technique was successful many times with a notable historic case during WWII just prior to the Normandy Invasion when the Allies sent a series of false and misleading intelligence about landing points and times to German intelligence operatives who believed the false information to be true. As mentioned above, either method can be used for encrypting data in motion, but its more difficult to destroy a key occupying one portion on a page of many than it is to destroy an entire key page or pages containing only one key per message. Obviously, the key destruction upon encryption method cannot be used for encrypted archival data or in cases where the originator wants to later decrypt a sent message where keeping the ciphertext for some time is required. In Summary: The creation of OTPC keys without using electronic means is typically laborious and slow as compared to electronic key production. Non-electronic (hand operated) methods to create OTPC keys using relatively fast methods should be regarded with skepticism18. Once a keypad has been created, it is important to apply an indexing system to the keys associating them with the messages they encrypt for both archival messages where the keys are kept in a secure ecosystem by the archivist and between parties receiving distributed encrypted traffic where the comm keys are routinely destroyed after encryption. Therefore, deciding upon a method for indexing keys and key books must take into consideration the required method of destruction or secure preservation of the keys. Keys for a hand-operated OTPC must never be kept in electronic form at any time. Keys that are destroyed must be incinerated in a macerator leaving no cohesive ash, or alternatively, written on commercially available magicians flash paper (thin paper soaked in potassium nitrate and dried) that provides a viable method of incendiary destruction by leaving no useable ash.
18

There are advanced mechanical processes currently in research for the instantaneous creation of large fields of random numbers at molecular and atomic levels. Work has been done and is continuing for a method using laser beams reflecting through an artificial crystal and other materials for reading random bits from a diverse randomly-organized renewable physical medium. These methods require electronic instruments to read the key media and the output is a binary random vector file. Whenever computers are involved in key production or storage, security is drastically reduced, and in most cases, to zero without appropriate countermeasures.
A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! =6 The OTPC Process Encryption Message processing. After the plaintext message has been designed emphasizing brevity without sacrificing clarity and codebook codes have been inserted to advantage, write the resulting final plaintext into the form at the top of the page without spaces as shown in Figure 3. For our message example we'll use this plaintext, MEET JOHN DOE IN SINGAPORE WITH STOLEN TOP SECRET DATA IN BRIEFCASE TOMORROW MORNING AT THE USUAL TIME AND PLACE With codes from Table 2 (below) inserted, we have, MEET 99764 IN 99775 WITH STOLEN 99599 DATA IN BRIEFCASE 99545 AT 99223 The 99 at the beginning of the five-numeral strings indicate that the following three numerals relate to a codebook entry. In this example, codes and their meanings are as follows: 764 775 599 545 223 JOHN DOE SINGAPORE TOP-SECRET TOMORROW MORNING THE USUAL TIME AND PLACE
Table 2. Designated codes.

It is always best to separate codes within sentences when possible, especially if the plaintext is designed with no spaces. When two code designators and their codes follow each other it is much more difficult for the recipient to visually interpret them even though the code designator, 99, separates the codes. Because, as noted before, the conversion table causes a necessary expansion in order to convert a larger character set into a smaller one, it becomes important to construct messages that are efficient and compact without becoming unclear. Codes are valuable in restricting expansion and can increase understanding through proper message and codebook design. As in the original codebooks for telegraph messages, entire paragraphs, addresses, personnel descriptions, and actually any text can be represented by a three or five character or digit code. Frequently, entire files and complex operations19 have been assigned a short unique codename. It is evident that codes take more of an operators time because each entry must be looked up in the pre-distributed codebook and then translated into meaningful plaintext, but an additional measure of clarity and a reduction in the length of the ciphertext are gained as compensation.

19

See WWII European Landing Operations codes for historic examples.

A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! =7 Without codes in our example, we would have a large expansion through the conversion table to 121 numerals that represent the non-coded words without spaces, thus: M W D E E T J I T H O H N D O E I N S I N G S E C A P O R E

89 7 7 2 86 4 85 3 82 4 7 5 3 6 5 3 84 1 94 4 0 7 S T O L E N T O P C R E T 94 5 2 85 6 2 4 88 7 3 2 4 90 6 7 81 0 7 2 A T A I N B O R R O W E U S U R I E F M A S E 82 1 2 1 5 3 80 0 5 7 83 81 1 6 7 T O M A T T H O R N I N G A L P L A C E A N D T I M E 2 4 89 4 0 0 4 94 89 4 0 3 5 3 84 1 2 2 85 7 92 6 92 1 88 90 88 1 81 7 1 3 82 2 5 89 7
Table 3. 121 numerals converted without codes and code designators and without spaces.

With code designators, codes, and without spaces, we have only 66 numerals: M W D E E T 9 9 7 6 4 I N 9 9 7 7 5 I T H S T O L E N 9 9 5 9 9 C A S E

89 7 7 2 9 9 7 6 4 5 3 9 9 7 7 5 94 5 2 85 6 2 4 88 7 3 9 9 5 9 9 A T A I N B R I E F 82 1 2 1 5 3 80 0 5 7 83 81 1 6 7 9 9 5 4 5 A T 9 9 2 2 3 9 9 5 4 5 1 2 9 9 2 2 3
Table 4. Shows 66 numerals converted from coded plaintext without spaces.

Embedding codes in our example plaintext results in a reduction of 55 numerals of intermediate ciphertext as compared to using non-coded words reducing both encryption and decryption workloads, appreciably decreasing error propagation, and decreasing the possibility of transmission and reception errors. Since there is a provision for the space character in the Conversion Table, it is possible to convert spaces in the plaintext. However, spaces add a 4:1 length penalty because a Switch Indicator and a space designation are required, where a space equals 9890. Therefore, spaces are eliminated unless they are essential to support clarity. By this measure, spaces are unnecessary in our example since the meaning of the plaintext with code support is clearly understood.
A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! =8 The code indicator, 99, can sometimes be eliminated as well. If absolute clarity is important, the 2-numeral length penalty per code incidence may be acceptable and even essential when other non-code indicating numerals are present in the message such as a time reference, numeric address, or phone number. Another benefit of embedded codes is that they provide a false indicator of the actual message length. While not a direct measure of message security, it is more difficult to analyze encrypted traffic containing codes using assumptive, historic, or probable message content when the actual length is unknown. Note that the conversion ratios in our example apply only to this conversion table. Any other conversion tables may be used that provide different conversion properties. In some conversion tables, for example, a space is assigned only one or two numerals instead of four. Message Design Note: The addition of codes divides the message into two sections, plain instructions (What to do), and a coded location (Where to meet). This is excellent message design, allowing for the possibility that some form of compromise may occur. If the opposition obtains the cipher keys, the Codebook is still required to know the location. If the Codebook is compromised but the cipher keys remain secure, the encrypted imbedded code cannot be determined from the Codebook. If the decrypted plaintext is compromised but the Codebook remains secure, only the instructions have been revealed.

As an additional refinement, the phrase THE USUAL TIME AND PLACE gives no indication in the message as to what time or where the meeting is to occur. Each one of these design elements helps to increase the security of the information while forcing a higher workload (and a larger budget requirement) upon the opposition. Plaintext conversion. Returning to our form, vertical bars divide the plaintext to be processed into groups of 5 by convention, but any length could be used including no divisions at all. However, it is much easier to transmit or copy a random vector if some grouping is used. Some operators prefer groups of three because human visual perception tends to automatically group similar items into collections of three, but groups of five have been the standard for many years and convention in this instance doesnt effect cipher security in any way. Copy the plaintext with imbedded codes into the top row of squares on each line of the form. Note that the code designators and code numerals are not translated through the conversion table as standard numerals would have been; this saves message space as all standard numerals expand 2:1 through the conversion table. Next, translate the characters and numerals through the conversion table, remembering not to convert code designators and codes, and write the results below the plaintext rows in the manner shown in Figure 6. Use the conversion table for practice, but refer to Table 4 for verification of the converted numerals. With frequent use, many operators memorize the conversions and can complete the work without referring to the conversion table.

A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! =9 Note that when a converted plaintext character requires more than one space on the form, blank spaces are used so that the plaintext can be visually associated with its conversion. This practice speeds up accuracy checking and is shown by the plaintext spacing in Tables 3, 4, and Figure 5.

Figure 5. Plaintext entries clearly associated with conversions to aid error checking and correction.

When the conversion is done and checked at least once, obtain the message key. If its an archive key, skip the first group of five numerals of the key (used for an index). If its a comm key, start at the top of a new message page. Copy the random key vector into the row of spaces below the numerals of the plaintext conversion. For our example, well use an archive key. On the archive key page, if the key is written in groups of five as it is in our example, mark out the remaining numbers in the final 5-numeral group if the message ends leaving a remainder. In this example, our message is 66 numerals long and therefore 66 key numerals are required leaving a final key group with a remainder of four unused key numerals, thus: 60117 51682 The gray-highlighted numerals are erased or marked off and never used in another message. This method provides for clean indexing of the continuous random key especially when multiple messages are encrypted from the same key page. To re-emphasize, if the key is to be destroyed, do so without leaving any traces such as ash or paper bits (if a shredder is used), meaning that the paper bits or page must be incinerated in a macerator so that there is no cohesive ash residue, or alternatively, magicians flash paper can be used as it burns without residual ash as noted above. If the key is to be kept for archival or other reasons, outline or highlight the used key maintaining readability. The page or pad number, group number, and key designator need to accompany the ciphertext in the clear so it can be decrypted in the future. If the key is lost or destroyed, the ciphertext will never be decrypted by any means.
Page/Pad Number P28 Group Number G2 Key Designator 66143

Table 5. Pad Number indicates the key pad used, group number, and key designator for the example key.

A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! =: This information, separated by forward slashes, is written at the top of the form to be included with the ciphertext as the string P28/G2/66143, shown highlighted in yellow on our example. When using a comm key, only the key book identifier and page number need to be sent with the ciphertext. When the length of an encrypted message uses only a portion of a page of key, the remainder of key on that page is usually marked off and not used20. The next message will begin at the top of a new key page. If more than one message is encrypted per one-sided page in the key book, the pattern of key use converts to the archive method making key destruction problematic. Encryption. The form will now have the top three rows in each row section filled in with plaintext, converted plaintext, and a random key vector as long as the converted plaintext leaving the final row in each section blank that will contain the final numeric ciphertext. To encrypt the converted plaintext, we subtract !!"# !!"!!" the key numeral from the converted plaintext numeral, writing the result in the square directly below each key numeral. Refer to the completed ciphertext shown in Figure 6.

Figure 6. The form portion showing completed ciphertext in the last row of each section.

After subtraction (mod10) as indicated by the green highlight, Figure 6, the final ciphertext is, 86170 55652 55222 99266 48082 58849 62113 38873 37934 07471 59188 63887 69815 8 Decryption. The process for decrypting this numeric OTPC is the encryption process in reverse, with the exception that the key is added !"# !!" to the ciphertext to recover the intermediate ciphertext. The conversion table is then used to convert the intermediate ciphertext into plaintext, and then the meanings of the codes are applied to recover the plaintext. The recovered plaintext can be written into the space at the top of the form as the coded meanings are inserted.
20

The exception is that when key is in short supply, provision can be made for starting a new message directly after the previous one by any of several types indexing arrangements known by the cipher group. Key books should conservatively provide 300% of the maximum estimated key use to handle emergencies and overages. 21 See http://en.wikipedia.org/wiki/Modular_math
A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! =; In summary, to encrypt: 1. 2. 3. 4. 5. Design the plaintext message to be as short as possible without sacrificing clarity. Apply necessary codes to reduce message length and increase clarity. Eliminate spaces except where absolutely necessary. Write the plaintext into the top row of each row section of the provided form. Convert the plaintext into intermediate ciphertext using the conversion table, writing the conversions below and aligned with each plaintext character. 6. Write the key index string at the top of the form in the spaces provided (be certain to use the same method known to all cipher group members). 7. Write the OTPC key vector into the third row of each row section, one key numeral for each converted numeral. 8. Subtract !"# !!" each key numeral from each plaintext numeral. 9. Recheck the work, detecting and correcting any errors. 10. Transfer the ciphertext into any distribution media and distribute to key group members. In summary, to decrypt: 1. The work progresses from the bottom of each row section to the topmost row. Write the numeric ciphertext into the last row in each row section. 2. Using the key and indexing system, obtain the OTPC key vector and write the key into the row directly above the ciphertext in each row section. 3. Add !"# !!" each ciphertext and key numeral together, writing each result in the space directly above each key numeral. 4. Use the conversion table with the intermediate ciphertext to convert it into plaintext. Adjust the spacing as the plaintext is written to increase clarity. 5. Look up the indicated codes and write the meanings into the message using the clear space at the top of the form. 6. Recheck the work. Pay careful attention to the conversion through the table, as it is easy to make mistakes at that stage. Dont mistakenly convert the code designators and codes into standard numerals. Multi-Layered (Shared Secret) Encryption Definition. Multi-Layered or Shared Secret encryption is a process for which the OTPC is remarkably suited. In fact, its easier to perform with a OTPC than with other types of ciphers. As an example, lets say that a group of three people wish to keep information safe that is to be stored in public access, but they want to assure that all members or their representatives are present for its decryption. If one or more members are absent, it is agreed that decryption cannot take place by any other member. Each member of the group has a personal OTPC key and, in any order, the first person encrypts the information and then the others follow using their personal keys. Any one member of the group cannot decrypt the resulting ciphertext; all members must be present and perform a serial decryption, again in any order, using their personal keys to recover the information. Variations. There are numerous variations to this encryption process. In one, each member adds some plaintext information to the ciphertext prior to the encryption of each stage. In this way, each stage of decryption reveals a piece of information not available to any member directly with a body of core ciphertext that is only recovered after the final decryption.
A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! =< In another, a message may be encrypted to the head of an organization at the first layer, and a subsequent layer can contain encrypted instructions meant for a secretary to decrypt to determine the recipient. When the secretary receives the message, s/he decrypts it, revealing the recipients name and instructions, along with some payload ciphertext to be delivered, but s/he cannot decrypt the payload message. If the encrypted message is intercepted, none of the two layers of information can be decrypted by any means without the secretarys and recipients keys. In fact, information for an entire organization or orders for a complete military unit can be encrypted with multiple layers all contained within a master ciphertext. Each stage is only useable by the authorized person who has the key for that stage, and if layers happen to be delivered in error to the wrong personnel or viewed by unauthorized personnel while in transit, no damage is done because non-authorized personnel cant decrypt the traffic without keys. If one is unfamiliar with this process, there is a demonstration of the basic principle in Table 6 that shows a series of eight numerals encrypted thrice by subtraction !!"# !!"! and decrypted by addition !!"# !!"! using three different keys in a different order each time. The plaintext results in each process are identical, even though the intermediate stages show varying ciphertext. Even without using basic math, clear logical extension indicates that complex paths can be set up that are suitable to protect information to any depth using Multi-Layered Encryption.

Table 6. The simplified principles of Multi-Layered Encryption.

Its easy to imagine any number of permutations for this encryption process, and it works perfectly with this hand-operated OTPC as well as with AlphaCipher or any other electronic or hand-operated version of a OTPC.

A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! 5> In Summary: The use of Multi-Layered Encryption (Shared Secret Encryption) allows for the finite control of critical information within a group or organization. The provision for allpresent group encryption/decryption of critical data and the capability to layer vital or secret information with non-critical data throughout a company or organization offers top-level management (i) verification of responsibility for each recipient of the information, (ii) assurance of delivery because only the designated recipient who possesses the correct key can decrypt the information meant for them, regardless of the depth of the distribution tree, and (iii) levels of control where instructions or other information can be kept separated from the payload, all of which is contained in the master ciphertext released from one distribution point. Closing Remarks The elegant and simple, yet unbreakable One-Time Pad Cipher is the premier cipher for all future use with critical information. Hand-encryption methods will never go out of style because paper is not hackable and the OTPC is relatively simple to operate. Key bulk issues remain with paper methods, but this has been shown by historical events to be a minor issue compared to the effectiveness and perfect message security the OTPC provides. A large volume of work has been published and is available on the Internet about the OTPC. Try http://en.wikipedia.org/wiki/One-time_pad for a semi-accurate beginning, and then follow up with the many references to be found in, where else, the Reference section of this paper. General Principles of Cipher Operation ! Always double-check counting and calculations, no matter how simple they may appear. ! Make certain everyone in the cipher group is using the same set of rules, keys, and codes. ! Spot check the work throughout the encryption process and again after it's completed. ! Review transmission and reception protocols to assure clear transfer of the ciphertext to the recipient(s). ! If communications are covert22, make certain the pickup procedures and drop zone warnoffs are agreed upon and clearly understood. ! If communications are clandestine, be certain that the send and receive points are secure and unobserved. Never assume that if you don't see anybody watching, nobody is watching. Look up. Ground-based computer-enhanced hi-res telephoto lens video, microsatellite surveillance, and long-distance drone surveillance are common today. Assume there is no privacy if you can see the open sky regardless of weather. ! If communications are open, the ciphertext can be sent via email or any other means. ! If the ciphertext is to be archived, any online or paper-based storage may be utilized. ! Never use a computer or other electronic device, with the exception of the HP49 or HP50 Graphing Calculators (no net connection, low radiation signature), to encrypt anything. If electronic encryption must be used, employ a computer that has had its net-access antenna removed and is operated in a shielded environment such as a grounded Faraday cage, or use a Tempest Computer23. Deploy a USB device with a secure OS and Stealth technology where the device is not registered by the host computer for data transfer.
22

Covert communication means that the ciphertext can be set as-is, without the ciphertext being disguised. Clandestine communications means that the ciphertext cannot be revealed and must be sent hidden in something else, such as a picture or design. 23 http://www.webopedia.com/TERM/T/Tempest.html or http://www.apitech.com/product-classes/sst-emcon-tempestcomputers
A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! 5= Kerckhoff's Laws In 1883 Auguste Kerckhoffs wrote two journal articles in La Cryptographie Militaire in which he stated six design principles for military ciphers. These principles were used in the designs of the RAMBDICT and the OTPC process methods. 1. The system must be practically, if not mathematically indecipherable; 2. It must not be required to be secret, and it must be able to fall into the hands of the enemy without inconvenience; 3. Its key must be communicable and retainable without the help of written notes, and changeable or modifiable at the will of the correspondents; 4. It must be applicable to telegraphic correspondence; 5. It must be portable, and its usage and function must not require the concourse of several people; 6. Finally, it is necessary, given the circumstances that command its application that the system be easy to use, requiring neither mental strain nor the knowledge of a long series of rules to observe. Comments: 1. The OTPC meets this law, as it is unbreakable when used with cryptographically significant random keys and the keys are never, under any circumstances, reused. 2. The OTPC method has been published for over 100 years. Knowledge of its method has no detrimental effect on its fundamental value or security. 3. There is an issue here, in that long random sequences are not easily memorized. While there are people who have this remarkable capability (photographic memory, trained or natural), they are rare. Usually, new areas of memory must be tied into previous mental reference points and a random vector offers no such reference points, especially when the sample sized is immense. The OTPC does not meet part one of this law. However, it does stand under part two. The keys used are changeable as long as the cipher group communicates clearly, either through the message header or through coded communications, about which keys are in use for any single message. 4. The ciphertext created by this OTPC method is a vector of series of random digits that are electronically peripatetic. 5. The OTPC is the easiest ciphers to transport, requiring only a key book and optional codebook, pencil, and paper. The key book and codebook can be compact, easy to destroy, and lightweight. 6. The OTPC is one of the easiest ciphers to use and this fact, combined with the characteristic that it is unbreakable, makes it the most elegant cipher design of all.

A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! 55

Appendix
The Manual One-Time Pad Cipher Blank Worksheet (Form)

The blank worksheet is included here for open use, copying, or modification. If modified, especially if functionality is improved, the author encourages sharing the improvements with the public.

A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! 56

A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! 57
List of Figures

Figure 1 Figure 2 Figure 3 Figure 4 Figure 5 Figure 6 Figure 7

List of Tables

The Conversion Table character set. Example Conversion Table. Ten 10-sided dice, a.k.a. pentagonal trapezohedron or deltohedron. Part of a key page for keys used in multiple messages, normally for archival purposes. The plaintext with codes entered into the form. Plaintext entries clearly associated with conversions to aid error checking and correction. The form showing completed ciphertext in the last row of each row section. Decryption success percentages for messages intercepted by year over a total sample of hundreds of thousands of messages. Designated codes. 121 numerals converted without codes and code designators without spaces. Shows 66 numerals converted from coded plaintext without spaces. Page Number that also indicates the key pad used, group number, and key designator for the example message. The simplified principles of Multi-Layered Encryption.

Table 1 Table 2 Table 3 Table 4 Table 5 Table 6

References

1. Hand-Operated Ciphers, http://www.cryptomuseum.com/crypto/manual.htm 2. Military Cryptanalysis, Parts 1 through 4, by William F. Friedman (NSA Documents and Research, circa 1950) 3. The Codebreakers, by David Kahn (Scribner, 1996) 4. Psychology of Intelligence Analysis, by Richards J. Heuer, Jr. (Center for the Study of Intelligence, CIA, 1999.) 5. Cryptanalysis, A Study of Ciphers and their Solution, by Helen Fouche Gaines. (Dover Publications, 1959) 6. Applied Cryptography, Second Edition, by Bruce Schneier (John Wiley & Sons, 1996) IBN 0471-11709-9 7. Hand-Operated Ciphers and Their Weaknesses and Strengths, by John Campbell Stewart, (Center for the Study of Intelligence, CIA, 1998) 8. Developing Non-Computer-Based Random Hand Cipher Key Elements, by Wolfgang Hammersmith, White Paper, 2011, (Limited distribution, 10 May 2013). 9. The Simon and Speck Families of Lightweight Block Ciphers, by Ray Beaulieu, Douglas Shors, Jason Smith, Stefan Treatman-Clark, Bryan Weeks, Louis Wingers (National Security Agency, 19 June 2013, required notice: This paper is a product of the NSA Research Directorate.)
Links:

1. 2. 3. 4. 5. 6. 7.

http://www.random.org/analysis/ http://home.ubalt.edu/ntsbarsh/Business-stat/otherapplets/Randomness.htm http://www.phy.duke.edu/~rgb/General/dieharder.php http://csrc.nist.gov/groups/ST/toolkit/rng/index.html http://www.billthelizard.com/2009/05/how-do-you-test-random-number-generator.html http://www.cafeaulait.org/books/jdr/examples/9/9.1.html http://www.dailymail.co.uk/news/article-2226203/Skeleton-hero-World-War-II-carrier-pigeonchimney-secret-coded-message-attached-leg.html 8. http://www.bbc.co.uk/news/uk-20749632

A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! 58
Wiki References:

1. http://www.pro-technix.com/information/crypto/pages/vernam_base.html 2. http://www.cryptomuseum.com/crypto/otp.htm 3. Shannon, Claude (1949). "Communication Theory of Secrecy Systems", Bell System Technical Journal 28 (4): 656715. 4. Miller, Frank (1882). Telegraphic code to insure privacy and secrecy in the transmission of telegrams. C.M. Cornwell. 5. Bellovin, Steven M. (July 2011). "Frank Miller: Inventor of the One-Time Pad", Cryptologia 35 (3). doi:10.1080/01611194.2011.583711. Retrieved 2011-08-03. 6. Kahn, David (1967). The Codebreakers. Macmillan, pp. 3978. ISBN 0-684-83130-9. 7. "One-Time-Pad (Vernam's Cipher) Frequently Asked Questions, with photo". Retrieved 200605-12. 8. Savory, Stuart (2001). "Chiffriergertebau : One-Time-Pad, with photo" (in German). Retrieved 2006-07-24. 9. John Markoff (July 25, 2011). "Codebook Shows an Encryption Form Dates Back to Telegraphs". New York Times. Retrieved 2011-07-26. 10. Marks, Leo (1998). Between Silk and Cyanide: a Codemaker's Story, 1941-1945. HarperCollins. ISBN 0-684-86780-X. 11. Sergei N Molotkov (Institute of Solid-State Physics, Russian Academy of Sciences, Chernogolovka, Moscow region, Russian Federation) (22 February 2006). "Quantum cryptography and V A Kotel'nikov's one-time key and sampling theorems". Physics-Uspekhi (Institute of Solid-State Physics, Russian Academy of Sciences, Chernogolovka, Moscow region, Russian Federation) 49 (7): 750761. doi:10.1070/PU2006v049n07ABEH006050. Retrieved 2009-05-03. PACS numbers: 01.10.Fv, 03.67.Dd, 89.70.+c and openly in Russian "#$%&'#$( )*+,&'-*$.+( + &/'*/01 2.3. "'&/45%+)'#$ '6 '7%'*$8'#19 )4:;$9 + '6 '&<;/&$9. =>? 12. Spycraft: The Secret History of the CIA's Spytechs, from Communism to Al-Qaeda p. 452. 13. The actual length of a plaintext message can hidden by the addition of extraneous parts, called padding. For instance, a 21-character ciphertext could conceal a 5-character message with some padding convention (e.g. "-PADDING- HELLO -XYZ-") as much as an actual 21-character message: an observer can thus only deduce the maximum possible length of the significant text, not its exact length. 14. Shannon, Claude E. (October 1949). "Communication Theory of Secrecy Systems". Bell System Technical Journal (USA: AT&T Corporation) 28 (4): 656715. Retrieved 2011-12-21. 15. Schneier, Bruce. "One-Time Pads". 16. Information theoretic security: Third International Conference, ICITS 2008 ... By Reihanah Safavi-Naini[, p.224 17. "The Translations and KGB Cryptographic Systems" (PDF). The Venona Story (Fort Meade, Maryland: National Security Agency). 2004-01-15. pp. 2627 (2829th of 63 in PDF). Retrieved 2009-05-03. "...KGBs cryptographic material manufacturing center in the Soviet Union apparently reused some of the pages from one-time pads. This provided Arlington Hall with an opening." 18. A "way to combine multiple block algorithms" so that "a cryptanalyst must break both algorithms" in 15.8 of Applied Cryptography, Second Edition: Protocols, Algorithms, and Source Code in C by Bruce Schneier. Wiley Computer Publishing, John Wiley & Sons, Inc. 19. Introduction to modern cryptography, J Katz, Y Lindell - 2008 - cs.biu.ac.il 20. Klein, Melville (2003), "Securing Record Communications: The TSEC/KW-26" (PDF). NSA. Archived from the original on 2006-02-13. Retrieved 2006-05-12. 21. Kahn. The Codebreakers. p.715. 22. "http://www.seas.harvard.edu/courses/emr12/4.pdf, p. 91"

A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.

!"#$%&#'()*+,-#.%/!&%0/1%231!&4! 59
23. "The Venona Translations" (PDF). The Venona Story (Fort Meade, Maryland: National Security Agency). 2004-01-15. p.17th (of 63 in PDF) but marked 15. Retrieved 2009-05-03. "Arlington Halls ability to read the VENONA messages was spotty, being a function of the underlying code, key changes, and the lack of volume. Of the message traffic from the KGB New York office to Moscow, 49 percent of the 1944 messages and 15 percent of the 1943 messages were readable, but this was true of only 1.8 percent of the 1942 messages. For the 1945 KGB Washington office to Moscow messages, only 1.5 percent were readable. About 50 percent of the 1943 GRU-Naval Washington to Moscow/Moscow to Washington messages were read but none from any other year." 24. "NSA Suite B Cryptography". National Security Agency. 25. Cryptography Research, Inc. (February 27, 2003). "Evaluation of VIA C3 Nehemiah Random Number Generator" (PDF). Archived from the original on 2006-03-14. Retrieved 2006-05-12. 26. Barak, Boaz; Ronen Shaltiel; Eran Tromer (2003-06-07). "True Random Number Generators Secure in a Changing Environment". Rehovot, ISRAEL: Department of Computer Science and Applied Mathematics, Weizmann Institute of Science. Retrieved 2009-05-03. End of Document V3.3.5, 24NOV13, 2106Z

A Practical Hand-Operated One-Time Pad Cipher System Copyright 2013 by Wolfgang Hammersmith, All Rights Reserved.