DOCSLIB.ORG

Proceedings of the 1St International Conference on Historical Cryptology

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Proceedings of the 1St International Conference on Historical Cryptology HistoCrypt 2018 Proceedings of the 1st International Conference on Historical Cryptology June 18-20, 2018 Uppsala University Uppsala, Sweden Proceedings of the 1st International Conference on Historical Cryptology HistoCrypt 2018 Editor Beata´ Megyesi June 18-20, 2018 Department of Linguistics and Philology Uppsala University Sweden Published by NEALT Proceedings Series 34 Linkoping¨ University Electronic Press, Sweden Linkoping¨ Electronic Conference Proceedings No. 149 ISSN: 1650-3686 eISSN: 1650-3740 ISBN: 978-91-7685-252-1 URL: http://www.ep.liu.se/ecp/contents.asp?issue=149 SPONSORS Preface: Program Chair We are very pleased to introduce the proceedings of the International Conference on Historical Cryptology (HISTOCRYPT 2018), held at the Department of Linguistics and Philology on the English Park Campus, Uppsala University, Sweden, between June 18 and 20, 2018. HISTOCRYPT addresses all aspects of historical cryptology/cryptography includ- ing work in closely related disciplines (such as history, history of ideas, computer science, AI, computational linguistics, linguistics, or image processing) with rele- vance to historical ciphertexts and codes. The subjects of the conference include, but are not limited to the use of cryptography in military, diplomacy, business, and other areas, analysis of historical ciphers with the help of modern computerized methods, unsolved historical cryptograms, the Enigma and other encryption machines, the his- tory of modern (computer-based) cryptography, linguistic aspects of cryptology, the influence of cryptography on the course of history, or teaching and promoting cryp- tology in schools, universities, and the public. HISTOCRYPT represents a continuation of the friendly events of European Histor- ical Ciphers Colloquiums (EuroHCC) held in Heusenstamm (2012), Kassel (2016), and Smolenice (2017) to discuss on-going research in historical cryptology in Europe. Considering EuroHCC’s growing popularity among the crypto-historians and cryp- tographers and the established HICRYPT network on historical cryptology with over 90 members from 20 countries around the world, our aim is to establish HISTOCRYPT as an annual, world-wide event. The first event in the series takes place in 2018 at Uppsala University, Sweden. We are very happy that the conference has been inter- nationally recognized outside Europe as well, and submissions are received from all over the world. It is a great honor to serve as the Program Chair for HISTOCRYPT 2018, to be held in Uppsala for the first time. The scientific program was carefully planned by an international scientific pro- gram committee, consisting of researchers in cryptology, history, intelligence and lan- guage technology. The program committee invited paper submissions in two distinct tracks: regular papers up to 10 pages on substantial, original, and unpublished re- search, including empirical evaluation results, where appropriate; short papers up to 4 pages on smaller, focused contributions, work in progress, negative results, surveys, tutorials, or opinion pieces; or summarizing a software system to be accompanied by a live demonstration at the conference. The conference received 24 submissions from all over Europe (Czechia, Den- mark, France, Germany, Hungary, Italy, Netherlands, Poland, Slovakia, Sweden, and the UK) as well as from Ghana, Israel, New Zealand, Russia, the United States, and Uruguay. Our primary goal in the program committee was to achieve a high quality program using a double-blind, rigorous review process. All papers were reviewed by at least three experts invited by the program committee members for reviewing. After dis- v cussion among the reviewers to synchronize recommendations, the final selection of the papers was made by the program committee. The decision was not an easy task due to many submissions with high scores and overall positive reviews, and the time and space constraints of the two day long main conference. Our goal was to include papers dealing with a wide variety of topics from various scientific areas of relevance to historical cryptology. We aimed at achieving balance between regular and short papers, and chose to accept papers—being regular or short—with high scores as oral talks, while we were more lenient with poster presentations. 66% of the regular papers and 33% of the short papers were accepted for oral presentations, while 22% of the regular papers and 50% of the short papers were accepted as posters and/or demos. In the final program, there are 16 regular, and 5 short papers, all collected in this volume, thematically structured, in the same order as they are presented during the conference. In addition to the accepted papers, we are proud to present six invited keynote speakers, distinguished researchers from France, Germany, Israel, and the US. They cover different areas of the conference. Craig Bauer (York College of Pennsylvania) presents highlights from his book on the world’s greatest ciphers. Katherine Ellison (Illinois State University) talks about the central role of cryptology in the history of reading. Remi´ Geraud´ tells us about his and David Naccache’s work (Ecole´ normale superieure)´ on a French code from the late 19th century. Ephraim Lapid (Bar-Ilan University and IDC Herzliya) presents the thrilling story behind the British “Israeli Enigma”. Given the location of HISTOCRYPT at Uppsala University, special attention is given to the heritage of Prof. Arne Beurling and his role in breaking the German teletype ciphers. Therefore, we invited Kjell-Ove Widman, professor emeritus in ap- plied mathematics (University of Linkoping)¨ to talk about Arne Beurling as a math- ematician and code breaker, and George Lasry (University of Kassel) to tell us about his very new methods to solve the “completely hopeless” T52, which Arne Beurling worked on and which can be found in the archives of the Swedish National Defence Radio Establishment (FRA). And in connection to the poster and demo session, we organize an exhibition to show four Enigma machines, usually hidden in the FRA archive. Lastly, the conference program also includes two workshops, organized by their own committees. The workshop on (Automated) Cryptanalysis of Classical Ciphers with CrypTool 2 demonstrates the open-source e-learning tool consisting of several classical and modern cryptographic algorithms where participants can learn and prac- tice how to use CrypTool. The workshop Solving codes rather than ciphers. Is there a software challenge? focuses on the fascinating codes, encrypted messages word by word, aiming at finding solutions for breaking these. These proceedings will provide a permanent record of the program. The confer- ence proceedings are published by the Northern European Association for Language Technology (NEALT) Proceedings Series by Linkoping¨ University Electronic Press, as freely available Gold Open Access. The proceedings are indexed in the DBLP com- vi puter science bibliography and also published in the anthology of the Association of Computational Linguistics (ACL Anthology) in parallel. Organizing a conference with an interesting and diverse program in a highly cross- disciplinary field is far from easy and relies on the goodwill of many researchers in- volved in the various scientific areas, all with their own traditions. I would like to express my gratitude and appreciation to my great fellows on the program committee for their invaluable work, for fruitful discussions, and for sharing the effort of creating the program. A special thank goes to the steering committee, especially Arno Wacker, for his support and generous advice. I would also like to record my appreciation for the work of the 23 reviewers and 4 subreviewers for their time and effort to contribute to the reviewing, give constructive and collegial feedback, and help the program com- mittee in the selection of papers. Wholehearted thanks go to the six keynote speakers, and the workshop organizers, as well as Anders H. Wik and Asa˚ Ljungqvist for bring- ing to light the Enigma machines and arranging the exhibition in connection to the demo session. I would also like to thank all authors without whom this conference would not have taken place! Nils Blomqvist deserves a huge and special thank for professionally serving as the proceedings co-manager. My greatest debt goes to the local organization, Eva Pettersson, for carrying the burden of the local organization, and Bengt Dahlqvist, for helping out with the on-line registration and the conference website. We are also extremely pleased to have received generous sponsorship from the Swedish Foundation for Humanities and Social Sciences allowing free registra- tion and covered accommodation and travel costs for many conference participants. Lastly, I am grateful to my nearest and dearest—my twins, bonus kids, and partner— for generously giving me the space to disappear into our world of hidden secrets from the past. I wish you all a fruitful conference and hope you will enjoy HISTOCRYPT 2018! Beata´ Megyesi (Program Chair) vii Program Committee • Beata´ Megyesi (Program Chair), Uppsala University, Sweden • Bernhard Esslinger, University of Siegen, Germany • Otokar Grosek,ˇ Slovak University of Technology, Slovakia • Benedek Lang,´ Budapest University of Technology and Economics, Hungary • Mark Phythian, University of Leicester, UK • Anne-Simone Rous, Saxon Academy of Sciences and Humanities, Germany • Gerhard F. Straßer, Emeritus, Pennsylvania State University, USA Local Organizing Committee • Eva Pettersson
Load more

Recommended publications
  • 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]
  • The Imagination Game Storia E Fantasia in the Imitation Game
    The Imagination Game storia e fantasia in The Imitation Game Cap. 2: Bletchley Park e Ultra Giovanni A. Cignoni – Progetto HMR 1/28 Bletchley Park e Ultra • Un’organizzazione poderosa • Bletchley Park • I luoghi, le strutture, le procedure • I meccanismi e gli appoggi • Il personale, le (tante) donne di BP • Ultra • Cos’era, come era nascosto • L’impatto sul conflitto, episodi e numeri Giovanni A. Cignoni – Progetto HMR 2/28 A lezione dai Polacchi • 1919, Biuro Szyfrów • Militari, Kowalewski, e matematici, Mazurkiewicz, Sierpiński, Leśniewski • Nel 1938 il 75% dei messaggi tedeschi intercettati era decifrato (Rejewski, Zygalski, Różycki) • Dopo il ’39 PC Bruno, Cadix, Boxmoor • In Inghilterra • Room40 (1914), GC&CS (1919), BP (1938) • Parigi (gennaio ’39), con Francesi e Polacchi • Pyry vicino Varsavia (luglio ’39) Giovanni A. Cignoni – Progetto HMR 3/28 Un posto strategico Bletchley Park - Gayhurst - Wavendon - Stanmore - Eastcote - Adstock Cambridge Banbury Letchworth Oxford London Giovanni A. Cignoni – Progetto HMR 4/28 Bletchley Park, 1942ca Giovanni A. Cignoni – Progetto HMR 5/28 Nel film, ci somiglia... Giovanni A. Cignoni – Progetto HMR 6/28 … ma non è Giovanni A. Cignoni – Progetto HMR 7/28 Il nume tutelare • 1941.10.21: Action this day! • In un momento di successo • Dopo una visita di Churchill • Le Bombe ci sono, mancano persone • Garanzie per i tecnici BTM • Personale per la catena • Intercettazione in grande • Risorse per una pesca industriale • Un po’ come “Echelon” Giovanni A. Cignoni – Progetto HMR 8/28 Il personale • Una grande industria • Da 9000 a 10000 persone, centinaia di macchine • Piuttosto stabile, circa 12000 nomi • Escluso l’indotto, fornitori e logistica • Reclutamento • Inizialmente diretto, da persona a persona • Poi attraverso controlli e selezioni metodiche • Soprattutto nell’ambito delle leve militari • Ma con un occhio anche ai civili Giovanni A.
    [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]
  • 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.
    [Show full text]
  • Polska Myśl Techniczna W Ii Wojnie Światowej
    CENTRALNA BIBLIOTEKA WOJSKOWA IM. MARSZAŁKA JÓZEFA PIŁSUDSKIEGO POLSKA MYŚL TECHNICZNA W II WOJNIE ŚWIATOWEJ W 70. ROCZNICĘ ZAKOŃCZENIA DZIAŁAŃ WOJENNYCH W EUROPIE MATERIAŁY POKONFERENCYJNE poD REDAkcJą NAUkoWą DR. JANA TARCZYńSkiEGO WARSZAWA 2015 Konferencja naukowa Polska myśl techniczna w II wojnie światowej. W 70. rocznicę zakończenia działań wojennych w Europie Komitet naukowy: inż. Krzysztof Barbarski – Prezes Instytutu Polskiego i Muzeum im. gen. Sikorskiego w Londynie dr inż. Leszek Bogdan – Dyrektor Wojskowego Instytutu Techniki Inżynieryjnej im. profesora Józefa Kosackiego mgr inż. Piotr Dudek – Prezes Stowarzyszenia Techników Polskich w Wielkiej Brytanii gen. dyw. prof. dr hab. inż. Zygmunt Mierczyk – Rektor-Komendant Wojskowej Akademii Technicznej im. Jarosława Dąbrowskiego płk mgr inż. Marek Malawski – Szef Inspektoratu Implementacji Innowacyjnych Technologii Obronnych Ministerstwa Obrony Narodowej mgr inż. Ewa Mańkiewicz-Cudny – Prezes Federacji Stowarzyszeń Naukowo-Technicznych – Naczelnej Organizacji Technicznej prof. dr hab. Bolesław Orłowski – Honorowy Członek – założyciel Polskiego Towarzystwa Historii Techniki – Instytut Historii Nauki Polskiej Akademii Nauk kmdr prof. dr hab. Tomasz Szubrycht – Rektor-Komendant Akademii Marynarki Wojennej im. Bohaterów Westerplatte dr Jan Tarczyński – Dyrektor Centralnej Biblioteki Wojskowej im. Marszałka Józefa Piłsudskiego prof. dr hab. Leszek Zasztowt – Dyrektor Instytutu Historii Nauki Polskiej Akademii Nauk dr Czesław Andrzej Żak – Dyrektor Centralnego Archiwum Wojskowego im.
    [Show full text]
  • Table of Contents
    Administrative Services and Property Management SPECIFICATIONS SOLICITATION #: 15-22173 BUILDING: U-89 Uplands Campus Ottawa, Ontario PROJECT: U-89 Washroom Renovation PROJECT #: U89-5054 Date: January 2015 SPECIFICATION TABLE OF CONTENTS Construction Tender Form Buyandsell Notice Instructions to Bidders Ontario Sales Tax Acceptable Bonding Companies Articles of Agreement Plans and Specifications A Terms of Payment B General Conditions C Labour Conditions and Fair Wage Schedule D N/A Insurance Conditions E Contract Security Conditions F Security Requirement Check List G Directions to the Ottawa Research Facilities — Uplands NRC Institute for Aerospace Research (NRC-IAR) Research Road Ottawa, Ontario, Canada Tel: 613-991-5738 NRC Centre for Surface Transportation Technology (NRC-CSTT) 2320 Lester Road Ottawa, Ontario, Canada Tel: 613-998-9639 NRC Institutes/Branch/Program Buildings NRC Administrative Services and Property Management (NRC-ASPM) U-62 NRC Institute For Aerospace Research (NRC-IAR) U-61, U-66, U-67, U-69, U-70 NRC Centre for Surface Transportation Technology (NRC-CSTT) U-84, U-86, U-87, U-88, U89, U-90, U-91 By Road, from the MONTREAL RD FACILITIES to NRC-CSTT, 2320 Lester Road 1. Drive EAST on MONTREAL RD 2. Turn RIGHT on BLAIR RD, cross OGILVIE RD 3. Take the ramp and follow Highway 174 WEST 4. Keep RIGHT and take first exit on ramp Highway 417 EAST towards Cornwall/Montreal 5. Exit at WALKLEY RD, merge RIGHT on WALKLEY 6. Turn LEFT at CONROY RD 7. Turn RIGHT at DAVIDSON RD, cross BANK ST – name changes to LESTER RD 8. Continue on LESTER RD and watch for NRC Research Facilities signs Directions to the Ottawa Research Facilities — Uplands PAGE 2 of 4 By Road, from the MONTREAL RD FACILITIES to NRC-IAR, Research Road 1.
    [Show full text]
  • Cryptanalysis of Mono-Alphabetic Substitution Ciphers Using Genetic Algorithms and Simulated Annealing Shalini Jain Marathwada Institute of Technology, Dr
    Vol. 08 No. 01 2018 p-ISSN 2202-2821 e-ISSN 1839-6518 (Australian ISSN Agency) 82800801201801 Cryptanalysis of Mono-Alphabetic Substitution Ciphers using Genetic Algorithms and Simulated Annealing Shalini Jain Marathwada Institute of Technology, Dr. Babasaheb Ambedkar Marathwada University, India Nalin Chhibber University of Waterloo, Ontario, Canada Sweta Kandi Marathwada Institute of Technology, Dr. Babasaheb Ambedkar Marathwada University, India ABSTRACT – In this paper, we intend to apply the principles of genetic algorithms along with simulated annealing to cryptanalyze a mono-alphabetic substitution cipher. The type of attack used for cryptanalysis is a ciphertext-only attack in which we don’t know any plaintext. In genetic algorithms and simulated annealing, for ciphertext-only attack, we need to have the solution space or any method to match the decrypted text to the language text. However, the challenge is to implement the project while maintaining computational efficiency and a high degree of security. We carry out three attacks, the first of which uses genetic algorithms alone, the second which uses simulated annealing alone and the third which uses a combination of genetic algorithms and simulated annealing. Key words: Cryptanalysis, mono-alphabetic substitution cipher, genetic algorithms, simulated annealing, fitness I. Introduction II. Mono-alphabetic substitution cipher Cryptanalysis involves the dissection of computer systems by A mono-alphabetic substitution cipher is a class of substitution unauthorized persons in order to gain knowledge about the ciphers in which the same letters of the plaintext are replaced unknown aspects of the system. It can be used to gain control by the same letters of the ciphertext.
    [Show full text]
  • Rotor Machines and Enigma 1
    Contents: Rotor Machines and Enigma 1. The Introduction of Rotor Machines. 2. Arthur Scherbius and the Enigma Machine. 3. The Principles of Enigma. 4. Interwar Poland, and the Biuro Szyfrów. 5. Marian Rejewski, and Breaking Enigma. 6. Alan Turing, and the British Effort. Eduard Hebern’s Electric Code Machine (U.S. Patent 1673072) R. Banach, Computer Science, University of Manchester: Rotor Machines and Enigma 1 of 28 R. Banach, Computer Science, University of Manchester: Rotor Machines and Enigma 2 of 28 1. The Introduction of Rotor Machines. 2. Arthur Scherbius and the Enigma Machine. Doing encryption by hand is obviously error-prone. Arthur Scherbius invented his Enigma machine in 1918. Cryptographers have always invented various mechanical devices to both It was the first of a number of models, which gradually speed up the encryption process, and also help make it more reliable. improved over the next few years. For a monoalphabetic substitution cypher: U.S. Patent 01657411 was granted for Enigma in 1928. — aligning plain/cypher letter pairs on a ruler, at least stops you forgetting; — putting plain/cypher letter pairs on two concentric rings, able to rotate His big breakthrough was due to the mortification felt by with respect to each other, not only stops you forgetting, but also gives the German High Command after WWI, caused by finding you 26 different monoalphabetic substitution cyphers, by altering the out that the Allies had routinely broken German cyphers orientation of the disks. all through WWI. They decided to buy the best devices for encryption that they could. Scherbius was the right Cypher disks were invented by Leon Battista Alberti (1430’s).
    [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]
  • 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.
    [Show full text]
  • Tolono Library CD List
    Tolono Library CD List CD# Title of CD Artist Category 1 MUCH AFRAID JARS OF CLAY CG CHRISTIAN/GOSPEL 2 FRESH HORSES GARTH BROOOKS CO COUNTRY 3 MI REFLEJO CHRISTINA AGUILERA PO POP 4 CONGRATULATIONS I'M SORRY GIN BLOSSOMS RO ROCK 5 PRIMARY COLORS SOUNDTRACK SO SOUNDTRACK 6 CHILDREN'S FAVORITES 3 DISNEY RECORDS CH CHILDREN 7 AUTOMATIC FOR THE PEOPLE R.E.M. AL ALTERNATIVE 8 LIVE AT THE ACROPOLIS YANNI IN INSTRUMENTAL 9 ROOTS AND WINGS JAMES BONAMY CO 10 NOTORIOUS CONFEDERATE RAILROAD CO 11 IV DIAMOND RIO CO 12 ALONE IN HIS PRESENCE CECE WINANS CG 13 BROWN SUGAR D'ANGELO RA RAP 14 WILD ANGELS MARTINA MCBRIDE CO 15 CMT PRESENTS MOST WANTED VOLUME 1 VARIOUS CO 16 LOUIS ARMSTRONG LOUIS ARMSTRONG JB JAZZ/BIG BAND 17 LOUIS ARMSTRONG & HIS HOT 5 & HOT 7 LOUIS ARMSTRONG JB 18 MARTINA MARTINA MCBRIDE CO 19 FREE AT LAST DC TALK CG 20 PLACIDO DOMINGO PLACIDO DOMINGO CL CLASSICAL 21 1979 SMASHING PUMPKINS RO ROCK 22 STEADY ON POINT OF GRACE CG 23 NEON BALLROOM SILVERCHAIR RO 24 LOVE LESSONS TRACY BYRD CO 26 YOU GOTTA LOVE THAT NEAL MCCOY CO 27 SHELTER GARY CHAPMAN CG 28 HAVE YOU FORGOTTEN WORLEY, DARRYL CO 29 A THOUSAND MEMORIES RHETT AKINS CO 30 HUNTER JENNIFER WARNES PO 31 UPFRONT DAVID SANBORN IN 32 TWO ROOMS ELTON JOHN & BERNIE TAUPIN RO 33 SEAL SEAL PO 34 FULL MOON FEVER TOM PETTY RO 35 JARS OF CLAY JARS OF CLAY CG 36 FAIRWEATHER JOHNSON HOOTIE AND THE BLOWFISH RO 37 A DAY IN THE LIFE ERIC BENET PO 38 IN THE MOOD FOR X-MAS MULTIPLE MUSICIANS HO HOLIDAY 39 GRUMPIER OLD MEN SOUNDTRACK SO 40 TO THE FAITHFUL DEPARTED CRANBERRIES PO 41 OLIVER AND COMPANY SOUNDTRACK SO 42 DOWN ON THE UPSIDE SOUND GARDEN RO 43 SONGS FOR THE ARISTOCATS DISNEY RECORDS CH 44 WHATCHA LOOKIN 4 KIRK FRANKLIN & THE FAMILY CG 45 PURE ATTRACTION KATHY TROCCOLI CG 46 Tolono Library CD List 47 BOBBY BOBBY BROWN RO 48 UNFORGETTABLE NATALIE COLE PO 49 HOMEBASE D.J.
    [Show full text]