'Secure, anonymous, unregulated': 'Cryptonomicon' and the transnational data haven

This essay considers how Neal Stephenson’s 1999 epic novel Cryptonomicon engages with the long-standing and complex relationship between cryptology and national/transnational identity. Cryptonomicon's layered and disjointed structure allows it to explore the impact of cryptography and cryptanalysis in the Second World War (as well as their impact on the consequent rewriting of the international political stage), to reflect on the place of technology in the recent history of cryptology, and to consider how emergent (and supposedly secure) data storage technologies not only open up planetary-wide communication traffic but also unsettle the agreed protocols of national and international law. Stephenson provides a sense of technology's global effects by offering not a straightforward narrative of the demise of the nation-state but by showing how technologies are in a process of constant negotiation with the institutions of the nation-state, drawing upon the economic, material, and intellectual resources of the nation state, while at the same time challenging notions of a bordered and coherent national identity and working to disestablish nations of their regulatory authority. The essay is informed by recent work on cryptology, data havens, globalization, transnationalism, and postcoloniality, as well as Derrida's work on archives and technology

Multi-algorithmic Cryptography using Deterministic Chaos with Applications to Mobile Communications

In this extended paper, we present an overview of the principal issues associated with cryptography, providing historically significant examples for illustrative purposes as part of a short tutorial for readers that are not familiar with the subject matter. This is used to introduce the role that nonlinear dynamics and chaos play in the design of encryption engines which utilize different types of Iteration Function Systems (IFS). The design of such encryption engines requires that they conform to the principles associated with diffusion and confusion for generating ciphers that are of a maximum entropy type. For this reason, the role of confusion and diffusion in cryptography is discussed giving a design guide to the construction of ciphers that are based on the use of IFS. We then present the background and operating framework associated with a new product - CrypsticTM - which is based on the application of multi-algorithmic IFS to design encryption engines mounted on a USB memory stick using both disinformation and obfuscation to ‘hide’ a forensically inert application. The protocols and procedures associated with the use of this product are also briefly discussed

On weak rotors, Latin squares, linear algebraic representations, invariant differentials and cryptanalysis of Enigma

Since the 1920s until today it was assumed that rotors in Enigma cipher machines do not have a particular weakness or structure. A curious situation compared to hundreds of papers about S-boxes and weak setup in block ciphers. In this paper we reflect on what is normal and what is not normal for a cipher machine rotor, with a reference point being a truly random permutation. Our research shows that most original wartime Enigma rotors ever made are not at all random permutations and conceal strong differential properties invariant by rotor rotation. We also exhibit linear/algebraic properties pertaining to the ring of integers modulo 26. Some rotors are imitating a certain construction of a perfect quasigroup which however only works when N is odd. Most other rotors are simply trying to approximate the ideal situation. To the best of our knowledge these facts are new and were not studied before 2020

The Russian Fish with Caviar

Abstract: Historians have noted that the capture of the "Russian Fish" from the Germans was probably the most important outcome of the 1945 TICOM operation. Recently declassified documents have now provided a wealth of information pertaining to this vital break into Soviet communications at the dawn of the Cold War

All the King’s Men: British Codebreaking Operations: 1938-43

The Enigma code was one of the most dangerous and effective weapons the Germans wielded at the outbreak of the Second World War. The Enigma machine was capable of encrypting radio messages that seemed virtually unbreakable. In fact, there were 158,900, 000,000,000 possible combinations in any given message transmitted. On the eve of the war’s outbreak, the British had recently learned that the Poles had made significant progress against this intimidating cipher in the early 1930s. Incensed and with little help, the British Government Code & Cipher School began the war searching for a solution. Drawing from their experiences from the First World War, and under the visionary guidance of Alan Turing, Gordon Welchman, and countless others, the British created a new, mechanical approach to breaking the seemingly impossible German code. By breaking the code, they could very well save Britain

Enigma: Simulation And Analysis Of Security

During World War II, the Enigma machine was used as a message encryption tool by the German military. While it was believed that the Enigma machine produced an unbreakable code, this turned out to not be the case. This thesis begins with a summary of six versions of the Enigma, five that were actually used in the field, and a theoretical version that would have maximized security. An analysis of security is done, in which combinatorics is used to count the number of possible unique settings for each version of the machine. Estimates are also provided for the time required to break each version of the machine using a brute-force attack with various processing speeds that were achievable at various times in history. Finally, descriptions are included of three Enigma simulators constructed for this thesis. These simulators include a three-dimensional paper simulator, a digital simulator written using the Python programming language, and an electromechanical simulator built to resemble an actual Enigma machine

A Covert Encryption Method for Applications in Electronic Data Interchange

A principal weakness of all encryption systems is that the output data can be ‘seen’ to be encrypted. In other words, encrypted data provides a ‘flag’ on the potential value of the information that has been encrypted. In this paper, we provide a new approach to ‘hiding’ encrypted data in a digital image. In conventional (symmetric) encryption, the plaintext is usually represented as a binary stream and encrypted using an XOR type operation with a binary cipher. The algorithm used is ideally designed to: (i) generate a maximum entropy cipher so that there is no bias with regard to any bit; (ii) maximize diffusion in terms of key dependency so that a change in any bit of the key can effect any, and potentially all, bits of the cipher. In the work reported here, we consider an approach in which a binary or low-bit plaintext image is encrypted with a decimal integer or floating point cipher using a convolution operation and the output quantized into a 1-bit array generating a binary image ciphertext. This output is then ‘embedded’ in a host image to hide the encrypted information. Embedding is undertaken either in the lowest 1-bit layer or multiple 1-bit layers. Decryption is accomplished by: (i) extracting the binary image from the host image; (ii) correlating the result with the original cipher. In principle, any cipher generator can be used for this purpose and the method has been designed to operate with 24-bit colour images. The approach has a variety of applications and, in this paper, we focus on the authentication and self-authentication of e-documents (letters and certificates, for example) that are communicated over the Internet and are thereby vulnerable to attack (e.g. modification, editing, counterfeiting etc.). In addition to document authentication, the approach considered provides a way of propagating disinformation and a solution to scenarios that require ‘plausible deniability’

Operation Rubicon: Germany as an intelligence 'Great Power'?

Operation Rubicon was probably one of the most successful intelligence operations of our time. Recent press revelations detail this secret partnership between the German Bundesnachrichtendienst (BND) and the American Central Intelligence Agency (CIA), focused on the purchase and control of Crypto AG. Supported by German technical giants like Siemens, the company sold and produced compromised cypher machines. This article challenges the idea that the dominant sigint powers were within the anglosphere during the Cold War. Instead suggesting Rubicon evidences that the centre of gravity for intelligence lay ‘elsewhere’. It also explores the complex ethical implications of Germany’s involvement in Rubicon

Distrust: not only in secret service organizations

In this article, we discuss the issue of distrust in the most extreme example of distrustful organizations: secret service organizations. Distrust may be a basic organizing principle in such organizations, but how is it produced and maintained? Inspired by actor–network theory, we analyzed the devices, codes, rules, and procedures used in secret service organizations, and then asked whether these devices, codes, rules, and procedures differ from those used in ordinary organizations. Based on our analysis, we make two contributions. First, we draw researchers’ attention to distrust that is intentionally built and maintained rather than distrust that is accidental and indicative of faulty management. Second, we identify the material manifestations of distrust. We argue that in future studies of trust and distrust in organizations, it will be necessary to focus on the technologies, physical objects, and quasi-objects. These, together with discourses, guarantee the stability of connections among organizational actions