History of Cryptology, "Communications Security
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 -
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 -
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. -
Computational Thinking Bins: Outreach and More Briana B
University of Nebraska at Omaha DigitalCommons@UNO Computer Science Faculty Publications Department of Computer Science 2019 Computational Thinking Bins: Outreach and More Briana B. Morrison Brian Dorn Michelle Friend Follow this and additional works at: https://digitalcommons.unomaha.edu/compscifacpub Part of the Computer Sciences Commons Paper Session: Outreach SIGCSE '19, February 27–March 2, 2019, Minneapolis, MN, USA Computational Thinking Bins: Outreach and More Briana B. Morrison Brian Dorn Michelle Friend University of Nebraska Omaha University of Nebraska Omaha University of Nebraska Omaha Omaha, Nebraska Omaha, Nebraska Omaha, Nebraska [email protected] [email protected] [email protected] ABSTRACT Faculty in Computer Science and Teacher Education Develop- Computational Thinking Bins are stand alone, individual boxes, ment worked together to create a sample CT Bin and a template each containing an activity for groups of students that teaches a for all the required information we desired. We then developed a computing concept. We have a devised a system that has allowed us plan to allow the creation and testing of additional CT Bins. In this to create an initial set, test the set, continually improve and add to paper we report on our process. our set. We currently use these bins in outreach events for middle and high school students. As we have shared this resource with 2 BACKGROUND K-12 teachers, many have expressed an interest in acquiring their There is a history in computer science education of utilizing own set. In this paper we will share our experience throughout the computer-free “unplugged” activities which engage students in process, introduce the bins, and explain how you can create your kinesthetic exercises that make computing concepts concrete. -
Communication Intelligence and Security, William F Friedman
UNCLASSIFIED DATE: 26 April 1960 NAME: Friedman, William F. PLACE: Breckinridge Hall, Marine Corp School TITLE: Communications Intelligence and Security Presentation Given to Staff and Students; Introduction by probably General MILLER (NFI) Miller: ((TR NOTE: Introductory remarks are probably made by General Miller (NFI).)) Gentleman, I…as we’ve grown up, there have been many times, I suppose, when we’ve been inquisitive about means of communication, means of finding out what’s going on. Some of us who grew up out in the country used to tap in on a country telephone line and we could find out what was going on that way—at least in the neighborhood. And then, of course, there were always a few that you’d read about in the newspaper who would carry this a little bit further and read some of your neighbor’s mail by getting at it at the right time, and reading it and putting it back. Of course, a good many of those people ended up at a place called Fort Leavenworth. This problem of security of information is with us in the military on a [sic] hour-to-hour basis because it’s our bread and butter. It’s what we focus on in the development of our combat plans in an attempt to project these plans onto an enemy and defeat him. And so, we use a good many devices. We spend a tremendous amount of effort and money in attempting to keep our secrets in fact secret—at least at the echelon where we feel this is necessary. -
SIS and Cipher Machines: 1930 – 1940
SIS and Cipher Machines: 1930 – 1940 John F Dooley Knox College Presented at the 14th Biennial NSA CCH History Symposium, October 2013 This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 United States License. 1 Thursday, November 7, 2013 1 The Results of Friedman’s Training • The initial training regimen as it related to cipher machines was cryptanalytic • But this detailed analysis of the different machine types informed the team’s cryptographic imaginations when it came to creating their own machines 2 Thursday, November 7, 2013 2 The Machines • Wheatstone/Plett Machine • M-94 • AT&T machine • M-138 and M-138-A • Hebern cipher machine • M-209 • Kryha • Red • IT&T (Parker Hitt) • Purple • Engima • SIGABA (M-134 and M-134-C) • B-211(and B-21) 3 Thursday, November 7, 2013 3 The Wheatstone/Plett Machine • polyalphabetic cipher disk with gearing mechanism rotates the inner alphabet. • Plett’s improvement is to add a second key and mixed alphabet to the inner ring. • Friedman broke this in 1918 Principles: (a) The inner workings of a mechanical cryptographic device can be worked out using a paper and pencil analog of the device. (b) if there is a cycle in the mechanical device (say for particular cipher alphabets), then that cycle can be discovered by analysis of the paper and pencil analog. 4 Thursday, November 7, 2013 4 The Army M-94 • Traces its roots back to Jefferson and Bazieres • Used by US Army from 1922 to circa 1942 • 25 mixed alphabets. Disk order is the key. -
A Complete Bibliography of Publications in Cryptologia
A Complete Bibliography of Publications in Cryptologia Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 04 September 2021 Version 3.64 Title word cross-reference 10016-8810 [?, ?]. 1221 [?]. 125 [?]. 15.00/$23.60.0 [?]. 15th [?, ?]. 16th [?]. 17-18 [?]. 18 [?]. 180-4 [?]. 1812 [?]. 18th (t; m)[?]. (t; n)[?, ?]. $10.00 [?]. $12.00 [?, ?, ?, ?, ?]. 18th-Century [?]. 1930s [?]. [?]. 128 [?]. $139.99 [?]. $15.00 [?]. $16.95 1939 [?]. 1940 [?, ?]. 1940s [?]. 1941 [?]. [?]. $16.96 [?]. $18.95 [?]. $24.00 [?]. 1942 [?]. 1943 [?]. 1945 [?, ?, ?, ?, ?]. $24.00/$34 [?]. $24.95 [?, ?]. $26.95 [?]. 1946 [?, ?]. 1950s [?]. 1970s [?]. 1980s [?]. $29.95 [?]. $30.95 [?]. $39 [?]. $43.39 [?]. 1989 [?]. 19th [?, ?]. $45.00 [?]. $5.95 [?]. $54.00 [?]. $54.95 [?]. $54.99 [?]. $6.50 [?]. $6.95 [?]. $69.00 2 [?, ?]. 200/220 [?]. 2000 [?]. 2004 [?, ?]. [?]. $69.95 [?]. $75.00 [?]. $89.95 [?]. th 2008 [?]. 2009 [?]. 2011 [?]. 2013 [?, ?]. [?]. A [?]. A3 [?, ?]. χ [?]. H [?]. k [?, ?]. M 2014 [?]. 2017 [?]. 2019 [?]. 20755-6886 [?, ?]. M 3 [?]. n [?, ?, ?]. [?]. 209 [?, ?, ?, ?, ?, ?]. 20th [?]. 21 [?]. 22 [?]. 220 [?]. 24-Hour [?, ?, ?]. 25 [?, ?]. -Bit [?]. -out-of- [?, ?]. -tests [?]. 25.00/$39.30 [?]. 25.00/839.30 [?]. 25A1 [?]. 25B [?]. 26 [?, ?]. 28147 [?]. 28147-89 000 [?]. 01Q [?, ?]. [?]. 285 [?]. 294 [?]. 2in [?, ?]. 2nd [?, ?, ?, ?]. 1 [?, ?, ?, ?]. 1-4398-1763-4 [?]. 1/2in [?, ?]. 10 [?]. 100 [?]. 10011-4211 [?]. 3 [?, ?, ?, ?]. 3/4in [?, ?]. 30 [?]. 310 1 2 [?, ?, ?, ?, ?, ?, ?]. 312 [?]. 325 [?]. 3336 [?, ?, ?, ?, ?, ?]. affine [?]. [?]. 35 [?]. 36 [?]. 3rd [?]. Afluisterstation [?, ?]. After [?]. Aftermath [?]. Again [?, ?]. Against 4 [?]. 40 [?]. 44 [?]. 45 [?]. 45th [?]. 47 [?]. [?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?]. Age 4in [?, ?]. [?, ?]. Agencies [?]. Agency [?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?].