My brief introduction to cryptography
|
|
|
- Paul Allison
- 5 years ago
- Views:
Transcription
1 My brief introduction to cryptography David Thomson Carleton University September 7, 2013 introduction to cryptography September 7, / 28
2 Outline 1 The general framework 2 Historical ciphers Pre-20th century World War I 3 Modern block ciphers DES/AES 4 A little number theory Mathematics!!! Hard problems 5 Intro to public-key Diffie-Hellman(-Merkle) RSA 6 Conclusions introduction to cryptography September 7, / 28
3 A simple game Alice and Bob want to exchange information without Eve finding out the message. introduction to cryptography September 7, / 28
4 Some assumptions Encryption and Decryption should be easy for Alice and Bob but should be impossible for Eve. A common theme that we will find is that security and practicality are almost always trade-offs. The inherent assumption is that the opponent will discover the nature of the system. In other words the inner workings of the cryptosystem is public. The only secret is the shared key. introduction to cryptography September 7, / 28
5 A pretty picture introduction to cryptography September 7, / 28
6 Greek transposition cipher A long strip of paper was wrapped around a staff and the message written. When unwrapped, it appears as a random jumble of letters. introduction to cryptography September 7, / 28
7 Greek transposition cipher A long strip of paper was wrapped around a staff and the message written. When unwrapped, it appears as a random jumble of letters. The diameter of the staff is the secret key introduction to cryptography September 7, / 28
8 Caesar cipher Introduced by Julius Caesar. Shift letters 3 to the right (mod 26): A D, B E,, X A, Y B, Z C. Example. Decode PDWK UXOHV! introduction to cryptography September 7, / 28
9 Some other examples Substitution ciphers. Any permutation of letters. Easy to break by simple frequency analysis. Leonardo da Vinci. Trained himself to write in mirror-image. Simple to read but mirrors were expensive. introduction to cryptography September 7, / 28
10 What s the problem? introduction to cryptography September 7, / 28
11 Product cipher: ADFGVX Cipher created by the Germans in World War I. 26 letters and 10 numbers can be expressed as a 6 6 grid. introduction to cryptography September 7, / 28
12 Product cipher: ADFGVX Cipher created by the Germans in World War I. 26 letters and 10 numbers can be expressed as a 6 6 grid. A D F G V X A K Z W R I F D 9 B 6 C L 5 F Q 7 5 P G X G E V Y 3 A N V 8 0 D H O 2 X U 4 1 S T M Grid is public knowledge! Secret key is a word with no repeated letters. Our secret key is DANIEL. introduction to cryptography September 7, / 28
13 Product cipher: ADFGVX Cipher created by the Germans in World War I. 26 letters and 10 numbers can be expressed as a 6 6 grid. A D F G V X A K Z W R I F D 9 B 6 C L 5 F Q 7 5 P G X G E V Y 3 A N V 8 0 D H O 2 X U 4 1 S T M Grid is public knowledge! Secret key is a word with no repeated letters. Our secret key is DANIEL. Two-step process: Encode the word, then shuffle. introduction to cryptography September 7, / 28
14 ADFGVX cont d A D F G V X A K Z W R I F D 9 B 6 C L 5 F Q 7 5 P G X G E V Y 3 A N V 8 0 D H O 2 X U 4 1 S T M Let s encode the word: HELLOS Each letter encoded by row-column index avid Thomson dthomson@math.carleton.ca (Carleton My briefuniversity) introduction to cryptography September 7, / 28
15 ADFGVX cont d A D F G V X A K Z W R I F D 9 B 6 C L 5 F Q 7 5 P G X G E V Y 3 A N V 8 0 D H O 2 X U 4 1 S T M Let s encode the word: HELLOS Each letter encoded by row-column index VG GA DV DV VV XG introduction to cryptography September 7, / 28
16 ADFGVX cont d: Retrieving the ciphertext Encoded message: VG GA DV DV VV XG Number the letters of the secret key lexicographically. In the rows beneath, write out the encoded message, wrapping at the end of the row. D A N I E L avid Thomson dthomson@math.carleton.ca (Carleton My briefuniversity) introduction to cryptography September 7, / 28
17 ADFGVX cont d: Retrieving the ciphertext Encoded message: VG GA DV DV VV XG Number the letters of the secret key lexicographically. In the rows beneath, write out the encoded message, wrapping at the end of the row. D A N I E L avid Thomson dthomson@math.carleton.ca (Carleton My briefuniversity) introduction to cryptography September 7, / 28
18 ADFGVX cont d: Retrieving the ciphertext Encoded message: VG GA DV DV VV XG Number the letters of the secret key lexicographically. In the rows beneath, write out the encoded message, wrapping at the end of the row. D A N I E L V G G A D V D V V V X G avid Thomson dthomson@math.carleton.ca (Carleton My briefuniversity) introduction to cryptography September 7, / 28
19 ADFGVX cont d: Retrieving the ciphertext Encoded message: VG GA DV DV VV XG Number the letters of the secret key lexicographically. In the rows beneath, write out the encoded message, wrapping at the end of the row. D A N I E L V G G A D V D V V V X G The ciphertext is given by reading down the columns in numerical order: avid Thomson dthomson@math.carleton.ca (Carleton My briefuniversity) introduction to cryptography September 7, / 28
20 ADFGVX cont d: Retrieving the ciphertext Encoded message: VG GA DV DV VV XG Number the letters of the secret key lexicographically. In the rows beneath, write out the encoded message, wrapping at the end of the row. D A N I E L V G G A D V D V V V X G The ciphertext is given by reading down the columns in numerical order: Ciphertext: GV VD DX AV VG GV avid Thomson dthomson@math.carleton.ca (Carleton My briefuniversity) introduction to cryptography September 7, / 28
21 Data Encryption Standard DES is the first commercial-grade modern algorithm for cryptography. DES is a block cipher that combines permutations and substitutions Introduced in the mid-1970s by IBM. The United States National Security Agency tweaked the original DES design (S-boxes) to make it more secure. DES is now considered to be insecure, owing largely to a key size of only 56 bits. (Wikipedia) distributed.net collaborated to publicly break a DES key in 22 hours and 15 minutes. This can be done on a home computer (sitting in the corner for a long time), today. introduction to cryptography September 7, / 28
22 More DES We sent the S-boxes off to Washington. They came back and were all different. I don t want to cite Wikipedia twice in 2 slides but they really have a good read on the history (with citations!!) of DES and the NSA. rams: Key-size of 56 bits and block size of 64 bits. Breaks the block into half-blocks, and the key into subkeys. Runs each half-block and sub-key through 16 rounds of the following system. introduction to cryptography September 7, / 28
23 introduction to cryptography September 7, / 28
24 Greatest common divisors If p and q are two integers, we call the greatest common divisor d = gcd(p, q) the greatest integer such that d divides p and d divides q. If d = 1 we call p and q relatively prime. By the Extended Euclidean Algorithm we can compute integers a and b such that d = ap + bq. introduction to cryptography September 7, / 28
25 Just a little theorem Definition. Let G be a group and let G = n, we call n the order of G. Theorem. (Lagrange - mid 18th century) Suppose a G, then a n = 1 G. Theorem. (Euler - early-mid 18th century) Suppose a is an integer relatively prime to n. Then a φ(n) 1 (mod n). Fermat s Little Theorem - early 17th century. If p is a prime number then for any integer a we have a p a (mod p). introduction to cryptography September 7, / 28
26 What remains in China... Chinese Remainder Theorem. Suppose n 1, n 2,..., n k are positive integers with gcd(n i, n j ) = 1, 1 i < j k. For any given a 1, a 2,..., a k there exists an integer x such that x a 1 (mod n 1 ) x a 2 (mod n 2 ) x a k (mod n k ) and all such solutions x are congruent (mod n 1 n 2 n k ). Thus x y (mod n i ) for all 1 i k if and only if x y (mod n 1 n 2 n k ). introduction to cryptography September 7, / 28
27 Finite fields Let p be a prime, then Z p, the set of integers (mod p) forms a field with respect to addition and multiplication (mod p). If F is a finite field, then F has order q = p n and we can view F as the vector space Z n p. So, we can model binary words of length n in the vector space Z n 2... introduction to cryptography September 7, / 28
28 Hard problems - Integer factorization The integer factorization problem is: given an integer n, determine its prime factorization, i.e., write n = p e 1 1 pe k k where the p i are distinct primes and e i > 1. Much harder than primality testing! The AKS primality test shows that primality testing is in P. Algorithms split into general purpose (for all types of integers) and special purpose (for integers of prescribed form). The best general-purpose factoring algorithm is the number field sieve developed by Lenstra and Lenstra in the early 90s. Number field sieve runs in sub-exponential time ( O(n 1/3 log(n) 2/3 )). introduction to cryptography September 7, / 28
29 Easy problems - Continuous logarithms Given y R, it is easy to find x such that y = e x (i.e., x = ln(y)). When x < 1, log (1/(1 x)) = 1 + x + x 2 /2 + x 3 /3 +. The logarithm of a real number is simple to compute. introduction to cryptography September 7, / 28
30 Hard problems - Discrete logarithms Problem. In a cyclic group G with generator g, if y is an element of G, find x such that y = g x. The integer 1 x q 1 is the discrete logarithm of y, denoted DLOG g (y). The discrete logarithm follows the same arithmetic rules as the continuous, can be implemented in any finite cyclic group, commonly taken to be the multiplicative group of a finite field avid Thomson dthomson@math.carleton.ca (Carleton My briefuniversity) introduction to cryptography September 7, / 28
31 Hard problems - Discrete logarithms Problem. In a cyclic group G with generator g, if y is an element of G, find x such that y = g x. The integer 1 x q 1 is the discrete logarithm of y, denoted DLOG g (y). The discrete logarithm follows the same arithmetic rules as the continuous, can be implemented in any finite cyclic group, commonly taken to be the multiplicative group of a finite field quantum computers reduce the run time of calculating the discrete logarithm (polynomial time somewhat greater than O(log(N) 3 ). avid Thomson dthomson@math.carleton.ca (Carleton My briefuniversity) introduction to cryptography September 7, / 28
32 Diffie Hellman Key Exchange Protocol Diffie-Hellman is not a cryptosystem!!! Diffie-Hellman is a key-exchange protocol. Developed in 1976 by researchers at Stanford. Paper was written by Diffie and Hellman, but the concept was developed by Merkle. Based on the difficulty of the discrete-logarithm problem. Controversy!!! avid Thomson dthomson@math.carleton.ca (Carleton My briefuniversity) introduction to cryptography September 7, / 28
33 Diffie Hellman Key Exchange Protocol Diffie-Hellman is not a cryptosystem!!! Diffie-Hellman is a key-exchange protocol. Developed in 1976 by researchers at Stanford. Paper was written by Diffie and Hellman, but the concept was developed by Merkle. Based on the difficulty of the discrete-logarithm problem. Controversy!!! The British services took credit for developing key-exchange in This was not made public until Who do you think is actually the founder? avid Thomson dthomson@math.carleton.ca (Carleton My briefuniversity) introduction to cryptography September 7, / 28
34 Diffie-Hellman: The mystery explained Public information: a prime power q and a generator g such that F q =< g >. Alice Secret key a Compute g a Receive g b Bob Secret key b Compute g b Receive g a avid Thomson dthomson@math.carleton.ca (Carleton My briefuniversity) introduction to cryptography September 7, / 28
35 Diffie-Hellman: The mystery explained Public information: a prime power q and a generator g such that F q =< g >. Alice Secret key a Compute g a Receive g b Compute (g b ) a Bob Secret key b Compute g b Receive g a Compute (g a ) b Public key is g ab introduction to cryptography September 7, / 28
36 What is RSA?? Reference: Handbook of Applied Cryptography by Menezes, van Oorschot and Vanstone, U of Waterloo, RSA stands for Rivest, Shamir and Adleman, originally submitted as a patent. Security of RSA is based on the difficulty of integer factorization. Can also be used for digital signatures (but that s another talk). introduction to cryptography September 7, / 28
37 RSA Key Generation 1 Pick two large primes p and q, roughly the same size, at random. 2 Compute n = pq and φ = (p 1)(q 1). 3 Select a random integer e such that gcd(e, φ) = 1. 4 Use Extended Euclidean Algorithm to find d, 1 < d < φ such that ed 1 (mod φ). 5 The public key is the pair (n, e); the secret key is d. introduction to cryptography September 7, / 28
38 RSA Encryption/Decryption crypt Bob does the following: 1 Receive the public key (n, e) from Alice. 2 Represent the message m in the interval [0, n 1]. 3 Compute c = m e (mod n). 4 Send c to Alice. crypt Alice does: 1 Compute m = c d (mod n). introduction to cryptography September 7, / 28
39 Some concluding remarks Public-key cryptography depends on being able to solve a hard problem in reasonable time. RSA depends on the hardness of integer factorization, where elliptic curve cryptography depends on finding the order of a point on an elliptic curve over a finite field bit RSA keys have similar security to 320-bit elliptic curve keys. Your bank probably uses 1024-bit RSA. Lenstra et al. in 2007 factored a 1039-bit number. avid Thomson dthomson@math.carleton.ca (Carleton My briefuniversity) introduction to cryptography September 7, / 28
40 Some concluding remarks Public-key cryptography depends on being able to solve a hard problem in reasonable time. RSA depends on the hardness of integer factorization, where elliptic curve cryptography depends on finding the order of a point on an elliptic curve over a finite field bit RSA keys have similar security to 320-bit elliptic curve keys. Your bank probably uses 1024-bit RSA. Lenstra et al. in 2007 factored a 1039-bit number. Factoring an RSA 768-bit number takes approximately 2000 years of computing power. avid Thomson dthomson@math.carleton.ca (Carleton My briefuniversity) introduction to cryptography September 7, / 28
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
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
Chapter 8 Public-key Cryptography and Digital Signatures
Chapter 8 Public-key Cryptography and Digital Signatures v 1. Introduction to Public-key Cryptography 2. Example of Public-key Algorithm: Diffie- Hellman Key Exchange Scheme 3. RSA Encryption and Digital
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
Cryptography IV: Asymmetric Ciphers
Cryptography IV: Asymmetric Ciphers Computer Security Lecture 7 David Aspinall School of Informatics University of Edinburgh 31st January 2011 Outline Background RSA Diffie-Hellman ElGamal Summary Outline
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
Chapter 4 Asymmetric Cryptography
Chapter 4 Asymmetric Cryptography Introduction Encryption: RSA Key Exchange: Diffie-Hellman [NetSec/SysSec], WS 2008/2009 4.1 Asymmetric Cryptography General idea: Use two different keys -K and +K for
Asymmetric Cryptography
Asymmetric Cryptography Chapter 4 Asymmetric Cryptography Introduction Encryption: RSA Key Exchange: Diffie-Hellman General idea: Use two different keys -K and +K for encryption and decryption Given a
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
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
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
Encryption: The RSA Public Key Cipher
Encryption: The RSA Public Key Cipher Michael Brockway March 5, 2018 Overview Transport-layer security employs an asymmetric public cryptosystem to allow two parties (usually a client application and a
Introduction to Modern Cryptography. Benny Chor
Introduction to Modern Cryptography Benny Chor RSA Public Key Encryption Factoring Algorithms Lecture 7 Tel-Aviv University Revised March 1st, 2008 Reminder: The Prime Number Theorem Let π(x) denote 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
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
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
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,
Discrete Mathematics GCD, LCM, RSA Algorithm
Discrete Mathematics GCD, LCM, RSA Algorithm Abdul Hameed http://informationtechnology.pk/pucit abdul.hameed@pucit.edu.pk Lecture 16 Greatest Common Divisor 2 Greatest common divisor The greatest common
Overview. Background / Context. CSC 580 Cryptography and Computer Security. March 21, 2017
CSC 580 Cryptography and Computer Security Math for Public Key Crypto, RSA, and Diffie-Hellman (Sections 2.4-2.6, 2.8, 9.2, 10.1-10.2) March 21, 2017 Overview Today: Math needed for basic public-key crypto
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
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
Public-Key Encryption: ElGamal, RSA, Rabin
Public-Key Encryption: ElGamal, RSA, Rabin Introduction to Modern Cryptography Benny Applebaum Tel-Aviv University Fall Semester, 2011 12 Public-Key Encryption Syntax Encryption algorithm: E. Decryption
Public-Key Cryptosystems CHAPTER 4
Public-Key Cryptosystems CHAPTER 4 Introduction How to distribute the cryptographic keys? Naïve Solution Naïve Solution Give every user P i a separate random key K ij to communicate with every P j. Disadvantage:
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/
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,
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
MATH3302 Cryptography Problem Set 2
MATH3302 Cryptography Problem Set 2 These questions are based on the material in Section 4: Shannon s Theory, Section 5: Modern Cryptography, Section 6: The Data Encryption Standard, Section 7: International
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
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
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
Topics in Cryptography. Lecture 5: Basic Number Theory
Topics in Cryptography Lecture 5: Basic Number Theory Benny Pinkas page 1 1 Classical symmetric ciphers Alice and Bob share a private key k. System is secure as long as k is secret. Major problem: generating
Introduction to Cryptography. Lecture 8
Introduction to Cryptography Lecture 8 Benny Pinkas page 1 1 Groups we will use Multiplication modulo a prime number p (G, ) = ({1,2,,p-1}, ) E.g., Z 7* = ( {1,2,3,4,5,6}, ) Z p * Z N * Multiplication
Intro to Public Key Cryptography Diffie & Hellman Key Exchange
Introduction to Modern Cryptography Lecture 5 Number Theory: 1. Quadratic residues. 2. The discrete log problem. Intro to Public Key Cryptography Diffie & Hellman Key Exchange Course Summary - Math Part
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
Lecture Notes, Week 6
YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467b: Cryptography and Computer Security Week 6 (rev. 3) Professor M. J. Fischer February 15 & 17, 2005 1 RSA Security Lecture Notes, Week 6 Several
Asymmetric Encryption
-3 s s Encryption Comp Sci 3600 Outline -3 s s 1-3 2 3 4 5 s s Outline -3 s s 1-3 2 3 4 5 s s Function Using Bitwise XOR -3 s s Key Properties for -3 s s The most important property of a hash function
CPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 11 February 21, 2013 CPSC 467b, Lecture 11 1/27 Discrete Logarithm Diffie-Hellman Key Exchange ElGamal Key Agreement Primitive Roots
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
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
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
Introduction to Modern Cryptography. Benny Chor
Introduction to Modern Cryptography Benny Chor RSA: Review and Properties Factoring Algorithms Trapdoor One Way Functions PKC Based on Discrete Logs (Elgamal) Signature Schemes Lecture 8 Tel-Aviv University
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
Mathematics of Cryptography
UNIT - III Mathematics of Cryptography Part III: Primes and Related Congruence Equations 1 Objectives To introduce prime numbers and their applications in cryptography. To discuss some primality test algorithms
and Other Fun Stuff James L. Massey
Lectures in Cryptology 10-14 October 2005 School of Engineering and Science International University Bremen Lecture 3: Public-Key Cryptography and Other Fun Stuff James L. Massey [Prof.-em. ETH Zürich,
Introduction to Cryptography. Lecture 6
Introduction to Cryptography Lecture 6 Benny Pinkas page 1 Public Key Encryption page 2 Classical symmetric ciphers Alice and Bob share a private key k. System is secure as long as k is secret. Major problem:
Discrete mathematics I - Number theory
Discrete mathematics I - Number theory Emil Vatai (based on hungarian slides by László Mérai) 1 January 31, 2018 1 Financed from the financial support ELTE won from the Higher Education
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
1 Recommended Reading 1. 2 Public Key/Private Key Cryptography Overview RSA Algorithm... 2
Contents 1 Recommended Reading 1 2 Public Key/Private Key Cryptography 1 2.1 Overview............................................. 1 2.2 RSA Algorithm.......................................... 2 3 A Number
Biomedical Security. Some Security News 9/17/2018. Erwin M. Bakker. Blockchains are not safe for voting (slashdot.org) : From: paragonie.
Biomedical Security Erwin M. Bakker Some Security News From: NYTimes Blockchains are not safe for voting (slashdot.org) : From Motherboard.vice.com ECDAA: Eliptic Curve Direct Anonymous Attestation for
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
An Introduction to Probabilistic Encryption
Osječki matematički list 6(2006), 37 44 37 An Introduction to Probabilistic Encryption Georg J. Fuchsbauer Abstract. An introduction to probabilistic encryption is given, presenting the first probabilistic
Addition. Ch1 - Algorithms with numbers. Multiplication. al-khwārizmī. al-khwārizmī. Division 53+35=88. Cost? (n number of bits) 13x11=143. Cost?
Ch - Algorithms with numbers Addition Basic arithmetic Addition ultiplication Division odular arithmetic factoring is hard Primality testing 53+35=88 Cost? (n number of bits) O(n) ultiplication al-khwārizmī
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.
L7. Diffie-Hellman (Key Exchange) Protocol. Rocky K. C. Chang, 5 March 2015
L7. Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang, 5 March 2015 1 Outline The basic foundation: multiplicative group modulo prime The basic Diffie-Hellman (DH) protocol The discrete logarithm
CPE 776:DATA SECURITY & CRYPTOGRAPHY. Some Number Theory and Classical Crypto Systems
CPE 776:DATA SECURITY & CRYPTOGRAPHY Some Number Theory and Classical Crypto Systems Dr. Lo ai Tawalbeh Computer Engineering Department Jordan University of Science and Technology Jordan Some Number Theory
basics of security/cryptography
RSA Cryptography basics of security/cryptography Bob encrypts message M into ciphertext C=P(M) using a public key; Bob sends C to Alice Alice decrypts ciphertext back into M using a private key (secret)
OWO Lecture: Modular Arithmetic with Algorithmic Applications
OWO Lecture: Modular Arithmetic with Algorithmic Applications Martin Otto Winter Term 2008/09 Contents 1 Basic ingredients 1 2 Modular arithmetic 2 2.1 Going in circles.......................... 2 2.2
ENEE 457: Computer Systems Security 10/3/16. Lecture 9 RSA Encryption and Diffie-Helmann Key Exchange
ENEE 457: Computer Systems Security 10/3/16 Lecture 9 RSA Encryption and Diffie-Helmann Key Exchange Charalampos (Babis) Papamanthou Department of Electrical and Computer Engineering University of Maryland,
The RSA public encryption scheme: How I learned to stop worrying and love buying stuff online
The RSA public encryption scheme: How I learned to stop worrying and love buying stuff online Anthony Várilly-Alvarado Rice University Mathematics Leadership Institute, June 2010 Our Goal Today I will
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
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
ECE 646 Lecture 9. RSA: Genesis, operation & security
ECE 646 Lecture 9 RSA: Genesis, operation & security Required Reading (1) W. Stallings, "Cryptography and Network-Security," Chapter 8.1 Prime Numbers Chapter 8.2 Fermat's and Euler's Theorems Chapter
Notes 10: Public-key cryptography
MTH6115 Cryptography Notes 10: Public-key cryptography In this section we look at two other schemes that have been proposed for publickey ciphers. The first is interesting because it was the earliest such
Private Key Cryptography. Fermat s Little Theorem. One Time Pads. Public Key Cryptography
Fermat s Little Theorem Private Key Cryptography Theorem 11 (Fermat s Little Theorem): (a) If p prime and gcd(p, a) = 1, then a p 1 1 (mod p). (b) For all a Z, a p a (mod p). Proof. Let A = {1, 2,...,
Introduction to Modern Cryptography. Lecture RSA Public Key CryptoSystem 2. One way Trapdoor Functions
Introduction to Modern Cryptography Lecture 7 1. RSA Public Key CryptoSystem 2. One way Trapdoor Functions Diffie and Hellman (76) New Directions in Cryptography Split the Bob s secret key K to two parts:
ECE596C: Handout #11
ECE596C: Handout #11 Public Key Cryptosystems Electrical and Computer Engineering, University of Arizona, Loukas Lazos Abstract In this lecture we introduce necessary mathematical background for studying
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
Other Public-Key Cryptosystems
Other Public-Key Cryptosystems 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-11/
8.1 Principles of Public-Key Cryptosystems
Public-key cryptography is a radical departure from all that has gone before. Right up to modern times all cryptographic systems have been based on the elementary tools of substitution and permutation.
Introduction to Elliptic Curve Cryptography. Anupam Datta
Introduction to Elliptic Curve Cryptography Anupam Datta 18-733 Elliptic Curve Cryptography Public Key Cryptosystem Duality between Elliptic Curve Cryptography and Discrete Log Based Cryptography Groups
Introduction to Public-Key Cryptosystems:
Introduction to Public-Key Cryptosystems: Technical Underpinnings: RSA and Primality Testing Modes of Encryption for RSA Digital Signatures for RSA 1 RSA Block Encryption / Decryption and Signing Each
Lecture 17 - Diffie-Hellman key exchange, pairing, Identity-Based Encryption and Forward Security
Lecture 17 - Diffie-Hellman key exchange, pairing, Identity-Based Encryption and Forward Security Boaz Barak November 21, 2007 Cyclic groups and discrete log A group G is cyclic if there exists a generator
Discrete Logarithm Problem
Discrete Logarithm Problem Finite Fields The finite field GF(q) exists iff q = p e for some prime p. Example: GF(9) GF(9) = {a + bi a, b Z 3, i 2 = i + 1} = {0, 1, 2, i, 1+i, 2+i, 2i, 1+2i, 2+2i} Addition:
Innovation and Cryptoventures. Cryptography 101. Campbell R. Harvey. Duke University, NBER and Investment Strategy Advisor, Man Group, plc
Innovation and Cryptoventures Cryptography 101 Campbell R. Harvey Duke University, NBER and Investment Strategy Advisor, Man Group, plc Revised February 6, 2017 1 Definition Cryptography is the science
Cryptography. Course 1: Remainder: RSA. Jean-Sébastien Coron. September 21, Université du Luxembourg
Course 1: Remainder: RSA Université du Luxembourg September 21, 2010 Public-key encryption Public-key encryption: two keys. One key is made public and used to encrypt. The other key is kept private and
Number Theory. CSS322: Security and Cryptography. Sirindhorn International Institute of Technology Thammasat University CSS322. Number Theory.
CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L06, Steve/Courses/2011/S2/CSS322/Lectures/number.tex,
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
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
Number Theory. Modular Arithmetic
Number Theory The branch of mathematics that is important in IT security especially in cryptography. Deals only in integer numbers and the process can be done in a very fast manner. Modular Arithmetic
Other Public-Key Cryptosystems
Other Public-Key Cryptosystems Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: 10-1 Overview 1. How to exchange
Cryptosystem. Traditional Cryptosystems: The two parties agree on a secret (one to one) function f. To send a message M, thesendersendsthemessage
Cryptosystem Traditional Cryptosystems: The two parties agree on a secret (one to one) function f. To send a message M, thesendersendsthemessage f(m). The receiver computes f 1 (f(m)). Advantage: Cannot
Lecture 14: Hardness Assumptions
CSE 594 : Modern Cryptography 03/23/2017 Lecture 14: Hardness Assumptions Instructor: Omkant Pandey Scribe: Hyungjoon Koo, Parkavi Sundaresan 1 Modular Arithmetic Let N and R be set of natural and real
Introduction to Cybersecurity Cryptography (Part 4)
Introduction to Cybersecurity Cryptography (Part 4) Review of Last Lecture Blockciphers Review of DES Attacks on Blockciphers Advanced Encryption Standard (AES) Modes of Operation MACs and Hashes Message
Introduction to Cybersecurity Cryptography (Part 5)
Introduction to Cybersecurity Cryptography (Part 5) Prof. Dr. Michael Backes 13.01.2017 February 17 th Special Lecture! 45 Minutes Your Choice 1. Automotive Security 2. Smartphone Security 3. Side Channel
Ma/CS 6a Class 3: The RSA Algorithm
Ma/CS 6a Class 3: The RSA Algorithm By Adam Sheffer Reminder: Putnam Competition Signup ends Wednesday 10/08. Signup sheets available in all Sloan classrooms, Math office, or contact Kathy Carreon, kcarreon@caltech.edu.
8 Elliptic Curve Cryptography
8 Elliptic Curve Cryptography 8.1 Elliptic Curves over a Finite Field For the purposes of cryptography, we want to consider an elliptic curve defined over a finite field F p = Z/pZ for p a prime. Given
Mathematics of Public Key Cryptography
Mathematics of Public Key Cryptography Eric Baxter April 12, 2014 Overview Brief review of public-key cryptography Mathematics behind public-key cryptography algorithms What is Public-Key Cryptography?
Lecture V : Public Key Cryptography
Lecture V : Public Key Cryptography Internet Security: Principles & Practices John K. Zao, PhD (Harvard) SMIEEE Amir Rezapoor Computer Science Department, National Chiao Tung University 2 Outline Functional
Eindhoven University of Technology MASTER. Kleptography cryptography with backdoors. Antheunisse, M. Award date: 2015
Eindhoven University of Technology MASTER Kleptography cryptography with backdoors Antheunisse, M. Award date: 2015 Disclaimer This document contains a student thesis (bachelor's or master's), as authored
Introduction to Cybersecurity Cryptography (Part 4)
Introduction to Cybersecurity Cryptography (Part 4) Review of Last Lecture Blockciphers Review of DES Attacks on Blockciphers Advanced Encryption Standard (AES) Modes of Operation MACs and Hashes Message
CS March 17, 2009
Discrete Mathematics CS 2610 March 17, 2009 Number Theory Elementary number theory, concerned with numbers, usually integers and their properties or rational numbers mainly divisibility among integers
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
Number theory (Chapter 4)
EECS 203 Spring 2016 Lecture 12 Page 1 of 8 Number theory (Chapter 4) Review Compute 6 11 mod 13 in an efficient way What is the prime factorization of 100? 138? What is gcd(100, 138)? What is lcm(100,138)?
Review. CS311H: Discrete Mathematics. Number Theory. Computing GCDs. Insight Behind Euclid s Algorithm. Using this Theorem. Euclidian Algorithm
Review CS311H: Discrete Mathematics Number Theory Instructor: Işıl Dillig What does it mean for two ints a, b to be congruent mod m? What is the Division theorem? If a b and a c, does it mean b c? What
Biomedical Security. Overview 9/15/2017. Erwin M. Bakker
Biomedical Security Erwin M. Bakker Overview Cryptography: Algorithms Cryptography: Protocols Pretty Good Privacy (PGP) / B. Schneier Workshop Biomedical Security Biomedical Application Security (guest
CIS 6930/4930 Computer and Network Security. Topic 5.2 Public Key Cryptography
CIS 6930/4930 Computer and Network Security Topic 5.2 Public Key Cryptography 1 Diffie-Hellman Key Exchange 2 Diffie-Hellman Protocol For negotiating a shared secret key using only public communication
Cryptanalysis on An ElGamal-Like Cryptosystem for Encrypting Large Messages
Cryptanalysis on An ElGamal-Like Cryptosystem for Encrypting Large Messages MEI-NA WANG Institute for Information Industry Networks and Multimedia Institute TAIWAN, R.O.C. myrawang@iii.org.tw SUNG-MING
Math.3336: Discrete Mathematics. Mathematical Induction
Math.3336: Discrete Mathematics Mathematical Induction Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall 2018
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!