1999 version 2001 simplified version
|
|
|
- Camron Watson
- 6 years ago
- Views:
Transcription
1 香港中文大學讀書會
2 1999 version 2001 simplified version
3 Author Simon Singh 1. Fermat s Last Theorem the epic quest to Solve the World's Greatest Mathematical Problem(2007) 2. The Code Book(1999) 3. Big Bang -about the Big Bang theory and the origins of the universe(2005) 4. Trick or Treatment? Alternative Medicine on Trial -about complementary and alternative medicine(2008)
4 The Book(simplified version) The history of cryptography Chapter I The birth Chapter 2 The development Chapter 3 The mechanization in WWII Side Track Chapter 4 Breaking through the language barrier Entering the modern days Chapter 5 Public/Private key (Modern days) Chapter 6 PGP, the future and the unresolved
5 My story telling approach Manual Stage Mechanized Stage Computer Stage The Enigma Story Alan Turing The Greatest Code Breaker
6 The family tree of encryption Steganography (hidden) Secret Writing Substitution Code (replace words) Cryptography (scrambled) Cipher (replace letters) Transposition
7 Manual Stage Ancient time till early 20th century Encryption Techniques Transposition Rail Fence Scytale Substitution Caesar shift (numerical shift, monoalphabetic) Keyphrase substitution (key shift, monoalphabetic) Vigenere cipher (1553, polyalphabetic), unsolvable for centuries
8 Manual Stage Decipher techniques: Frequency Analysis La Disparition(Georges Perec) A Void (Gilbert Adair) Lipogram(constrainted writing) Interesting stories The Babington Plot, Mary Queen of Scots Charles Babbage vs the Vigenere cipher Beale treasure Zimmermann telegram (WWI)
9 Mechanized Stage German Enigma German Lorenz Japanese Purple Bomba/Bombe Ultra s Colossus
10 Enigma Machine
11 The Enigma Circuit
12 How Enigma do the encryption Code Book Date Key Rotor Plugboard 1 June xfg 2,4,1 AH/CG/YE.. 22 June qcw 5,2,4 CL/TG/EN. Code Book Date Key Rotor Plugboard 1 June xfg 2,4,1 AH/CG/YE.. 22 June qcw 5,2,4 CL/TG/EN. pghpgh Enigma XLUJTT XLUJTT Enigma pghpgh pgh pgh attackatseven Enigma Enigma attackatseven INPNVXRKMGOAD INPNVXRKMGOAD Sender picks a message key e.g. PGH in this case Today is 22 June Receiver A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
13 Complexity of Enigma Before the war During the war Rotorarrangement 3 out of 3 3 out of 5 3P 3 = 6 3P 5 = 60 Rotor initial setting 26 x 26 x x 26 x 26 17,576 17,576 Plugboard 6 pairs of letters 10 pairs of letters 100,391,791, ,738,274,937,250 Possible arrangement About10 16 About Assume to use 1 min. to try one setting, it will take longer than the age of universe (ie. 13.7B years) to try all settings
14 Computer Stage Major problem: key distribution Breakthrough in 1975 by Whitfield Diffie and Martin Hellman at Stanford Concept of public key/private key invented that solve the key distribution problem Practical solution is invented by 3 MIT scientists: Rivest, Shamir and Adleman (RSA) by another 2 years Based on one way function of factorization of two very large prime numbers
15 Public Key/Private Key A. Public key holder can send encrypted message to Private key holder B. Private key holder can issue signed message to Public key holder
16 Public/private key security Private key consist of two very large prime number: p & q Public key consist of N which is the product of p & q Very Easy to get N if you have p & q Very difficult to find p & q if you have N eg. N (order of ) = 114,381,625,757,888,867,669,235,779, 976,146,612,010,218,296,721,242,362,562,561,842,935,706, 935,245,733,897,830,597,123,563,958,705,058,989,075,147, 599,290,026,879,543,541 It took a team 600 people, 17 years to find p & q p = 3,490,529,510,847,650,949,147,849,619,903,898,133,417, 764,638,493,387,843,990,820,577 q = 32,769,132,993,266,709,549,961,988,190,834,461,413, 177,642,967,992,942,539,798,288,533
17 The secret and the future of public key encryption GCHQ has invented the non-secret key (ie. Public/Private key) 4 years earlier Concept is invented by James Ellis Practical solution is invented by Clifford Cocks using one night The RSA future success lies on P vs NP(1 of the 7 millennium problems) Quantum cryptography based on Uncertainty Principle
18 The Enigma Story Developed by Arthur Scherbius (1918) as commercial product Adopted by German military service (1926) Schmidt s treachery (1931) Polish breakthrough before the war (Fingerprint & Bomba) Reveal its work to French &Britain just before the war(1939) Several setbacks by Enigma version upgrade Air force Enigma code is broken at early stage NavyEnigmacode is the hardest to break, finally broken by luck, bravely, tricks and the genius of Alan Turing Hilter s Lorenz code is broken by Ultra s Colossus programmable machine by Tommy Flowers based on Turing s ideas in 1936 (Universal Turing Machine)
19 Luck, Bravely and Tricks Treachery Procedural flaws Operator mistakes Rigidity of military protocol Seizing the codebook from U-boat Minimizing tell-tale signs Ping Pong technique
20 The Polish Breakthrough French gives up and passes all the Enigma information to Poland under a military corporation agreement (early 30) Rejewski discovered the weakness of the repeated message key Repetition leads to pattern The message key encrypted twice jeopardize Enigma Marian Rejewski
21 Exploiting the Engima weakness 1st 2nd 3rd 4th 5th 6th 1st message L O K R G M 2nd message M V T X Z E 3rd message J K T M P E 4th message D V Y P Z X 1st Letter A B C D E F G H I J K L M N P O P Q R S T U V W X Y Z 4th Letter P M R X After enough messages are collected, the complete relationship is found: 1st Letter A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 4th Letter F Q H P L W O G B M V R X U Y C Z I T N J E A S D K A F W A 3 Links B Q Z K V E L R I B 9 Links C H G O Y D P C 7 Links J M X S T N U J 7 Links
22 Exploiting the Enigma weakness Rejewski found that the chain length is independent of the plugboard setting Thus, the chain length is the signature (fingerprint) of the rotor setting Number of rotor setting = 6 x 26 x 26 x 26 = 105,456 Manageable Prepare a catalogue of chain length (in one whole year) Invented Bomba to speed up the searching process Predictable message key called Cillies also help speeding up the search of day key
23 German Naval Enigma No repeated message key Cannot produce the fingerprint Other cryptanalysts have already given up breaking the naval enigma code Alan Turing took up the problem on his own, thus he broke the German Naval Enigma code single-handedly It is always difficult to say that anyone is absolutely indispensable but if anyone was indispensable to Hut 8 it was Turing. The pioneer work always tends to be forgotten when experience and routine later make everything seems easy and many of us in Hut 8 felt that the magnitude of Turing s contribution was never fully realized by the outside world. Hugh Alexander History of Naval Enigma Alan Turing statue at Bletchley Park
24 Turing genius ideas Studied library of decrypted messages and noticed a rigid structure in most messages He could predict part of the contents of un-deciphered message eg. wetter appears in all messages intercepted at 6:05am Plain text associated with cipher text, the combination is called Crib Another Enigma weakness: will not encipher a letter as itself, a feature of the reflector That helps speed up the location of the crib in the cipher text Designed Bombe to check thousands of the rotor settings
25 Lorenz and Colossus Lorenz cipher was used to encrypt communications between Hilter and his generals Lorenz SZ40 was far more complicated than Enigma One weakness was discovered (not to be discussed here) Breaking Lorenz required searching, matching, statistical analysis and careful judgment Based on Alan Turing ideas on his 1936 paper, Max Newman (teacher of Alan Turing) designed the Colossus but Blatchley s officials shelved the project to build it Tommy Flowers ignored the decision and built it by himself Colossus is programmable Probably the first modern digital computer All Colossus machines and design document were destroyed after the war
26 Alan Turing Year in HK
Cryptography. The Making and Breaking of Secret Codes. 5/29/2009 John C. Polking, Rice University 1
Cryptography The Making and Breaking of Secret Codes. 5/29/2009 John C. Polking, Rice University 1 Need for Cryptography Many areas of human endeavor require secret communication. Modern methods of communication
Cristina Nita-Rotaru. CS355: Cryptography. Lecture 4: Enigma.
CS355: Cryptography Lecture 4: Enigma. Towards cryptographic engines } How to move from pencil and paper to more automatic ways of encrypting and decrypting? } How to design more secure ciphers } Alberti
Ciphers: Making and Breaking
Ciphers: Making and Breaking Ralph Morelli Trinity College, Hartford (ralph.morelli@trincoll.edu) Smithsonian Institute October 31, 2009 2009 Ralph Morelli You are free to reuse and remix this presentation
Historical cryptography
Historical cryptography CSCI 470: Web Science Keith Vertanen Copyright 2013 Overview Historical cryptography Monoalphabetic substitution ciphers Breaking them Some improvements The cipher of Mary Queen
Algebra for Cryptology
Algebra for Cryptology Arkadii Slinko Department of Mathematics The University of Auckland Auckland, 6 April, 2013 What is cryptology? Cryptology is about communication in the presence of adversaries or
Powers in Modular Arithmetic, and RSA Public Key Cryptography
1 Powers in Modular Arithmetic, and RSA Public Key Cryptography Lecture notes for Access 2006, by Nick Korevaar. It was a long time from Mary Queen of Scotts and substitution ciphers until the end of the
secretsaremadetobefoundoutwithtime UGETGVUCTGOCFGVQDGHQWPFQWVYKVJVKOG Breaking the Code
Breaking the Code To keep your secret is wisdom; but to expect others to keep it is folly. Samuel Johnson Secrets are made to be found out with time Charles Sanford Codes have been used by the military
Number Theory in Cryptography
Number Theory in Cryptography Introduction September 20, 2006 Universidad de los Andes 1 Guessing Numbers 2 Guessing Numbers (person x) (last 6 digits of phone number of x) 3 Guessing Numbers (person x)
1/18 2/16 3/20 4/17 5/6 6/9 7/14 % Please do not write in the spaces above.
1/18 2/16 3/20 4/17 5/6 6/9 7/14 % Please do not write in the spaces above. Directions: You have 50 minutes in which to complete this exam. Please make sure that you read through this entire exam before
CRYPTOGRAPHY AND NUMBER THEORY
CRYPTOGRAPHY AND NUMBER THEORY XINYU SHI Abstract. In this paper, we will discuss a few examples of cryptographic systems, categorized into two different types: symmetric and asymmetric cryptography. We
Final Exam Math 105: Topics in Mathematics Cryptology, the Science of Secret Writing Rhodes College Tuesday, 30 April :30 11:00 a.m.
Final Exam Math 10: Topics in Mathematics Cryptology, the Science of Secret Writing Rhodes College Tuesday, 0 April 2002 :0 11:00 a.m. Instructions: Please be as neat as possible (use a pencil), and show
Facts & Myths of Enigma
Facts & Myths of Enigma Breaking Stereotypes Arkadiusz Orłowski & Kris Gaj How should we begin? Begin at the beginning, and go on till you come to the end: then stop. The King to the White Rabbit Lewis
Clock Arithmetic and Euclid s Algorithm
Clock Arithmetic and Euclid s Algorithm Lecture notes for Access 2008 by Erin Chamberlain. Earlier we discussed Caesar Shifts and other substitution ciphers, and we saw how easy it was to break these ciphers
An Introduction to Cryptography
An Introduction to Cryptography Spotlight on Science J. Robert Buchanan Department of Mathematics Spring 2008 What is Cryptography? cryptography: study of methods for sending messages in a form that only
QUANTUM CRYPTOGRAPHY. BCS, Plymouth University, December 1, Professor Kurt Langfeld Centre for Mathematical Sciences, Plymouth University
QUANTUM CRYPTOGRAPHY BCS, Plymouth University, December 1, 2015 Professor Kurt Langfeld Centre for Mathematical Sciences, Plymouth University OUTLOOK: Quantum Physics Essentials: particles and light are
My brief introduction to cryptography
My brief introduction to cryptography David Thomson dthomson@math.carleton.ca Carleton University September 7, 2013 introduction to cryptography September 7, 2013 1 / 28 Outline 1 The general framework
RSA. Ramki Thurimella
RSA Ramki Thurimella Public-Key Cryptography Symmetric cryptography: same key is used for encryption and decryption. Asymmetric cryptography: different keys used for encryption and decryption. Public-Key
Cryptanalysis. A walk through time. Arka Rai Choudhuri
Cryptanalysis A walk through time Arka Rai Choudhuri arkarai.choudhuri@gmail.com How many can you identify? History (or how I will give you hope of becoming world famous and earning $70 million along
Definition: For a positive integer n, if 0<a<n and gcd(a,n)=1, a is relatively prime to n. Ahmet Burak Can Hacettepe University
Number Theory, Public Key Cryptography, RSA Ahmet Burak Can Hacettepe University abc@hacettepe.edu.tr The Euler Phi Function For a positive integer n, if 0
19 Lorenz Cipher Machine
9 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
Number Theory & Modern Cryptography
Number Theory & Modern Cryptography Week 12 Stallings: Ch 4, 8, 9, 10 CNT-4403: 2.April.2015 1 Introduction Increasing importance in cryptography Public Key Crypto and Signatures Concern operations on
Public Key Cryptography
Public Key Cryptography Spotlight on Science J. Robert Buchanan Department of Mathematics 2011 What is Cryptography? cryptography: study of methods for sending messages in a form that only be understood
Cryptography: A Fairy Tale for Mathematicians and Starring Mathematicians!
Cryptography: A Fairy Tale for Mathematicians and Starring Mathematicians! University of California, Berkeley Mathematics Undergraduate Student Association October 27, 2014 Why Crypto? So why on earth
CRYPTOGRAPHY AND LARGE PRIMES *
CRYPTOGRAPHY AND LARGE PRIMES * B. Hartley University of Manchester, England, and National University of Singapore The word "cryptography" derives from Greek and means "secret writing". Since ancient times,
University of Regina Department of Mathematics & Statistics Final Examination (April 21, 2009)
Make sure that this examination has 10 numbered pages University of Regina Department of Mathematics & Statistics Final Examination 200910 (April 21, 2009) Mathematics 124 The Art and Science of Secret
I.T.I.S. E. DIVINI SAN SEVERINO MARCHE. CRIPTOGRAPHY Monday 9th January 2006
I.T.I.S. E. DIVINI SAN SEVERINO MARCHE CRIPTOGRAPHY Monday 9th January 2006 History of cryptography The history of cryptography dates back thousands of years. Until recent decades, it has been a history
1/16 2/17 3/17 4/7 5/10 6/14 7/19 % Please do not write in the spaces above.
1/16 2/17 3/17 4/7 5/10 6/14 7/19 % Please do not write in the spaces above. Directions: You have 75 minutes in which to complete this exam. Please make sure that you read through this entire exam before
Introduction to Cryptography. Susan Hohenberger
Introduction to Cryptography Susan Hohenberger 1 Cryptography -- from art to science -- more than just encryption -- essential today for non-military applications 2 Symmetric Crypto Shared secret K =>
Great Theoretical Ideas in Computer Science
15-251 Great Theoretical Ideas in Computer Science Lecture 22: Cryptography November 12th, 2015 What is cryptography about? Adversary Eavesdropper I will cut your throat I will cut your throat What is
RSA RSA public key cryptosystem
RSA 1 RSA As we have seen, the security of most cipher systems rests on the users keeping secret a special key, for anyone possessing the key can encrypt and/or decrypt the messages sent between them.
Public Key Cryptography
T H E U N I V E R S I T Y O F B R I T I S H C O L U M B I A Public Key Cryptography EECE 412 1 What is it? Two keys Sender uses recipient s public key to encrypt Receiver uses his private key to decrypt
NUMBER THEORY AND CRYPTOGRAPHY
NUMBER THEORY AND CRYPTOGRAPHY KEITH CONRAD 1. Introduction Cryptography is the study of secret messages. For most of human history, cryptography was important primarily for military or diplomatic purposes
The CRYPTOGRAPHY. Classical cryptography. 1. History of cryptography
The CRYPTOGRAPHY 1. History of cryptography The history of cryptography dates back thousands of years. Until recent decades, it has been a history of classic cryptography of methods of encryption that
Math 412: Number Theory Lecture 13 Applications of
Math 412: Number Theory Lecture 13 Applications of Gexin Yu gyu@wm.edu College of William and Mary Partition of integers A partition λ of the positive integer n is a non increasing sequence of positive
Public Key Cryptography. All secret key algorithms & hash algorithms do the same thing but public key algorithms look very different from each other.
Public Key Cryptography All secret key algorithms & hash algorithms do the same thing but public key algorithms look very different from each other. The thing that is common among all of them is that each
Security Issues in Cloud Computing Modern Cryptography II Asymmetric Cryptography
Security Issues in Cloud Computing Modern Cryptography II Asymmetric Cryptography Peter Schwabe October 21 and 28, 2011 So far we assumed that Alice and Bob both have some key, which nobody else has. How
NUMBER THEORY AND CRYPTOGRAPHY
NUMBER THEORY AND CRYPTOGRAPHY KEITH CONRAD 1. Introduction Cryptography is the study of secret messages. For most of human history, cryptography was important primarily for military or diplomatic purposes
Historical Ciphers. Required Reading. W. Stallings, Cryptography and Network Security, Chapter 2, Classical Encryption Techniques
ECE 646 - Lecture 6 Historical Ciphers Required Reading W tallings, Cryptography and Network ecurity, Chapter, Classical Encryption Techniques A Menezes et al, Handbook of Applied Cryptography, Chapter
Historical Ciphers. ECE Lecture 6. Why (not) to study historical ciphers? Required Reading. Secret Writing. Mary, Queen of Scots
ECE - Lecture Required Reading W tallings, Cryptography and Network ecurity, Historical Ciphers Chapter, Classical Encryption Techniques A Menezes et al, Handbook of Applied Cryptography, Chapter 73 Classical
Circuit Complexity. Circuit complexity is based on boolean circuits instead of Turing machines.
Circuit Complexity Circuit complexity is based on boolean circuits instead of Turing machines. A boolean circuit with n inputs computes a boolean function of n variables. Now, identify true/1 with yes
Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya Resources: Kenneth Rosen,
10 Modular Arithmetic and Cryptography
10 Modular Arithmetic and Cryptography 10.1 Encryption and Decryption Encryption is used to send messages secretly. The sender has a message or plaintext. Encryption by the sender takes the plaintext and
Cryptography. P. Danziger. Transmit...Bob...
10.4 Cryptography P. Danziger 1 Cipher Schemes A cryptographic scheme is an example of a code. The special requirement is that the encoded message be difficult to retrieve without some special piece of
Cryptography and RSA. Group (1854, Cayley) Upcoming Interview? Outline. Commutative or Abelian Groups
Great Theoretical Ideas in CS V. Adamchik CS 15-251 Upcoming Interview? Lecture 24 Carnegie Mellon University Cryptography and RSA How the World's Smartest Company Selects the Most Creative Thinkers Groups
Week 7 An Application to Cryptography
SECTION 9. EULER S GENERALIZATION OF FERMAT S THEOREM 55 Week 7 An Application to Cryptography Cryptography the study of the design and analysis of mathematical techniques that ensure secure communications
Chapter 2 Classical Cryptosystems
Chapter 2 Classical Cryptosystems Note We will use the convention that plaintext will be lowercase and ciphertext will be in all capitals. 2.1 Shift Ciphers The idea of the Caesar cipher: To encrypt, shift
Public Key Algorithms
Public Key Algorithms Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse571-09/
Number Theory: Applications. Number Theory Applications. Hash Functions II. Hash Functions III. Pseudorandom Numbers
Number Theory: Applications Number Theory Applications Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Results from Number Theory have many applications
Public-key Cryptography and elliptic curves
Public-key Cryptography and elliptic curves Dan Nichols nichols@math.umass.edu University of Massachusetts Oct. 14, 2015 Cryptography basics Cryptography is the study of secure communications. Here are
COS433/Math 473: Cryptography. Mark Zhandry Princeton University Spring 2017
COS433/Math 473: Cryptography Mark Zhandry Princeton University Spring 2017 Previously on COS 433 Pre- modern Cryptography 1900 B.C. mid 1900 s A.D With few exceptions, synonymous with encryption c = Enc(k,m)
A Quick Look at some Mathematics and Cryptography A Talk for CLIR at UConn
A Quick Look at some Mathematics and Cryptography A Talk for CLIR at UConn Jeremy Teitelbaum September 5, 2014 Secret Key Ciphers A cipher is a method of communication in which the letters making up the
during transmission safeguard information Cryptography: used to CRYPTOGRAPHY BACKGROUND OF THE MATHEMATICAL
THE MATHEMATICAL BACKGROUND OF CRYPTOGRAPHY Cryptography: used to safeguard information during transmission (e.g., credit card number for internet shopping) as opposed to Coding Theory: used to transmit
Introduction to Cryptography
T H E U N I V E R S I T Y O F B R I T I S H C O L U M B I A Introduction to Cryptography EECE 412 1 Module Outline Historical background Classic ciphers One-time pad The Random Oracle model Random functions:
Single and Entangled photons. Edward Pei
Single and Entangled photons Edward Pei War is most commonly thought of as men fighting with their fist, and power is determined by physical strength. Behind the lines, however, knowledge is power. For
RSA ENCRYPTION USING THREE MERSENNE PRIMES
Int. J. Chem. Sci.: 14(4), 2016, 2273-2278 ISSN 0972-768X www.sadgurupublications.com RSA ENCRYPTION USING THREE MERSENNE PRIMES Ch. J. L. PADMAJA a*, V. S. BHAGAVAN a and B. SRINIVAS b a Department of
Theme : Cryptography. Instructor : Prof. C Pandu Rangan. Speaker : Arun Moorthy CS
1 C Theme : Cryptography Instructor : Prof. C Pandu Rangan Speaker : Arun Moorthy 93115 CS 2 RSA Cryptosystem Outline of the Talk! Introduction to RSA! Working of the RSA system and associated terminology!
Cryptography CS 555. Topic 2: Evolution of Classical Cryptography CS555. Topic 2 1
Cryptography CS 555 Topic 2: Evolution of Classical Cryptography Topic 2 1 Lecture Outline Basics of probability Vigenere cipher. Attacks on Vigenere: Kasisky Test and Index of Coincidence Cipher machines:
Real scripts backgrounder 3 - Polyalphabetic encipherment - XOR as a cipher - RSA algorithm. David Morgan
Real scripts backgrounder 3 - Polyalphabetic encipherment - XOR as a cipher - RSA algorithm David Morgan XOR as a cipher Bit element encipherment elements are 0 and 1 use modulo-2 arithmetic Example: 1
Introduction to Cryptography
slides available for download at: www.math.cm.is.nagoya-u.ac.jp/~buscemi/crypto.pdf Introduction to Cryptography from ancient ciphers to quantum cryptography ブシェーミ F( 計算機数理科学専攻 )buscemi@is.nagoya-u.ac.jp
Lecture (04) Classical Encryption Techniques (III)
Lecture (04) Classical Encryption Techniques (III) Dr. Ahmed M. ElShafee ١ Playfair Cipher one approach to improve security was to encrypt multiple letters the Playfair Cipher is an example invented by
one approach to improve security was to encrypt multiple letters invented by Charles Wheatstone in 1854, but named after his
Lecture (04) Classical Encryption Techniques (III) Dr. Ahmed M. ElShafee ١ The rules for filling in this 5x5 matrix are: L to R, top to bottom, first with keyword after duplicate letters have been removed,
CIS 551 / TCOM 401 Computer and Network Security
CIS 551 / TCOM 401 Computer and Network Security Spring 2008 Lecture 15 3/20/08 CIS/TCOM 551 1 Announcements Project 3 available on the web. Get the handout in class today. Project 3 is due April 4th It
Proving Ultimate Limitations on Computers. Stephen Cook Presented at Classroom Adventures in Mathematics: Summer Institute August 17, 2011
Proving Ultimate Limitations on Computers Stephen Cook Presented at Classroom Adventures in Mathematics: Summer Institute August 17, 2011 1 Computational Complexity This is a branch of mathematics that
Homework 4 for Modular Arithmetic: The RSA Cipher
Homework 4 for Modular Arithmetic: The RSA Cipher Gregory V. Bard April 25, 2018 This is a practice workbook for the RSA cipher. It is not suitable for learning the RSA cipher from scratch. However, there
Unveiling the Chaocipher. Born in Dublin, Ireland on February 11, 1880, John F. Byrne created a cipher called the
Strickland 1 Tanner Strickland Dr. Bruff Math 115F 2 November 2010 Unveiling the Chaocipher Born in Dublin, Ireland on February 11, 1880, John F. Byrne created a cipher called the Chaocipher that has long
ADVANCED CRYPTOLOGY (COD2) CTY COURSE SYLLABUS. Week 1. Info sheet, pre-test, Sunday survey, honor codes, computer lab forms, check roster.
ADVANCED CRYPTOLOGY (COD2) CTY COURSE SYLLABUS Week 1 Info sheet, pre-test, Sunday survey, honor codes, computer lab forms, check roster Day 1 Previously in Cryptology : skit Introductions Icebreaker involving
19. Coding for Secrecy
19. Coding for Secrecy 19.1 Introduction Protecting sensitive information from the prying eyes and ears of others is an important issue today as much as it has been for thousands of years. Government secrets,
NUMBER THEORY AND CODES. Álvaro Pelayo WUSTL
NUMBER THEORY AND CODES Álvaro Pelayo WUSTL Talk Goal To develop codes of the sort can tell the world how to put messages in code (public key cryptography) only you can decode them Structure of Talk Part
Introduction to Cryptographic Engineering. Steven M. Bellovin
Introduction to Cryptographic Engineering Steven M. Bellovin https://www.cs.columbia.edu/~smb 1 Cryptographic Engineering? There are lots of introductions to encryption But using encryption in the real
THE RSA CRYPTOSYSTEM
THE RSA CRYPTOSYSTEM SILVIA ROBLES Abstract. This paper explores the history and mathematics behind the RSA cryptosystem, including the idea of public key cryptosystems and number theory. It outlines the
The RSA cryptosystem and primality tests
Mathematics, KTH Bengt Ek November 2015 Supplementary material for SF2736, Discrete mathematics: The RSA cryptosystem and primality tests Secret codes (i.e. codes used to make messages unreadable to outsiders
A Few Facts from Number Theory and the RSA Cryptosystem OVERVIEW. RSA Producing Big Primes. Table of Contents. Overview Basic Facts of Number Theory
A Few Facts from Number Theory and the RSA Cryptosystem Larry Susanka Mathematics Department Bellevue College September 25, 2018 Table of Contents Overview Basic Facts of Number Theory The Idea of Public
Sharing a Secret in Plain Sight. Gregory Quenell
Sharing a Secret in Plain Sight Gregory Quenell 1 The Setting: Alice and Bob want to have a private conversation using email or texting. Alice Bob 2 The Setting: Alice and Bob want to have a private conversation
NOI 2009 Solutions to Contest Tasks
NOI 2009 Solutions to Contest Tasks Martin Henz March 14, 2009 Martin Henz NOI 2009 Solutions to Contest Tasks 1 The Scientific Committee of NOI 2009 Ben Leong Chang Ee-Chien Colin Tan Frank Stephan Martin
Cryptography. pieces from work by Gordon Royle
Cryptography pieces from work by Gordon Royle The set-up Cryptography is the mathematics of devising secure communication systems, whereas cryptanalysis is the mathematics of breaking such systems. We
Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death
Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory
Public-key Cryptography and elliptic curves
Public-key Cryptography and elliptic curves Dan Nichols University of Massachusetts Amherst nichols@math.umass.edu WINRS Research Symposium Brown University March 4, 2017 Cryptography basics Cryptography
Practice Assignment 2 Discussion 24/02/ /02/2018
German University in Cairo Faculty of MET (CSEN 1001 Computer and Network Security Course) Dr. Amr El Mougy 1 RSA 1.1 RSA Encryption Practice Assignment 2 Discussion 24/02/2018-29/02/2018 Perform encryption
LECTURE 5: APPLICATIONS TO CRYPTOGRAPHY AND COMPUTATIONS
LECTURE 5: APPLICATIONS TO CRYPTOGRAPHY AND COMPUTATIONS Modular arithmetics that we have discussed in the previous lectures is very useful in Cryptography and Computer Science. Here we discuss several
Computer Security. 07. Cryptography. Paul Krzyzanowski. Rutgers University. Spring 2017
Computer Security 07. Cryptography Paul Krzyzanowski Rutgers University Spring 2017 March 26, 2017 CS 419 2017 Paul Krzyzanowski 1 cryptography κρυπός γραφία hidden writing A secret manner of writing,
Simple Math: Cryptography
1 Introduction Simple Math: Cryptography This section develops some mathematics before getting to the application. The mathematics that I use involves simple facts from number theory. Number theory is
Lecture 1: Introduction to Public key cryptography
Lecture 1: Introduction to Public key cryptography Thomas Johansson T. Johansson (Lund University) 1 / 44 Key distribution Symmetric key cryptography: Alice and Bob share a common secret key. Some means
Historical cryptography
Historical cryptography Alice Bob Eve CSCI 470: Web Science Keith Vertanen Overview Historical cryptography Monoalphabetic substitution ciphers Breaking them Some improvements The cipher of Mary Queen
Notes. Number Theory: Applications. Notes. Number Theory: Applications. Notes. Hash Functions I
Number Theory: Applications Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 3.4 3.7 of Rosen cse235@cse.unl.edu
AN ENHANCED CRYPTOGRAPHIC SUBSTITUTION METHOD FOR INFORMATION SECURITY
! """#$# AN ENHANCED CRYPTOGRAPHIC SUBSTITUTION METHOD FOR INFORMATION SECURITY *Kallam Ravindra Babu 1, Dr. S. Udaya Kumar 2, Dr. A. Vinaya Babu 3 and Dr. M. Thirupathi Reddy 4 1 Research Scholar (JNTUH),
NET 311D INFORMATION SECURITY
1 NET 311D INFORMATION SECURITY Networks and Communication Department TUTORIAL 3 : Asymmetric Ciphers (RSA) A Symmetric-Key Cryptography (Public-Key Cryptography) Asymmetric-key (public key cryptography)
Slides by Kent Seamons and Tim van der Horst Last Updated: Oct 1, 2013
RSA Slides by Kent Seamons and Tim van der Horst Last Updated: Oct 1, 2013 Recap Recap Number theory o What is a prime number? o What is prime factorization? o What is a GCD? o What does relatively prime
Ti Secured communications
Ti5318800 Secured communications Pekka Jäppinen September 20, 2007 Pekka Jäppinen, Lappeenranta University of Technology: September 20, 2007 Relies on use of two keys: Public and private Sometimes called
Lemma 1.2. (1) If p is prime, then ϕ(p) = p 1. (2) If p q are two primes, then ϕ(pq) = (p 1)(q 1).
1 Background 1.1 The group of units MAT 3343, APPLIED ALGEBRA, FALL 2003 Handout 3: The RSA Cryptosystem Peter Selinger Let (R, +, ) be a ring. Then R forms an abelian group under addition. R does not
Dan Boneh. Introduction. Course Overview
Online Cryptography Course Introduction Course Overview Welcome Course objectives: Learn how crypto primitives work Learn how to use them correctly and reason about security My recommendations: Take notes
Cryptography A Lecture in CE Freshman Seminar Series: Ten Puzzling Problems in Computer Engineering. Apr Cryptography Slide 1
Cryptography A Lecture in CE Freshman Seminar Series: Ten Puzzling Problems in Computer Engineering Apr. 2016 Cryptography Slide 1 About This Presentation This presentation belongs to the lecture series
Specialized Cryptanalytic Machines: Two examples, 60 years apart. Patrick Schaumont ECE Department Virginia Tech
Specialized Cryptanalytic Machines: Two examples, 60 years apart Patrick Schaumont ECE Department Virginia Tech What is cryptanalysis? Cryptography aims to defeat cryptanalysis Cryptanalysis aims to defeat
Introduction to Cryptology. Lecture 2
Introduction to Cryptology Lecture 2 Announcements 2 nd vs. 1 st edition of textbook HW1 due Tuesday 2/9 Readings/quizzes (on Canvas) due Friday 2/12 Agenda Last time Historical ciphers and their cryptanalysis
Foundations of Network and Computer Security
Foundations of Network and Computer Security John Black Lecture #9 Sep 22 nd 2005 CSCI 6268/TLEN 5831, Fall 2005 Announcements Midterm #1, next class (Tues, Sept 27 th ) All lecture materials and readings
Cryptography and Number Theory
Chapter 2 Cryptography and Number Theory 2.1 Cryptography and Modular Arithmetic 2.1.1 Introduction to Cryptography For thousands of years people have searched for ways to send messages in secret. For
CPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 3 January 22, 2013 CPSC 467b, Lecture 3 1/35 Perfect secrecy Caesar cipher Loss of perfection Classical ciphers One-time pad Affine
Quantum Computing 101. ( Everything you wanted to know about quantum computers but were afraid to ask. )
Quantum Computing 101 ( Everything you wanted to know about quantum computers but were afraid to ask. ) Copyright Chris Lomont, 2004 2 67 1 = 193707721 761838257287 Took American Mathematician Frank Nelson
ACCESS: Cryptography
ACCESS: Cryptography E. Chamberlain, F. Guevara Vasquez, C. Hohenegger, and N. Korevaar June 24, 2014 1 Introduction Cryptography or the art of transmitted hidden messages has been long associated for
History of Maths andx
History of Maths andx where x Cryptography Substitution ciphers: Ancient - Renaissance A talk at the University of Nottingham by Peter Rowlett "The history of codes and ciphers is the story of the centuries-old
Public Key 9/17/2018. Symmetric Cryptography Review. Symmetric Cryptography: Shortcomings (1) Symmetric Cryptography: Analogy
Symmetric Cryptography Review Alice Bob Public Key x e K (x) y d K (y) x K K Instructor: Dr. Wei (Lisa) Li Department of Computer Science, GSU Two properties of symmetric (secret-key) crypto-systems: The