Topic
Book cipher
About: Book cipher is a research topic. Over the lifetime, 12 publications have been published within this topic receiving 329 citations.
Papers
3 Jan 1992
TL;DR: Two modifications of this cipher are discussed that may lead to practical provably-secure ciphers based on either of two assumptions that appear to be novel in cryptography, viz., the (sole) assumption that the enemy's memory capacity (but not his computing power) is restricted and the assumption that an explicit function is, in a specified sense, controllably-difficult to compute, but not necessarily one-way.
Abstract: Shannon's pessimistic theorem, which states that a cipher can be perfect only when the entropy of the secret key is at least as great as that of the plaintext, is relativized by the demonstration of a randomized cipher in which the secret key is short but the plaintext can be very long. This cipher is shown to be “perfect with high probability.” More precisely, the eavesdropper is unable to obtain any information about the plaintext when a certain security event occurs, and the probability of this event is shown to be arbitrarily close to one unless the eavesdropper performs an infeasible computation. This cipher exploits the assumed existence of a publicly-accessible string of random bits whose length is much greater than that of all the plaintext to be encrypted; this is a feature that our cipher has in common with the previously considered “book ciphers”. Two modifications of this cipher are discussed that may lead to practical provably-secure ciphers based on either of two assumptions that appear to be novel in cryptography, viz., the (sole) assumption that the enemy's memory capacity (but not his computing power) is restricted and the assumption that an explicit function is, in a specified sense, controllably-difficult to compute, but not necessarily one-way.
342 citations
19 May 2020
TL;DR: Hexagram frequency tables of let-ters in the English language were developed and were then a crucial factor to solving an unsolved transposition cipher of Mahon and Gillo-gly (2008), and the texts themselves were used as input to solve a book cipher of Thouless (1948) using the same scoring method.
Abstract: Project Gutenberg, begun by Michael Hart in 1971, is an attempt to make public do-main electronic texts available to the pub-lic in an easily available and useable form. The number of available texts reached 60,000 by 2019. Classical cryptanalysis methods rely on the development and use of high-quality frequency tables of letter arrangements from a variety of sources. As the amount of text grows, frequency ta-bles of higher orders can be developed and may provide more solving power for clas-sical cryptographic algorithms. As a side-e?ect of the availability of a wide range of public domain texts, we were able to develop hexagram frequency tables of let-ters in the English language which were then a crucial factor to solving an unsolved transposition cipher of Mahon and Gillo-gly (2008). The texts themselves were then used as input to solve a book cipher of Thouless (1948) using the same scoring method.
9 citations
TL;DR: This paper introduces a novel encryption technique, which is called PixSel, which uses images in place of literature as the book cipher’s key, possessing a typical ciphertext enlargement of merely 1% to 20% for text.
Abstract: In this paper we introduce a novel encryption technique, which we call PixSel. This technique uses images in place of literature as the book cipher’s key. Conventional book ciphers possess an unwieldy ciphertext enlargement, creating ciphertexts multiple times the length of the plaintext. As well, there is often the issue of a given book not containing the necessary material for the encipherment of some plaintexts. We sought to rectify these nuisances with PixSel, possessing a typical ciphertext enlargement of merely 1% to 20% for text. Using PixSel, there are also no limitations on encipherable data type, given a suitable image. Keywords—book ciphers, ciphertext enlargement, ciphertext expansion
8 citations
Journal Article•
7 citations
TL;DR: The Beale Treasure Cipher (Bl) has withstood the attacks of several generations of amateur and professional cryptanalysts as mentioned in this paper, but it may also be a hoax, as reported in this paper.
Abstract: The Beale Treasure Cipher (Bl) has withstood the attacks of several generations of amateur and professional cryptanalysts. This paper reports a statistical anomaly in Bl which suggests that it may be a hoax.
6 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2020 | 2 |
| 2018 | 2 |
| 2014 | 1 |
| 2011 | 1 |
| 2010 | 1 |
| 2008 | 1 |