Communication Intelligence and Security, William F Friedman
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Quantum Cryptography Without Basis Switching 2004
Quantum Cryptography Without Basis Switching Christian Weedbrook B.Sc., University of Queensland, 2003. A thesis submitted for the degree of Bachelor of Science Honours in Physics The Australian National University October 2004 ii iii Listen, do you want to know a secret? Do you promise not to tell? - John Lennon and Paul McCartney iv Declaration This thesis is an account of research undertaken with the supervision of Dr Ping Koy Lam, Dr Tim Ralph and Dr Warwick Bowen between February 2004 and October 2004. It is a partial fulfilment of the requirements for the degree of a Bachelor of Science with Honours in theoretical physics at the Australian National University, Canberra, Australia. Except where acknowledged in the customary manner, the material presented in this thesis is, to the best of my knowledge, original and has not been submitted in whole or part for a degree in any university. Christian Weedbrook 29th October 2004 v vi Acknowledgements During the three years of residency, it was the relationships that got you through. - J.D., Scrubs I have met a lot of people during my Honours year, and a lot of people to thank and be thankful for. First I would like to thank my supervisors Ping Koy Lam, Tim Ralph, Warwick Bowen and my “unofficial” supervisor Andrew Lance. Ping Koy, thank you for your positive approach and enthusiasm. It was excellent having you as my supervisor, as you have many ideas and the ability to know the best way to proceed. I would like to thank you for my scholarship and also for organizing that I could do my Honours at ANU, and to spend some time up at UQ. -
I – Basic Notions
Provable Security in the Computational Model I – Basic Notions David Pointcheval MPRI – Paris Ecole normale superieure,´ CNRS & INRIA ENS/CNRS/INRIA Cascade David Pointcheval 1/71 Outline Cryptography Provable Security Basic Security Notions Conclusion ENS/CNRS/INRIA Cascade David Pointcheval 2/71 Cryptography Outline Cryptography Introduction Kerckhoffs’ Principles Formal Notations Provable Security Basic Security Notions Conclusion ENS/CNRS/INRIA Cascade David Pointcheval 3/71 Secrecy of Communications One ever wanted to communicate secretly The treasure Bob is under Alice …/... ENS/CNRS/INRIA Cascade David Pointcheval 4/71 Secrecy of Communications One ever wanted to communicate secretly The treasure Bob is under Alice …/... ENS/CNRS/INRIA Cascade David Pointcheval 4/71 Secrecy of Communications One ever wanted to communicate secretly The treasure Bob is under Alice …/... ENS/CNRS/INRIA Cascade David Pointcheval 4/71 Secrecy of Communications One ever wanted to communicate secretly The treasure Bob is under Alice …/... ENS/CNRS/INRIA Cascade David Pointcheval 4/71 Secrecy of Communications One ever wanted to communicate secretly The treasure Bob is under Alice …/... With the all-digital world, security needs are even stronger ENS/CNRS/INRIA Cascade David Pointcheval 4/71 Old Methods Substitutions and permutations Security relies on the secrecy of the mechanism ENS/CNRS/INRIA Cascade David Pointcheval 5/71 Old Methods Substitutions and permutations Security relies on the secrecy of the mechanism Scytale - Permutation ENS/CNRS/INRIA -
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 -
Short History Polybius's Square History – Ancient Greece
CRYPTOLOGY : CRYPTOGRAPHY + CRYPTANALYSIS Polybius’s square Polybius, Ancient Greece : communication with torches Cryptology = science of secrecy. How : 12345 encipher a plaintext into a ciphertext to protect its secrecy. 1 abcde The recipient deciphers the ciphertext to recover the plaintext. 2 f g h ij k A cryptanalyst shouldn’t complete a successful cryptanalysis. 3 lmnop 4 qrstu Attacks [6] : 5 vwxyz known ciphertext : access only to the ciphertext • known plaintexts/ciphertexts : known pairs TEXT changed in 44,15,53,44. Characteristics • (plaintext,ciphertext) ; search for the key encoding letters by numbers chosen plaintext : known cipher, chosen cleartexts ; • shorten the alphabet’s size • search for the key encode• a character x over alphabet A in y finite word over B. Polybius square : a,...,z 1,...,5 2. { } ! { } Short history History – ancient Greece J. Stern [8] : 3 ages : 500 BC : scytale of Sparta’s generals craft age : hieroglyph, bible, ..., renaissance, WW2 ! • technical age : complex cipher machines • paradoxical age : PKC • Evolves through maths’ history, computing and cryptanalysis : manual • electro-mechanical • by computer Secret key : diameter of the stick • History – Caesar Goals of cryptology Increasing number of goals : secrecy : an enemy shouldn’t gain access to information • authentication : provides evidence that the message • comes from its claimed sender signature : same as auth but for a third party • minimality : encipher only what is needed. • Change each char by a char 3 positions farther A becomes d, B becomes e... The plaintext TOUTE LA GAULE becomes wrxwh od jdxoh. Why enciphering ? The tools Yesterday : • I for strategic purposes (the enemy shouldn’t be able to read messages) Information Theory : perfect cipher I by the church • Complexity : most of the ciphers just ensure computational I diplomacy • security Computer science : all make use of algorithms • Mathematics : number theory, probability, statistics, Today, with our numerical environment • algebra, algebraic geometry,.. -
Pioneers in U.S. Cryptology Ii
PIONEERS IN U.S. CRYPTOLOGY II This brochure was produced by the Center for Cryptologic History Herbert 0. Yardley 2 Herbert 0. Yardley Herbert 0 . Yardley was born in 1889 in Worthington, Indiana. After working as a railroad telegrapher and spending a year taking an English course at the University of Chicago, he became a code clerk for the Department of State. In June 1917, Yardley received a commission in the Signal Officers Reserve Corps; in July Colonel Ralph Van Deman appointed him chief of the new cryptanalytic unit, MI-8, in the Military Intelligence division. MI-8, or the Cipher Bureau, consisted of Yardley and two clerks. At MI-8's peak in November 1918, Yardley had 18 officers, 24 civilians, and 109 typists. The section had expanded to include secret inks, code and cipher compilation, communications, and shorthand. This was the first formally organized cryptanalytic unit in the history of the U.S. government. When World War I ended, the Army was considering disbanding MI-8. Yardley presented a persuasive argument for retaining it for peacetime use. His plan called for the permanent retention of a code and cipher organization funded jointly by the State and War Departments. He demonstrated that in the past eighteen months MI-8 had read almost 11,000 messages in 579 cryptographic systems. This was in addition to everything that had been examined in connection with postal censorship. On 17 May Acting Secretary of State Frank L. Polk approved the plan, and two days later the Army Chief of Staff, General Peyton C. -
An Archeology of Cryptography: Rewriting Plaintext, Encryption, and Ciphertext
An Archeology of Cryptography: Rewriting Plaintext, Encryption, and Ciphertext By Isaac Quinn DuPont A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Faculty of Information University of Toronto © Copyright by Isaac Quinn DuPont 2017 ii An Archeology of Cryptography: Rewriting Plaintext, Encryption, and Ciphertext Isaac Quinn DuPont Doctor of Philosophy Faculty of Information University of Toronto 2017 Abstract Tis dissertation is an archeological study of cryptography. It questions the validity of thinking about cryptography in familiar, instrumentalist terms, and instead reveals the ways that cryptography can been understood as writing, media, and computation. In this dissertation, I ofer a critique of the prevailing views of cryptography by tracing a number of long overlooked themes in its history, including the development of artifcial languages, machine translation, media, code, notation, silence, and order. Using an archeological method, I detail historical conditions of possibility and the technical a priori of cryptography. Te conditions of possibility are explored in three parts, where I rhetorically rewrite the conventional terms of art, namely, plaintext, encryption, and ciphertext. I argue that plaintext has historically been understood as kind of inscription or form of writing, and has been associated with the development of artifcial languages, and used to analyze and investigate the natural world. I argue that the technical a priori of plaintext, encryption, and ciphertext is constitutive of the syntactic iii and semantic properties detailed in Nelson Goodman’s theory of notation, as described in his Languages of Art. I argue that encryption (and its reverse, decryption) are deterministic modes of transcription, which have historically been thought of as the medium between plaintext and ciphertext. -
Integrity, Authentication and Confidentiality in Public-Key Cryptography Houda Ferradi
Integrity, authentication and confidentiality in public-key cryptography Houda Ferradi To cite this version: Houda Ferradi. Integrity, authentication and confidentiality in public-key cryptography. Cryptography and Security [cs.CR]. Université Paris sciences et lettres, 2016. English. NNT : 2016PSLEE045. tel- 01745919 HAL Id: tel-01745919 https://tel.archives-ouvertes.fr/tel-01745919 Submitted on 28 Mar 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. THÈSE DE DOCTORAT de l’Université de recherche Paris Sciences et Lettres PSL Research University Préparée à l’École normale supérieure Integrity, Authentication and Confidentiality in Public-Key Cryptography École doctorale n◦386 Sciences Mathématiques de Paris Centre Spécialité Informatique COMPOSITION DU JURY M. FOUQUE Pierre-Alain Université Rennes 1 Rapporteur M. YUNG Moti Columbia University et Snapchat Rapporteur M. FERREIRA ABDALLA Michel Soutenue par Houda FERRADI CNRS, École normale supérieure le 22 septembre 2016 Membre du jury M. CORON Jean-Sébastien Université du Luxembourg Dirigée par -
The the Enigma Enigma Machinemachine
TheThe EnigmaEnigma MachineMachine History of Computing December 6, 2006 Mike Koss Invention of Enigma ! Invented by Arthur Scherbius, 1918 ! Adopted by German Navy, 1926 ! Modified military version, 1930 ! Two Additional rotors added, 1938 How Enigma Works Scrambling Letters ! Each letter on the keyboard is connected to a lamp letter that depends on the wiring and position of the rotors in the machine. ! Right rotor turns before each letter. How to Use an Enigma ! Daily Setup – Secret settings distributed in code books. ! Encoding/Decoding a Message Setup: Select (3) Rotors ! We’ll use I-II-III Setup: Rotor Ring Settings ! We’ll use A-A-A (or 1-1-1). Rotor Construction Setup: Plugboard Settings ! We won’t use any for our example (6 to 10 plugs were typical). Setup: Initial Rotor Position ! We’ll use “M-I-T” (or 13-9-20). Encoding: Pick a “Message Key” ! Select a 3-letter key (or indicator) “at random” (left to the operator) for this message only. ! Say, I choose “M-C-K” (or 13-3-11 if wheels are printed with numbers rather than letters). Encoding: Transmit the Indicator ! Germans would transmit the indicator by encoding it using the initial (daily) rotor position…and they sent it TWICE to make sure it was received properly. ! E.g., I would begin my message with “MCK MCK”. ! Encoded with the daily setting, this becomes: “NWD SHE”. Encoding: Reset Rotors ! Now set our rotors do our chosen message key “M-C-K” (13-3-11). ! Type body of message: “ENIGMA REVEALED” encodes to “QMJIDO MZWZJFJR”. -
Practical Aspects of Modern Cryptography
University of Washington CSEP 590TU – Practical Aspects of Modern Cryptography Instructors: Josh Benaloh, Brian LaMacchia, John Manferdelli Tuesdays: 6:30-9:30, Allen Center 305 Webpage: http://www.cs.washington.edu/education/courses/csep590/06wi/ Recommended texts: Stinson, Cryptography, Theory and Practice. 2nd Edition, CRC Press, 2002. Menezes, vanOrtshot, Vanstone. Handbook of Applied Cryptography. Ferguson and Schneier, Practical Cryptography. JLM 20060107 22:16 1 New Lecture Schedule Date Topic Lecturer 1 1/3 Practical Aspects of Cryptography Josh 2 1/10 Symmetric Key Ciphers and Hashes John 3 1/17 Public Key Ciphers Josh 4 1/24 Cryptographic Protocols I Brian 5 1/31 Cryptographic Protocols II Brian 6 2/7 Security of Block Ciphers John 7 2/14 AES and Cryptographic Hashes John 8 2/21 Trust, PKI, Key Management [Last HW Brian Assignment) 9 3/1 Random Numbers/Elliptic Curve Crypto Josh 10 3/8 Three topics: Elections, ITAR/Politics, Side All Channels/Timing Attacks, DRM, BigNum Implementation JLM 20060107 22:16 2 Symmetric Key Cryptography and Cryptographic Hashes - I John Manferdelli [email protected] [email protected] Portions © 2004-2005, John Manferdelli. This material is provided without warranty of any kind including, without limitation, warranty of non-infringement or suitability for any purpose. This material is not guaranteed to be error free and is intended for instructional use only. JLM 20060107 22:16 3 Communications Engineers Coat of Arms The Source Sender: Alice Noisy insecure channel Plaintext Compress Encrypt Encode (P) (to save space) (for confidentiality) (to correct errors) The Sink Receiver:Bob Noisy insecure channel Decode Decrypt Decompress Plaintext (for confidentiality) (to correct errors) (to save space) (P) JLM 20060107 22:16 4 Symmetric Encryption Plaintext (P) Encrypt Ciphertext (C) E (P) Key (k) k Ciphertext (C) Decrypt Plaintext (P) D (P) Key (k) k • Symmetric Key cryptographic algorithms use a secret known to the authorized parties called a “key”. -
ISA 562 Information Security Theory & Practice
ISA 562 Information Security Theory & Practice Introduction to Cryptography Agenda • Basics & Definitions • Classical Cryptography • Symmetric (Secret Key) Cryptography • DES (Data Encryption Standard) • Multiple Encryptions • Modes of Block Cipher Operations • Math Essential • Asymmetric (Public Key) Cryptography 2 1 Basics & Definitions Security Concepts (I) • Confidentiality – Prevent information from being exposed to unintended party – Ex: An employee should not come to know the salary of his manager • Integrity – Assure that the information has not been tempered – Ex: An employee should not be able to modify the employee's own salary • Identity – Assure that the party of concern is authentic - it is what it claims to be – Ex: An employee should be able to uniquely identify and authenticate himself/herself 4 2 Security Concepts (II) • Availability – Assure that unused service or resource is available to legitimate users – Ex: Paychecks should be printed on time as stipulated by law • Anonymity – Assure that the identity of some party is remain anonymous – Ex: The manager should not know who had a critical review of him • Non-Repudiation – Assure that authenticated party has indeed done something that cannot be denied – Ex: Once the employee has cashed his paycheck, he can’t deny it. 5 Cryptography • Crypt = secret • Graph = writing • Cryptography is the science / art of transforming meaningful information into unintelligible text Becoming a science that relies on mathematics (number theory, algebra) • Cryptanalysis is the science / art of breaking cryptographic codes • Cryptology is the science / art / study of both cryptography and cryptanalysis 6 3 Applications of Cryptography • Assuring document integrity • Assuring document confidentiality • Authenticating parties • Document signature • Non-repudiation • Secure transactions • Exchanging keys • Sharing Secrets • Digital cash • Preserving anonymity • Copyright protection • More . -
Top Secret! Shhhh! Codes and Ciphers
Top Secret! Shhhh! Codes and Ciphers 20 15 16 19 5 3 18 5 20 19 8 8 8 Can you figure out what this message says? Do you love secret codes? Do you want to be able to write messages to friends that no one else can read? In this kit you will get to try some codes and learn to code and decode messages. Materials Included in your Kit Directions and template pages Answer key for all codes in this packet starts on page 8. 1 #2 Pencil 1 Brad Fastener Tools You’ll Need from Home Scissors A Piece of Tape Terminology First let’s learn a few terms together. CODE A code is a set of letters, numbers, symbols, etc., that is used to secretly send messages to someone. CIPHER A cipher is a method of transforming a text in order to conceal its meaning. KEY PHRASE / KEY OBJECT A key phrase lets the sender tell the recipient what to use to decode a message. A key object is a physical item used to decrypt a code. ENCRYPT This means to convert something written in plain text into code. DECRYPT This means to convert something written in code into plain text. Why were codes and ciphers used? Codes have been used for thousands of years by people who needed to share secret information with one another. Your mission is to encrypt and decrypt messages using different types of code. The best way to learn to read and write in code is to practice! SCYTALE Cipher The Scytale was used by the ancient Greeks. -
Work Load of the Maintenance Branch
HEADQUARTERS ARMY SECURITY AGENCY WASHINGTON 25, D. C. WDGSS-85 15 May 1946 SUBJECT: Work Load of the Maintenance Branch TO: Chief, Security Division 1. The Repair Section of Maintenance Branch is .faced with an ex tremely heavy backlog of' work due to the large amounts of' cryptographic equipment returned from overseas for rehabilitation. Awaiting rehabili tation by the Repair Section is the followi~g list of equipment and the man hours estimated to complete the work required.: EQUIPMENT MAN HOURS REQUIRED TOTAL 1808 SIGABA 36 65,088 1182 SIGCUM 12 14,184 300 SIGNIN 4 1,200 2297 SIGIVI 4 9,188 533 SIGAMUG 4, 2,132 Total man hours 91,792 These figures represent the number of equipments on hand as of 1 May 1946 and will be continually increased by the arrival of additional equipment . from overseas. 2. It is considered probable that the SIGABA will be modified along the lines proposed by the Navy. It is proposed that all SIGABA 1s be modi fied at this Headquarters before shipment is made to the field, thus in creasing the work load as follows: EQUIPMENT MAN HOURS REQUIRED 3241 SIGABA 12 The above figure of' twelve hours per machine is an estimate based on preliminary studies of' the proposed change. It may be possible to greatly reduce this total af'ter the changes have been f inaJ.ly agreed on by the .Army and the Navy, and time studies can be made under actual conditions. ,3. In order to properly preserve these equipments while in extended storage, it is recommended that the proposals set .forth in a memorandum to the Chief, Security Division, 4 December 1945, subject "Preparation of Declassified and approved for release by NSA on 01-16-2014 pursuantto E .0.