DOCSLIB.ORG

Amy Bell Abilene, TX December 2005

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Amy Bell Abilene, TX December 2005 Compositional Cryptology Thesis Presented to the Honors Committee of McMurry University In partial fulfillment of the requirements for Undergraduate Honors in Math By Amy Bell Abilene, TX December 2005 i ii Acknowledgements I could not have completed this thesis without all the support of my professors, family, and friends. Dr. McCoun especially deserves many thanks for helping me to develop the idea of compositional cryptology and for all the countless hours spent discussing new ideas and ways to expand my thesis. Because of his persistence and dedication, I was able to learn and go deeper into the subject matter than I ever expected. My committee members, Dr. Rittenhouse and Dr. Thornburg were also extremely helpful in giving me great advice for presenting my thesis. I also want to thank my family for always supporting me through everything. Without their love and encouragement I would never have been able to complete my thesis. Thanks also should go to my wonderful roommates who helped to keep me motivated during the final stressful months of my thesis. I especially want to thank my fiancé, Gian Falco, who has always believed in me and given me so much love and support throughout my college career. There are many more professors, coaches, and friends that I want to thank not only for encouraging me with my thesis, but also for helping me through all my pursuits at school. Thank you to all of my McMurry family! iii Preface The goal of this research was to gain a deeper understanding of some existing cryptosystems, to implement these cryptosystems in a computer programming language of my choice, and to discover whether the composition of cryptosystems leads to greater security. The first chapter, Introduction to Cryptology, introduces several well-known cryptosystems, discusses their security, and describes how to measure the security of a cryptosystem. The second chapter, Discoveries in Cryptology, includes discoveries I have made about specific cryptosystems, compositions of cryptosystems, and the security of these compositions. In completing this work, I have discovered that: There is an easy way to generate nxn invertible matrices over Z26 which leads to a practical method of implementing Hill’s Cipher. The Affine Cipher discussed in undergraduate textbooks is a group under the operation of function composition, and the order of each Affine Cipher can be easily computed. Composition of cryptosystems can lead to either more or less security. Finally, this research has resulted in programs that allow a user to make their own cryptosystem by creating finite compositions from a set of five different cryptosystems. Through this program I have been able to analyze the security and practicality of compositional cryptology. iv Table of Contents Chapter 1: Introduction to Cryptology 1 Chapter 2: Discoveries in Cryptology 12 Appendix 28 References 31 v Chapter One: Introduction to Cryptology What is Cryptology? Krypto is a Greek word that means ‘secret’ or ‘hidden’. Therefore, cryptology is the study of encrypting and decrypting secret messages. This study can be divided into cryptography and cryptanalysis. Cryptography refers to designing cryptosystems that code and decode messages, whereas cryptanalysis is concerned with techniques used in the unauthorized decoding of messages. Cryptology is useful in transferring messages that contain sensitive material, such as military orders during wartime or personal identification information over the Internet. However, because of clever cryptanalysts and the unauthorized decoding of secret messages, development of secure cryptosystems is vital. History of Cryptology Although there is evidence of cryptology as far back as 1900 BC, detailed examples are not found until 500 BC, when Hebrew scribes recorded the book of Jeremiah using a reversed-alphabet Substitution cipher called ATBASH. The most famous early use of cryptology is Julius Caesar using a Shift cipher of three letters [Dupuis]. Known as the Caesar cipher, it is still taught in many cryptology textbooks as a special case of a Shift cipher. Classical cryptology can be defined as cryptosystems designed before the 1940s and the advent of the computer age. Classic ciphers differ from modern ciphers in that the underlying mathematics is usually much simpler. Before the development of computers, many classical ciphers were considered secure enough to use at least during some period in history. However, now computers can be programmed to carry out various attacks against classical ciphers that were before impossible. Cryptology has expanded and grown to a more complex study in an effort to develop ciphers secure enough to withstand attacks by computers. Manipulating Letters Although messages are understood through their alphabetic form, it is convenient to substitute numbers for letters to be able to manipulate and encode them. For instance, when using the English alphabet of A to Z, you can replace each letter with the numbers 0 through 25. A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Table 1 Of course, when you take into consideration using lower case, upper case, punctuation, and other symbols, more numbers are required. When messages are converted into numbers it is possible to perform a variety of mathematical operations on the numbers and then convert the numbers back into letters, hence forming a secret, unintelligible message. Uniformly Distributed Letter Cipher Many ciphers have encryption/decryption functions that allow for easier enciphering and deciphering of the message. Other ciphers, like DES (Data Encryption Standard) make use of a sequence of encryption/decryption steps. The Uniformly Distributed Letter (UDL) cipher [Lewand, p.76-79] uses the relative frequencies of English letters to create an encryption relation rather than an encryption function. For instance, the letter e has a relative frequency of approximately 0.13, meaning that in typical English texts, e appears approximately 13% of the time. The rest of the letters in the English alphabet occur in typical English texts according to varying percentages [Lewand, p. 36]. 1 Letter Relative Frequency Letter Relative Frequency A 8.167% N 6.749% B 1.492% O 7.507% C 2.782% P 1.929% D 4.253% Q 0.095% E 12.702% R 5.987% F 2.228% S 6.327% G 2.015% T 9.056% H 6.094% U 2.758% I 6.966% V 0.978% J 0.153% W 2.360% K 0.772% X 0.150% L 4.025% Y 1.974% M 2.406% Z 0.074% Table 2 Because e has a relative frequency of approximately 13%, the UDL cipher chooses 13 numbers between 00 and 99 inclusive that can be substituted for e. For example, the numbers substituted for e might come from the set, {08, 12, 20, 46, 47, 59, 64, 79, 81, 85, 90, 94, 97}. This continues until each English letter has been assigned its own set of unique number(s) between 00 and 99. The table below [Lewand, p. 78] can be used for encoding letters into numbers and decoding numbers back into letters. Letter Set of Numbers Letter Set of Numbers A 15,33,37, 55, 57, 72, 91, 96 N 06, 17, 22, 31, 49, 58 B 24 O 02, 10, 41, 51, 66, 75, 83 C 03, 39, 67 P 13,18 D 04, 43, 61, 88 Q 36 E 08, 12, 20, 46, 47, 59, 64, 79, 81, 85, 90, 94, 97 R 21, 25, 65, 68, 92, 95 F 40, 48 S 00, 28, 52, 63, 74, 78 G 29, 53 T 07, 19, 23, 35, 38, 54, 70, 84, 89 H 05, 16, 30, 42, 69, 99 U 09, 32 I 14, 45, 50, 60, 73, 82, 93 V 44 J 11 W 56, 80 K 77 X 86 L 01, 26, 71, 98 Y 62, 76 M 34, 87 Z 27 Table 3 Using Table 3 we could encrypt the word, ebenezer, to 08, 24, 12, 06, 20, 27, 46, 21. Note that each time e is encoded the next letter in the set corresponding to e is used, and when the end of the set is reached, the numbers start over again. Another method of encoding e would be to randomly choose a number from the set, {08, 12, 20, 46, 47, 59, 64, 79, 81, 85, 90, 94, 97}, with each number being equally likely to be chosen. Because many of the letters correspond to more than one number, the encryption utilizes a relation rather than a function. The UDL cipher is useful in evening out letter frequencies, which cryptanalysts sometimes use to break ciphers. In the enciphered message, each number between 00 and 99 will have approximately the same frequency and each number will have approximately the same relative frequency of 1%. 2 Substitution Cipher Like its name suggests, the Substitution cipher encodes messages by substituting each letter for a unique letter. A key for the Substitution cipher is a one-to-one correspondence between the usual English alphabet and a rearrangement or permutation of it. The key for a Substitution cipher is often expressed in table form. For example, a permutation of the usual English alphabet might be obtained by reversing the order of the alphabet (Table 4), or by using a phrase like “I LOVE MCMURRY”, with spaces and duplicate letters deleted for the first part of the key, then appending the remaining unused letters of the English alphabet in alphabetical order for the last part of the key (Table 5). A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Z Y X W V U T S R Q P O N M L K J I H G F E D C B A Table 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z I L O V E M C U R Y A B D F G H J K N P Q S T W X Z Table 5 Shift Cipher The simplest classical cipher is the Shift cipher.
Load more

Recommended publications
  • 4 Information Theory
    Jay Daigle Occidental College Math 400: Cryptology 4 Information Theory Definition 4.1. A (symmetric) encryption system is composed of: • A set of possible messages M • A set of possible keys K • A set of possible ciphertexts C • An encryption function e : K × M ! C • A decryption function d : K × C ! M such that the decryption function is a partial inverse to the encryption function: that is d(k; e(k; m)) = m e(k; d(k; c)) = c: −1 We often write ek(m) = e(k; m) and dk(c) = d(k; c). Thus for each k 2 K, dk = ek . This implies that each ek is one-to-one. Of course, some encryption systems are terrible. To be good, we'd like our cryptosystem to have the following properties: 1. Given any k 2 K; m 2 M, it's easy to compute e(k; m). 2. Given any k 2 K; c 2 C, it's easy to compute d(k; c). 3. Given a set of ciphertexts ci 2 C, it's difficult to compute dk(ci) without knowing k. 4. Given a collection of pairs (mi; ci), it's difficult to decrypt a ciphertext whose plaintext is not already known. (\known-plaintext attack"). The first two principles make a cryptosystem practically usable; the third and fourth make it secure. The fourth property is by far the most difficult to achieve. You'll notice that all of the cryptosystems we've studied so far satisfy the first two properties, and several of them do at least okay on the third, none of them achieve the fourth at all.
    [Show full text]
  • Classical Encryption Techniques
    CPE 542: CRYPTOGRAPHY & NETWORK SECURITY Chapter 2: Classical Encryption Techniques Dr. Lo’ai Tawalbeh Computer Engineering Department Jordan University of Science and Technology Jordan Dr. Lo’ai Tawalbeh Fall 2005 Introduction Basic Terminology • plaintext - the original message • ciphertext - the coded message • key - information used in encryption/decryption, and known only to sender/receiver • encipher (encrypt) - converting plaintext to ciphertext using key • decipher (decrypt) - recovering ciphertext from plaintext using key • cryptography - study of encryption principles/methods/designs • cryptanalysis (code breaking) - the study of principles/ methods of deciphering ciphertext Dr. Lo’ai Tawalbeh Fall 2005 1 Cryptographic Systems Cryptographic Systems are categorized according to: 1. The operation used in transferring plaintext to ciphertext: • Substitution: each element in the plaintext is mapped into another element • Transposition: the elements in the plaintext are re-arranged. 2. The number of keys used: • Symmetric (private- key) : both the sender and receiver use the same key • Asymmetric (public-key) : sender and receiver use different key 3. The way the plaintext is processed : • Block cipher : inputs are processed one block at a time, producing a corresponding output block. • Stream cipher: inputs are processed continuously, producing one element at a time (bit, Dr. Lo’ai Tawalbeh Fall 2005 Cryptographic Systems Symmetric Encryption Model Dr. Lo’ai Tawalbeh Fall 2005 2 Cryptographic Systems Requirements • two requirements for secure use of symmetric encryption: 1. a strong encryption algorithm 2. a secret key known only to sender / receiver •Y = Ek(X), where X: the plaintext, Y: the ciphertext •X = Dk(Y) • assume encryption algorithm is known •implies a secure channel to distribute key Dr.
    [Show full text]
  • COS433/Math 473: Cryptography Mark Zhandry Princeton University Spring 2017 Cryptography Is Everywhere a Long & Rich History
    COS433/Math 473: Cryptography Mark Zhandry Princeton University Spring 2017 Cryptography Is Everywhere A Long & Rich History Examples: • ~50 B.C. – Caesar Cipher • 1587 – Babington Plot • WWI – Zimmermann Telegram • WWII – Enigma • 1976/77 – Public Key Cryptography • 1990’s – Widespread adoption on the Internet Increasingly Important COS 433 Practice Theory Inherent to the study of crypto • Working knowledge of fundamentals is crucial • Cannot discern security by experimentation • Proofs, reductions, probability are necessary COS 433 What you should expect to learn: • Foundations and principles of modern cryptography • Core building blocks • Applications Bonus: • Debunking some Hollywood crypto • Better understanding of crypto news COS 433 What you will not learn: • Hacking • Crypto implementations • How to design secure systems • Viruses, worms, buffer overflows, etc Administrivia Course Information Instructor: Mark Zhandry (mzhandry@p) TA: Fermi Ma (fermima1@g) Lectures: MW 1:30-2:50pm Webpage: cs.princeton.edu/~mzhandry/2017-Spring-COS433/ Office Hours: please fill out Doodle poll Piazza piaZZa.com/princeton/spring2017/cos433mat473_s2017 Main channel of communication • Course announcements • Discuss homework problems with other students • Find study groups • Ask content questions to instructors, other students Prerequisites • Ability to read and write mathematical proofs • Familiarity with algorithms, analyZing running time, proving correctness, O notation • Basic probability (random variables, expectation) Helpful: • Familiarity with NP-Completeness, reductions • Basic number theory (modular arithmetic, etc) Reading No required text Computer Science/Mathematics Chapman & Hall/CRC If you want a text to follow along with: Second CRYPTOGRAPHY AND NETWORK SECURITY Cryptography is ubiquitous and plays a key role in ensuring data secrecy and Edition integrity as well as in securing computer systems more broadly.
    [Show full text]
  • Simple Substitution and Caesar Ciphers
    Spring 2015 Chris Christensen MAT/CSC 483 Simple Substitution Ciphers The art of writing secret messages – intelligible to those who are in possession of the key and unintelligible to all others – has been studied for centuries. The usefulness of such messages, especially in time of war, is obvious; on the other hand, their solution may be a matter of great importance to those from whom the key is concealed. But the romance connected with the subject, the not uncommon desire to discover a secret, and the implied challenge to the ingenuity of all from who it is hidden have attracted to the subject the attention of many to whom its utility is a matter of indifference. Abraham Sinkov In Mathematical Recreations & Essays By W.W. Rouse Ball and H.S.M. Coxeter, c. 1938 We begin our study of cryptology from the romantic point of view – the point of view of someone who has the “not uncommon desire to discover a secret” and someone who takes up the “implied challenged to the ingenuity” that is tossed down by secret writing. We begin with one of the most common classical ciphers: simple substitution. A simple substitution cipher is a method of concealment that replaces each letter of a plaintext message with another letter. Here is the key to a simple substitution cipher: Plaintext letters: abcdefghijklmnopqrstuvwxyz Ciphertext letters: EKMFLGDQVZNTOWYHXUSPAIBRCJ The key gives the correspondence between a plaintext letter and its replacement ciphertext letter. (It is traditional to use small letters for plaintext and capital letters, or small capital letters, for ciphertext. We will not use small capital letters for ciphertext so that plaintext and ciphertext letters will line up vertically.) Using this key, every plaintext letter a would be replaced by ciphertext E, every plaintext letter e by L, etc.
    [Show full text]
  • Cryptography in Modern World
    Cryptography in Modern World Julius O. Olwenyi, Aby Tino Thomas, Ayad Barsoum* St. Mary’s University, San Antonio, TX (USA) Emails: [email protected], [email protected], [email protected] Abstract — Cryptography and Encryption have been where a letter in plaintext is simply shifted 3 places down used for secure communication. In the modern world, the alphabet [4,5]. cryptography is a very important tool for protecting information in computer systems. With the invention ABCDEFGHIJKLMNOPQRSTUVWXYZ of the World Wide Web or Internet, computer systems are highly interconnected and accessible from DEFGHIJKLMNOPQRSTUVWXYZABC any part of the world. As more systems get interconnected, more threat actors try to gain access The ciphertext of the plaintext “CRYPTOGRAPHY” will to critical information stored on the network. It is the be “FUBSWRJUASLB” in a Caesar cipher. responsibility of data owners or organizations to keep More recent derivative of Caesar cipher is Rot13 this data securely and encryption is the main tool used which shifts 13 places down the alphabet instead of 3. to secure information. In this paper, we will focus on Rot13 was not all about data protection but it was used on different techniques and its modern application of online forums where members could share inappropriate cryptography. language or nasty jokes without necessarily being Keywords: Cryptography, Encryption, Decryption, Data offensive as it will take those interested in those “jokes’ security, Hybrid Encryption to shift characters 13 spaces to read the message and if not interested you do not need to go through the hassle of converting the cipher. I. INTRODUCTION In the 16th century, the French cryptographer Back in the days, cryptography was not all about Blaise de Vigenere [4,5], developed the first hiding messages or secret communication, but in ancient polyalphabetic substitution basically based on Caesar Egypt, where it began; it was carved into the walls of cipher, but more difficult to crack the cipher text.
    [Show full text]
  • Battle Management Language: History, Employment and NATO Technical Activities
    Battle Management Language: History, Employment and NATO Technical Activities Mr. Kevin Galvin Quintec Mountbatten House, Basing View, Basingstoke Hampshire, RG21 4HJ UNITED KINGDOM [email protected] ABSTRACT This paper is one of a coordinated set prepared for a NATO Modelling and Simulation Group Lecture Series in Command and Control – Simulation Interoperability (C2SIM). This paper provides an introduction to the concept and historical use and employment of Battle Management Language as they have developed, and the technical activities that were started to achieve interoperability between digitised command and control and simulation systems. 1.0 INTRODUCTION This paper provides a background to the historical employment and implementation of Battle Management Languages (BML) and the challenges that face the military forces today as they deploy digitised C2 systems and have increasingly used simulation tools to both stimulate the training of commanders and their staffs at all echelons of command. The specific areas covered within this section include the following: • The current problem space. • Historical background to the development and employment of Battle Management Languages (BML) as technology evolved to communicate within military organisations. • The challenges that NATO and nations face in C2SIM interoperation. • Strategy and Policy Statements on interoperability between C2 and simulation systems. • NATO technical activities that have been instigated to examine C2Sim interoperation. 2.0 CURRENT PROBLEM SPACE “Linking sensors, decision makers and weapon systems so that information can be translated into synchronised and overwhelming military effect at optimum tempo” (Lt Gen Sir Robert Fulton, Deputy Chief of Defence Staff, 29th May 2002) Although General Fulton made that statement in 2002 at a time when the concept of network enabled operations was being formulated by the UK and within other nations, the requirement remains extant.
    [Show full text]
  • Affine Cipher Project 1 Introduction
    Affine Cipher Project 141KECBZ0H5CRK1HUZK1CGPCR.5PUGUZU1WCU.CM1CUBHUCAK.6.Z5WCP1RK1UCH5 WC0EPU1KECU.C141KEC.UB1KXC,,RBHKV1PCWGRQ15P7CHCUHV1C.6CU9.CRGUG1P Directions: • Answer all numbered questions completely. • Show non-trivial work, and put your final answer in the box provided. • Questions without boxes should be answered in complete sentences in the space provided. 1 Introduction Cryptography is the study of secret codes, or the secure transmission of information that nobody except the desired recipient can read. By the end of this project, you will be able to decipher the quote printed above. The mathematical study of ciphers will lead us through a world in which the number line is a closed curve, and fractions do not exist. This project is designed to help you to: • read and understand definitions and notation • observe patterns and generalize • think logically, analytically, and abstractly • express problems and solutions precisely • follow examples • combine ideas to solve problems and create applications 1 2 Caesar Cipher A cipher is a function or algorithm for translating plaintext into encrypted ciphertext. Throughout history, governments and merchants have used ciphers to safely transmit sensitive information. Julius Caesar is said to have use a simple system of substituting each letter with the letter 3 spots over, wrapping around the alphabet if necessary. Here is the mapping: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z # # # # # # # # # # # # # # # # # # # # # # # # # # D E F G H I J K L M N O P Q R S T U V W X Y Z A B C Space and punctuation are discarded.
    [Show full text]
  • Codebusters Coaches Institute Notes
    BEING COVER AGENT FIXED DELAY, PILOT RIGHT PLANE, CATCH SMALL RADIO (CODEBUSTERS) This is the first year CodeBusters will be a National event. A few changes have been made since the North Carolina trial event last year. 1. The Atbash Cipher has been added. 2. The running key cipher has been removed. 3. K2 alphabets have been added in addition to K1 alphabets 4. Hill Cipher decryption has been added with a given decryption matrix. 5. The points scale has been doubled, but the timing bonus has been increased by only 50% in order to further balance the test. 1 TYPES OF PROBLEMS 1.1 ARISTOCRAT (EASY TO HARD DIFFICULTY) http://www.cryptograms.org/tutorial.php An Aristocrat is the typical Crypto-quote you see in the newspaper. Word spaces are preserved. No letter will stand for itself and the replacement table is given as a guide (but doesn’t need to be filled in by the team to get credit). FXP PGYAPYF FIKP ME JAKXPT AY FXP GTAYFMJTGF THE EASIEST TYPE OF CIPHER IS THE ARISTOCRAT A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Frequency 4 1 6 3 1 2 2 2 6 3 3 4 Replacement I F T A Y C P O E R H S 1.2 ARISTOCRATS WITH SPELLING AND/OR GRAMMAR ERRORS (MEDIUM TO VERY HARD DIFFICULTY) For these, either words will be misspelled or grammatical errors introduced. From a student perspective, it is what they might expect when someone finger fumbles a text message or has a bad voice transcription.
    [Show full text]
  • Historical Ciphers • A
    ECE 646 - Lecture 6 Required Reading • W. Stallings, Cryptography and Network Security, Chapter 2, Classical Encryption Techniques Historical Ciphers • A. Menezes et al., Handbook of Applied Cryptography, Chapter 7.3 Classical ciphers and historical development Why (not) to study historical ciphers? Secret Writing AGAINST FOR Steganography Cryptography (hidden messages) (encrypted messages) Not similar to Basic components became modern ciphers a part of modern ciphers Under special circumstances modern ciphers can be Substitution Transposition Long abandoned Ciphers reduced to historical ciphers Transformations (change the order Influence on world events of letters) Codes Substitution The only ciphers you Ciphers can break! (replace words) (replace letters) Selected world events affected by cryptology Mary, Queen of Scots 1586 - trial of Mary Queen of Scots - substitution cipher • Scottish Queen, a cousin of Elisabeth I of England • Forced to flee Scotland by uprising against 1917 - Zimmermann telegram, America enters World War I her and her husband • Treated as a candidate to the throne of England by many British Catholics unhappy about 1939-1945 Battle of England, Battle of Atlantic, D-day - a reign of Elisabeth I, a Protestant ENIGMA machine cipher • Imprisoned by Elisabeth for 19 years • Involved in several plots to assassinate Elisabeth 1944 – world’s first computer, Colossus - • Put on trial for treason by a court of about German Lorenz machine cipher 40 noblemen, including Catholics, after being implicated in the Babington Plot by her own 1950s – operation Venona – breaking ciphers of soviet spies letters sent from prison to her co-conspirators stealing secrets of the U.S. atomic bomb in the encrypted form – one-time pad 1 Mary, Queen of Scots – cont.
    [Show full text]
  • Of Ciphers and Neurons Detecting the Type of Ciphers Using Artificial Neural Networks
    Of Ciphers and Neurons Detecting the Type of Ciphers Using Artificial Neural Networks Nils Kopal University of Siegen, Germany [email protected] Abstract cuits). ANNs found usages in a broad set of dif- ferent applications and research fields. Their main There are many (historical) unsolved ci- purpose is fast filtering, classifying, and process- phertexts from which we don’t know the ing of (mostly) non-linear data, e.g. image pro- type of cipher which was used to encrypt cessing, speech recognition, and language trans- these. A first step each cryptanalyst does lation. Besides that, scientists were also able to is to try to identify their cipher types us- “teach” ANNs to play games or to create paintings ing different (statistical) methods. This in the style of famous artists. can be difficult, since a multitude of ci- Inspired by the vast growth of ANNs, also cryp- pher types exist. To help cryptanalysts, tologists started to use them for different crypto- we developed a first version of an artifi- graphic and cryptanalytic problems. Examples are cial neural network that is right now able the learning of complex cryptographic algorithms, to differentiate between five classical ci- e.g. the Enigma machine, or the detection of the phers: simple monoalphabetic substitu- type of cipher used for encrypting a specific ci- tion, Vigenere,` Playfair, Hill, and transpo- phertext. sition. The network is based on Google’s In late 2019 Stamp published a challenge on the TensorFlow library as well as Keras. This MysteryTwister C3 (MTC3) website called “Ci- paper presents the current progress in the pher ID”.
    [Show full text]
  • The Mathemathics of Secrets.Pdf
    THE MATHEMATICS OF SECRETS THE MATHEMATICS OF SECRETS CRYPTOGRAPHY FROM CAESAR CIPHERS TO DIGITAL ENCRYPTION JOSHUA HOLDEN PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Copyright c 2017 by Princeton University Press Published by Princeton University Press, 41 William Street, Princeton, New Jersey 08540 In the United Kingdom: Princeton University Press, 6 Oxford Street, Woodstock, Oxfordshire OX20 1TR press.princeton.edu Jacket image courtesy of Shutterstock; design by Lorraine Betz Doneker All Rights Reserved Library of Congress Cataloging-in-Publication Data Names: Holden, Joshua, 1970– author. Title: The mathematics of secrets : cryptography from Caesar ciphers to digital encryption / Joshua Holden. Description: Princeton : Princeton University Press, [2017] | Includes bibliographical references and index. Identifiers: LCCN 2016014840 | ISBN 9780691141756 (hardcover : alk. paper) Subjects: LCSH: Cryptography—Mathematics. | Ciphers. | Computer security. Classification: LCC Z103 .H664 2017 | DDC 005.8/2—dc23 LC record available at https://lccn.loc.gov/2016014840 British Library Cataloging-in-Publication Data is available This book has been composed in Linux Libertine Printed on acid-free paper. ∞ Printed in the United States of America 13579108642 To Lana and Richard for their love and support CONTENTS Preface xi Acknowledgments xiii Introduction to Ciphers and Substitution 1 1.1 Alice and Bob and Carl and Julius: Terminology and Caesar Cipher 1 1.2 The Key to the Matter: Generalizing the Caesar Cipher 4 1.3 Multiplicative Ciphers 6
    [Show full text]
  • With Answers
    Module 10.4: Exploring Some Historical Ciphers Gregory V. Bard January 30, 2020 • This is a practice workbook the Affine Cipher, touching on some shift ciphers (such as the Caesar cipher, the ROT-13 cipher), the Atbash cipher, and the Vigen`ereCipher. • The Affine Cipher was introduced in Module 10-2: The Basics of Modular Arithmetic, and some skills from Module 10-3: Modular Inverses are needed. • There is a with-answers version, and a without-answers version. • In the with-answers version of this workbook, the black ink represents the question, and the blue ink represents the answer. Question 10-4-1 Suppose Boris normally communicates with his handlers in Moscow using the affine cipher, and the encryption function c = fB(p) = 7p + 20 mod 26, while Natasha normally uses c = fN (p) = 11p + 8 mod 26. They have a very secret message to send back to Moscow, so they're going to encrypt the message twice, for added security. As you can probably guess, this is equivalent to using the affine cipher only once, but with a different function. • If Boris encrypts the plaintext first, followed by Natasha second, then what would BAT encrypt to? (B, A, T) becomes (1, 0, 19) and encrypts to (fB(1); fB(0); fB(19)) ≡ (1; 20; 23). We encrypt again to (fN (1); fN (20); fN (23)) ≡ (19; 20; 1), which becomes (T, U, B) or TUB. • If Natasha encrypts the plaintext first, followed by Boris second, then what would BAT encrypt to? (B, A, T) becomes (1, 0, 19) and encrypts to (fN (1); fN (0); fN (19)) ≡ (19; 8; 9).
    [Show full text]