Security Volume 96 No

Total Page:16

File Type:pdf, Size:1020Kb

Security Volume 96 No Contents Telektronikk Feature: Security Volume 96 No. 3 – 2000 ISSN 0085-7130 1 Guest Editorial; Editor: Øyvind Eilertsen Ola Espvik Tel: (+47) 63 84 88 83 2 An Introduction to Cryptography; e-mail: [email protected] Øyvind Eilertsen Status section editor: Per Hjalmar Lehne 10 Advanced Encryption Standard (AES). Encryption for our Grandchildren; Tel: (+47) 63 84 88 26 Lars R. Knudsen e-mail: [email protected] 13 Development of Cryptographic Standards for Telecommunications; Editorial assistant: Leif Nilsen Gunhild Luke Tel: (+47) 63 84 86 52 e-mail: [email protected] 21 Show Me Your Public Key and I will Tell Who You Are; Lise Arneberg Editorial office: Telenor AS, Telenor R&D 26 Security in a Future Mobile Internet; PO Box 83 Henning Wright Hansen and Dole Tandberg N-2027 Kjeller Norway Tel: (+47) 63 84 84 00 34 Mobile Agents and (In-)security; Fax: (+47) 63 81 00 76 Tønnes Brekne e-mail: [email protected] 47 An Overview of Firewall Technologies; Editorial board: Habtamu Abie Ole P. Håkonsen, Senior Executive Vice President. 53 CORBA Firewall Security: Increasing the Security of CORBA Applications; Oddvar Hesjedal, Vice President, R&D. Habtamu Abie Bjørn Løken, Director. 65 Telenor’s Risk Management Model; Erik Wisløff Graphic design: Design Consult AS, Oslo 69 Risk Analysis in Telenor; Layout and illustrations: Erik Wisløff Gunhild Luke, Britt Kjus, Åse Aardal (Telenor R&D) Prepress: ReclameService as, Oslo Printing: Optimal as, Oslo Circulation: 4,000 Guest Editorial To a certain extent, security has been regarded Although most users are still not concerned with as a matter that should be left to military and the security of services, the awareness is cer- national security interests. With the advent of tainly growing rapidly, and the ability to offer worldwide electronic networks, such miscon- security-enhanced services will become an ever ceptions can be dangerous. Luckily, it is now more important issue for service providers. standard procedure to carry out a risk analysis of all new products and systems before they are Even if the “paper-less office” is still far from put into service. A problem is that security con- becoming a reality, more and more information siderations are often ignored until the product that previously only existed on paper is now is almost finished, when someone remembers: stored on electronic media. While this develop- “Oh, and we need some security”. Security fea- ment makes it easier to share information among tures are among the first to be removed from those who need it in their daily work, it also projects suffering from exceeded budgets. It is increases the potential for outsiders (malicious an important issue to make sure that security is or not) to intrude. Industrial espionage is a threat built into applications from the very beginning. that all competitive companies must consider. Last-minute introduction of security features will generally lead to both higher expenses and In the real world, the so-called “Bribe the secre- poorer security. tary attack” is probably the attack with the low- est complexity of them all, whereas crypto- Apart from the actual physical damage resulting graphic protection often is the strongest link in from a security breach, the loss of goodwill after the chain. Cryptographic security can be quanti- a blearing front page in the tabloid press or a fied (relatively) easily compared to other aspects prime-time news story must not be overlooked. that are much less tangible. Thus, we are in the The latter may actually represent a much more somewhat paradoxical situation that purely aca- serious and long-lasting loss potential. demic weaknesses in otherwise secure crypto- graphic algorithms get a disproportionate inter- This feature section addresses communication est compared to other security risks. Neverthe- security comprising both the security of the less, with the number of available strong algo- users (security services and security as a value rithms, there is simply no excuse for using weak added service) and the security of e.g. a tele- cryptography. phone operator (security against malicious in- truders, competitors, etc.). Physical security (e.g. barbed wire, locks and fences, but also personnel questions) will generally be left out. Telektronikk 3.2000 1 An Introduction to Cryptography ØYVIND EILERTSEN Cryptography constitutes one of the main building blocks of secure communications. While cryptography historically has been largely a military and diplomatic discipline, the develop- ment of electronic communication (e.g. the ubiquitous Internet) and the increased used of computers in almost all layers of society have emphasized the need for secure communica- tion solutions also in the civilian sector. A particularly relevant issue is the so-called “new economy”, including electronic commerce, where the parts involved need cryptographic methods to prove their identity and to protect transactions against unauthorized disclosure and tampering. Øyvind Eilertsen (34) is Re- The purpose of this article is to present an introduction to some of the basic elements of search Scientist at Telenor R&D, cryptography. We will first look briefly at the history of cryptography and then have a closer Kjeller, where he has worked in look at some cryptosystems that are in use today. We conclude with some remarks about the Security group since 1992. Special interests include cryp- an application of quantum theory with possible far-reaching impact on the future of cryp- tography and mobile security. tography. [email protected] 1 Some Basic Notions means of some secure key channel. We write The word Cryptology is derived from the Greek the encryption and decryption as follows: words kryptós “hidden” and lógos “word”. Cryp- tology comprises cryptography (from kryptós C = Ek(P) and P = Dk(C) (1) and graphein, “write”), and cryptanalysis (cryp- tós and analyein (“loosen” or “untangle”). Cryp- The adversary E(ve), who is eavesdropping on tography is the science of principles and tech- the insecure channel between Alice and Bob, niques to hide information such that only those does not have access to k and cannot gain any authorized can reveal the content. Cryptanalysis information from the ciphertext. See Figure 1. describes methods of (unauthorized) solving or breaking of cryptographic systems. 1.1 Ciphers and Codes The principal classes of cryptographic systems A cryptographic algorithm or cipher is a system are codes and ciphers. A code is a system where (mapping) where a plaintext is transformed into sentences, words, syllables, letters, or symbols a ciphertext. This transformation is known as are replaced with certain groups of letters or encryption (or encipherment) and is defined by numbers (code groups). The code groups (nor- a key that is known only by the sender and the mally 2–5 letters or figures) are listed in a code- receiver. The inverse mapping is called decryp- book together with the corresponding plaintexts. tion (or decipherment). The idea behind the code can be to hide the mes- sage from unauthorized persons, to shorten the Breaking a cipher means disclosing the plaintext message in order to save transmission costs (e.g. without prior knowledge of the key. A perfect telegram expenses; bandwidth), or to translate cipher is impossible to break with any (finite) the message into a form that is suitable for trans- amount of resources. mission (e.g. Morse code). During World War II, the resistance movements in e.g. France and In its simplest form, the setting consists of the Norway received coded broadcast messages two persons A(lice) and B(ob)1) who want to from London where a short sentence had a pre- communicate securely over an insecure channel. arranged meaning. “Jean a un moustache très Alice encrypts the plaintext P into the ciphertext longues” was the code signal sent to the French C by means of the encryption function E and the resistance movement to mobilize their forces key k. Likewise, Bob uses the decryption func- once the Allies had landed on the Normandy tion D with k to decrypt C in order to find P. beaches on D-day. Before the communication can take place, Alice and Bob must have exchanged the key k by In this article we will concentrate on ciphers and discuss codes no further. 1) Alice and Bob were first introduced in [7]. 2 Telektronikk 3.2000 1.2 Cryptanalysis Key channel Figure 1 The fundamental While cryptography denotes the search for meth- cryptographic objective ods and algorithms to protect communication against adversaries, cryptanalysis finds weak- Alice Bob nesses in these algorithms (breaks them) to facil- itate eavesdropping or counterfeiting. Cryptanal- ysis is not necessarily “evil”; your friendly Eve cryptanalyst can disclose weaknesses in your systems and propose countermeasures. Much cryptologic research is concerned with finding weak points in existing cryptosystems, and then modify them to withstand these attacks. A fre- quently used method for testing the security The one-time-pad system, where the key and the of computer systems is employing a team of message have the same length, was described by experts with knowledge of security “holes” the American engineer Gilbert S. Vernam in (tiger team), and let them try to break into the 1917. If the key is truly random (e.g. resulting system. from fair coinflips), such a cipher is perfect, as was shown mathematically by Claude Shannon In earlier times, cryptosystems usually depended [9] in 1949. The main drawback with this cipher on the language in which the plaintext was writ- is that the key must be at least as long as the ten. Cryptanalysts employed knowledge of the message, and it must be used only once (hence message language, including the structure, fre- the name). Because of the key exchange prob- quencies of letters and words, and the relation- lem, one-time-pad systems are used only in en- ships between vowels and consonants.
Recommended publications
  • Crypto Review
    Crypto Review Track 3: Security Workshop Overview • What is Cryptography? • Symmetric Key Cryptography • Asymmetric Key Cryptography • Block and Stream Cipher • Digital Signature and Message Digest Cryptography • Cryptography is everywhere German Lorenz cipher machine Cryptography • Cryptography deals with creang documents that can be shared secretly over public communicaon channels • Other terms closely associated – Cryptanalysis = code breaking – Cryptology • Kryptos (hidden or secret) and Logos (descripGon) = secret speech / communicaon • combinaon of cryptography and cryptanalysis • Cryptography is a funcGon of plaintext and a Notaon: Plaintext (P) cryptographic key Ciphertext (C) C = F(P, k) Cryptographic Key (k) Typical Scenario • Alice wants to send a “secret” message to Bob • What are the possible problems? – Data can be intercepted • What are the ways to intercept this message? • How to conceal the message? – Encrypon Crypto Core • Secure key establishment Alice has key (k) Bob has key (k) • Secure communicaon m Confidenality and integrity m m Alice has key (k) Bob has key (k) Source: Dan Boneh, Stanford It can do much more • Digital Signatures • Anonymous communicaon • Anonymous digital cash – Spending a digital coin without anyone knowing my idenGty – Buy online anonymously? • ElecGons and private aucGons – Finding the winner without actually knowing individual votes (privacy) Source: Dan Boneh, Stanford Other uses are also theoreGcally possible (Crypto magic) What did she • Privately outsourcing computaon search for? E(query)
    [Show full text]
  • Simply Turing
    Simply Turing Simply Turing MICHAEL OLINICK SIMPLY CHARLY NEW YORK Copyright © 2020 by Michael Olinick Cover Illustration by José Ramos Cover Design by Scarlett Rugers All rights reserved. No part of this publication may be reproduced, distributed, or transmitted in any form or by any means, including photocopying, recording, or other electronic or mechanical methods, without the prior written permission of the publisher, except in the case of brief quotations embodied in critical reviews and certain other noncommercial uses permitted by copyright law. For permission requests, write to the publisher at the address below. [email protected] ISBN: 978-1-943657-37-7 Brought to you by http://simplycharly.com Contents Praise for Simply Turing vii Other Great Lives x Series Editor's Foreword xi Preface xii Acknowledgements xv 1. Roots and Childhood 1 2. Sherborne and Christopher Morcom 7 3. Cambridge Days 15 4. Birth of the Computer 25 5. Princeton 38 6. Cryptology From Caesar to Turing 44 7. The Enigma Machine 68 8. War Years 85 9. London and the ACE 104 10. Manchester 119 11. Artificial Intelligence 123 12. Mathematical Biology 136 13. Regina vs Turing 146 14. Breaking The Enigma of Death 162 15. Turing’s Legacy 174 Sources 181 Suggested Reading 182 About the Author 185 A Word from the Publisher 186 Praise for Simply Turing “Simply Turing explores the nooks and crannies of Alan Turing’s multifarious life and interests, illuminating with skill and grace the complexities of Turing’s personality and the long-reaching implications of his work.” —Charles Petzold, author of The Annotated Turing: A Guided Tour through Alan Turing’s Historic Paper on Computability and the Turing Machine “Michael Olinick has written a remarkably fresh, detailed study of Turing’s achievements and personal issues.
    [Show full text]
  • 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 [?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?].
    [Show full text]
  • Alan Turing 1 Alan Turing
    Alan Turing 1 Alan Turing Alan Turing Turing at the time of his election to Fellowship of the Royal Society. Born Alan Mathison Turing 23 June 1912 Maida Vale, London, England, United Kingdom Died 7 June 1954 (aged 41) Wilmslow, Cheshire, England, United Kingdom Residence United Kingdom Nationality British Fields Mathematics, Cryptanalysis, Computer science Institutions University of Cambridge Government Code and Cypher School National Physical Laboratory University of Manchester Alma mater King's College, Cambridge Princeton University Doctoral advisor Alonzo Church Doctoral students Robin Gandy Known for Halting problem Turing machine Cryptanalysis of the Enigma Automatic Computing Engine Turing Award Turing test Turing patterns Notable awards Officer of the Order of the British Empire Fellow of the Royal Society Alan Mathison Turing, OBE, FRS ( /ˈtjʊərɪŋ/ TEWR-ing; 23 June 1912 – 7 June 1954), was a British mathematician, logician, cryptanalyst, and computer scientist. He was highly influential in the development of computer science, giving a formalisation of the concepts of "algorithm" and "computation" with the Turing machine, which can be considered a model of a general purpose computer.[1][2][3] Turing is widely considered to be the father of computer science and artificial intelligence.[4] During World War II, Turing worked for the Government Code and Cypher School (GC&CS) at Bletchley Park, Britain's codebreaking centre. For a time he was head of Hut 8, the section responsible for German naval cryptanalysis. He devised a number of techniques for breaking German ciphers, including the method of the bombe, an electromechanical machine that could find settings for the Enigma machine.
    [Show full text]
  • Breaking Enigma Samantha Briasco-Stewart, Kathryn Hendrickson, and Jeremy Wright
    Breaking Enigma Samantha Briasco-Stewart, Kathryn Hendrickson, and Jeremy Wright 1 Introduction 2 2 The Enigma Machine 2 2.1 Encryption and Decryption Process 3 2.2 Enigma Weaknesses 4 2.2.1 Encrypting the Key Twice 4 2.2.2 Cillies 5 2.2.3 The Enigma Machine Itself 5 3 Zygalski Sheets 6 3.1 Using Zygalski Sheets 6 3.2 Programmatic Replication 7 3.3 Weaknesses/Problems 7 4 The Bombe 8 4.1 The Bombe In Code 10 4.1.1 Making Menus 10 4.1.2 Running Menus through the Bombe 10 4.1.3 Checking Stops 11 4.1.4 Creating Messages 11 4.1.5 Automating the Process 11 5 Conclusion 13 References 14 1 Introduction To keep radio communications secure during World War II, forces on both sides of the war relied on encryption. The main encryption scheme used by the German military for most of World War II employed the use of an Enigma machine. As such, Britain employed a large number of codebreakers and analysts to work towards breaking the Enigma-created codes, using many different methods. In this paper, we lay out information we learned while researching these methods, as well as describe our attempts at programatically recreating two methods: Zygalski sheets and the Bombe. 2 The Enigma Machine The Enigma machine was invented at the end of World War I, by a German engineer named Arthur Scherbius. It was commercially available in the 1920s before being adopted by the German military, among others, around the beginning of World War II.
    [Show full text]
  • Problem Set 4: the Lorenz Cipher and the Postman's Computer 2/11/2007
    CS150: Problem Set 4: The Lorenz Cipher and the Postman's Computer Page 1 of 8 University of Virginia, Department of Computer Science cs150: Computer Science — Spring 2007 Out: 12 February 2007 Problem Set 4: Creating Colossi Due: 19 February 2007 (beginning of class) Collaboration Policy - Read Carefully This problem set is intended to help you prepare for Exam 1. You may work on it by yourself or with other students, but you will need to do the exam on your own. Regardless of whether you work alone or with a partner, you are encouraged to discuss this assignment with other students in the class and ask and provide help in useful ways. You may consult any outside resources you wish including books, papers, web sites and people. If you use resources other than the class materials, indicate what you used along with your answer. You have only one week to complete this problem set. We recommend you start early and take advantage of the staffed lab hours . Purpose Get practice with some of the material that will be on Exam 1 including: recursive definitions, procedures, lists, and measuring work. Learn about cryptography and the first problems that were solved by computers. Download: Download ps4.zip to your machine and unzip it into your home directory J:\cs150\ps4 . This file contains: ps4.scm — A template for your answers. You should do the problem set by editing this file. lorenz.scm — Some helpful definitions for this problem set. Background Cryptography means secret writing . The goal of much cryptography is for one person to send a message to another person over a channel that an adversary may be eavesdropping on without the eavesdropper understanding the message.
    [Show full text]
  • Copyrighted Material
    k Trim Size: 170mm x 244mm Walker c01.tex V3 - 01/27/2016 3:11 P.M. Page 1 1 Why Graphics Processing Units Perri Needham1, Andreas W. Götz2 and Ross C. Walker1,2 1San Diego Supercomputer Center, UCSD, La Jolla, CA, USA 2Department of Chemistry and Biochemistry, UCSD, La Jolla, CA, USA 1.1 A Historical Perspective of Parallel Computing k The first general-purpose electronic computers capable of storing instructions came into existence in k 1950. That is not to say, however, that the use of computers to solve electronic structure problems had not already been considered, or realized. From as early as 1930 scientists used a less advanced form of computation to solve their quantum mechanical problems, albeit a group of assistants simultaneously working on mechanical calculators but an early parallel computing machine nonetheless [1]. It was clear from the beginning that solutions to electronic structure problems could not be carried forward to many-electron systems without the use of some computational device to lessen the mathematical burden. Today’s computational scientists rely heavily on the use of parallel electronic computers. Parallel electronic computers can be broadly classified as having either multiple processing ele- ments in the same machine (shared memory) or multiple machines coupled together to form a cluster/ grid of processing elements (distributed memory). These arrangements make it possible to perform calculations concurrently across multiple processing elements, enabling large problems to be broken down into smaller parts that can be solved simultaneously (in parallel). The first electronic computers were primarily designed for and funded by military projects to assist in World War II and the start of the Cold War [2].
    [Show full text]
  • An Introduction to Applied Cryptography
    SI4 { R´eseauxAvanc´es Introduction `ala s´ecurit´edes r´eseauxinformatiques An Introduction to Applied Cryptography Dr. Quentin Jacquemart [email protected] http://www.qj.be/teaching/ 1 / 129 Outline ) Introduction • Classic Cryptography and Cryptanalysis • Principles of Cryptography • Symmetric Cryptography (aka. Secret-Key Cryptography) • Asymmetric Cryptography (aka. Public-Key Cryptography) • Hashes and Message Digests • Conclusion 1 / 129 2 / 129 Introduction I • Cryptography is at the crossroads of mathematics, electronics, and computer science • The use of cryptography to provide confidentiality is self-evident • But cryptography is a cornerstone of network security • Cryptology is a (mathematical) discipline that includes | cryptography: studies how to exchange confidential messages over an unsecured/untrusted channel | cryptanalysis: studies how to extract meaning out of a confidential message, i.e. how to breach cryptography 2 / 129 3 / 129 Introduction II • Plaintext: the message to be exchanged between Alice and Bob (P) • Ciphering: a cryptographic function that encodes the plaintext into ciphertext (encrypt: E(·)) • Ciphertext: result of applying the cipher function to the plain text (unreadable) (C) • Deciphering: a cryptographic function that decodes the ciphertext into plaintext (decrypt: D(·)) • Key: a secret parameter given to the cryptographic functions (K ) 3 / 129 4 / 129 Introduction III Trudy Alice Bob plaintext ciphertext plaintext P E(P) P E(P) = D(E(P)) Encryption Decryption Algorithm Algorithm E(·) D(·)
    [Show full text]
  • Jewel Theatre Audience Guide Addendum: Alan Turing Biography
    Jewel Theatre Audience Guide Addendum: Alan Turing Biography directed by Kirsten Brandt by Susan Myer Silton, Dramaturg © 2019 ALAN TURING The outline of the following overview of Turing’s life is largely based on his biography on Alchetron.com (https://alchetron.com/Alan-Turing), a “social encyclopedia” developed by Alchetron Technologies. It has been embellished with additional information from sources such as Andrew Hodges’ books, Alan Turing: The Enigma (1983) and Turing (1997) as well as his website, https://www.turing.org.uk. The following books have also provided additional information: Prof: Alan Turing Decoded (2015) by Dermot Turing, who is Alan’s nephew by way of his only sibling, John; The Turing Guide by B. Jack Copeland, Jonathan Bowen, Mark Sprevak, and Robin Wilson (2017); and Alan M. Turing, written by his mother, Sara, shortly after he died. The latter was republished in 2012 as Alan M. Turing – Centenary Edition with an Afterword entitled “My Brother Alan” by John Turing. The essay was added when it was discovered among John’s writings following his death. The republication also includes a new Foreword by Martin Davis, an American mathematician known for his model of post-Turing machines. Extended biographies of Christopher Morcom, Dillwyn Knox, Joan Clarke (the character of Pat Green in the play) and Sara Turing, which are provided as Addendums to this Guide, provide additional information about Alan. Beginnings Alan Mathison Turing was an English computer scientist, mathematician, logician, cryptanalyst, philosopher and theoretical biologist. He was born in a nursing home in Maida Vale, a tony residential district of London, England on June 23, 1912.
    [Show full text]
  • Lorenz Cipher
    Cryptography in World War II Jefferson Institute for Lifelong Learning at UVa Spring 2006 David Evans Menu Class 4: • Some loose ends on WWII Modern •Maurice Burnett Cryptography • Modern Cryptography – Modern symmetric ciphers – Public-key cryptosystems http://www.cs.virginia.edu/jillcrypto JILL WWII Crypto Spring 2006 - Class 4: Modern Cryptography 2 British Cipher Machine German Code-Breaking Efforts • Design based on commercial Enigma • About 6,000 people (compare to 12,000 working at Bletchley Park) • 5 rotor wheels (instead • Decentralized: each military branch had of 3 in Enigma) their own, didn’t share what they learned • Multiple rings per rotor • Effective against manual codes: broke • Last 2 rotor wheels about 50% of manually coded messages didn’t rotate • Didn’t attempt to break rotor-based • British attempted to ciphers – so confident Enigma was break it (without unbreakable, didn’t try to Typex and success) similar machines Typex Machine JILL WWII Crypto Spring 2006 - Class 4: Modern Cryptography 3 JILL WWII Crypto Spring 2006 - Class 4: Modern Cryptography 4 Lorenz Cipher From http://www.codesandciphers.org.uk/lorenz/fish.htm JILL WWII Crypto Spring 2006 - Class 4: Modern Cryptography 5 JILL WWII Crypto Spring 2006 - Class 4: Modern Cryptography 6 1 Modern Symmetric Ciphers Modern Ciphers A billion billion is a large number, but it's not that large a number. Whitfield Diffie • AES (Rijndael) successor to DES selected 2001 • Same idea but: • 128-bit keys, encrypt 128-bit blocks –Use digital logic instead of • Brute force
    [Show full text]
  • 19 Lorenz Cipher Machine 19 Lorenz Cipher Machine
    Pupil Text MEP: Codes and Ciphers, UNIT 19 Lorenz Cipher Machine 19 Lorenz Cipher Machine During the Second World War, the codebreakers at Bletchley Park devised a variety of techniques that enabled the Allies to break the major codes used by the Germans. Not only was this hugely significant in helping the Allies to win the war, but it also led on to whole new branches of statistical analysis and to the development of the electronic computer. In this unit we will illustrate how one of the important ciphers used by the Germans was broken. The cipher is the Lorenz cipher which was based on the use of five bit binary numbers. ENCIPHER The code used to convert letters to binary numbers is given below. A 11000 B 10011 C 01110 D 10010 E 10000 F 10110 G 01011 H 00101 I 01100 J 11010 K 11110 L 01001 M 00111 N 00110 O 00011 P 01101 Q 11101 R 01010 S 10100 T 00001 U 11100 V 01111 W 11001 X 10111 Y 10101 Z 10001 There were also six special symbols used to control the automatic printers – these are given below. 3 00010 4 01000 8 11111 9 00100 + 11011 / 00000 These special symbols did not have their usual meanings; the only one to be used in messages is '9' which means 'a space' (between words). Clearly, if this was the code, it would not take too long to break it (letter frequency, for example, could be used). But the code-writers also used a 'key' letter to add to each plaintext letter in order to disguise it.
    [Show full text]
  • John Hunt Professor Derek Bruff FYWS Cryptography 28 October
    Hunt 1 John Hunt Professor Derek Bruff FYWS Cryptography 28 October 2010 Most people familiar with codes and cryptography have at least heard of the German Enigma Machines. However, very few people have heard of the Lorenz Cipher Machine. The Lorenz Schlüsselzusatz 43, also known as the Lorenz SZ 43, was the successor of the enigma machines and was used throughout World War II by the Hitler and his commanding officers. The SZ 43 is notable not only for the advancements that it created in the field of cryptography but also the advancements made by cryptanalysis in order to counter the innovation, specifically the invention of Colossus, the predecessor of the modern computer. The German Enigma machines offered the strongest form of encryption available to the Germans for quite a while. Unfortunately those machines had their flaws, namely the difficulty and amount of time needed to send a message. When an enigma machine was used one person would type the message in plaintext, for each letter struck, a different letter of cipher text would be flashed on a bulb and an assistant would record whatever letter appeared in the ciphertext. Then a radio operator would take the encrypted message and, using Morse code, send the message to the receiver. The entire process would then have to be reversed in order for the original message to be read (Copeland 36). This process required six people and obviously took a substantial amount of time to do. The SZ 43 simplified the process by requiring only one person to type in the original message.
    [Show full text]