Shor s algorithm and secret sharing


 August Atkinson
 3 years ago
 Views:
Transcription
1 Shor s algorithm and secret sharing Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 1/41
2 Goals: 1 To explain why the factoring is important. 2 To describe the oldest and most successful public key cryptography. 3 Knowing period is equivalent to breaking RSA. 4 To explain how to compute quantum mechanically. 5 To explain Shor s algorithm. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 2/41
3 Easy and hard problems EASY HARD multiply factoring (Q) determinant permanent Gauss elimination knapsack sorting discrete logarithm (Q) primarility testing traveling salesman problem LL(1) parsing belonging to LL encryption decryption (Q) Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 3/41
4 Example easy p = q = p q = Example hard p q = p =? q =? Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 4/41
5 Why does one need hard problems? Secure communication over networks, bank transactions Distributions of keys By classical trusted channels By quantum mechanical trusted channels By public key algorithms Possible solutions (public key) One needs easily computable but hardtoinvert functions 1 Modular arithmetics 2 Elliptic curves 3 Knapsack 4 Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 5/41
6 RSA an idea Easy to find lagre primes Easy to multiply, to make powers Hard to factorise Factoring is the only known door Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 6/41
7 James Ellis at GCHQ had an idea of public key cryptography Clifford Cocks at GCHQ discovered RSA Whitfield Diffie and Martin Hellman did the same as Ellis Ronald Rivest, Adi Shamir and Leonard Adleman Bibliography (Number theory, RSA, Cryptography) 1 S. Singh, Kniha kódů a šifer, Argo+Dokořán, Praha, W. Stein, Elementary number theory, 2004 (onlline) 3 A. Menezes, P. van Oorschot, S. Vanstone, Handbook of applied cryptography, CRC Press, 1997 (online) Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 7/41
8 Creation the keys Alice wants to receive some secret messages by RSA. 1 She chooses two large primes p, q and computes n = p q. 2 She computes ϕ(n) = (p 1) (q 1) and chooses invertible in Z ϕ(n) number d. Her secret key will be the (n, d). 3 She computes the inverse e = d 1 in Z ϕ(n). The pair (n, e) will be the public key. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 8/41
9 Bob sends a message to Alice 1 Bob computes z = w e in Z n using the Alice s public key (n, e). 2 Bob sends z to Alice by public channel. 3 Alice receives z and computes w = z d in Z n. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 9/41
10 Example 1 Bob wants to send the message PUBLIC KEY CRYPTOGRAPHY to Alice using her public key (2537, 13). 2 Bob first translates the letters into their numerical equivalents. And then groups these numbers into block of four Bob encrypts each plaintext block into a ciphertext block, using the formula z = w 13 mod Encrypting all the plaintext blocks, he obtains the ciphertext message To decrypt the message, Alice chooses her private key (2537, 937) and behaves like Bob. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 10/41
11 Example 1 Eve receives the following message knowing the public key is ( ,55589). 2 She also knows the ASCII code was used. 3 Decrypt the message! Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 11/41
12 1 Brute force attack 2 Factoring n knowing ϕ(n) 3 Factoring n if p and q are close 4 Factoring n knowing d (key ingredient in Shor s algorithm) 5 Other techniques? Open problem: Is Breaking RSA equivalent to factoring n? Question: Can the proof of Generalized Riemann Hypothesis threat the security of RSA? Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 12/41
13 Algorithm in (4) and example 1 We know that a ed a mod n for each a. Then m = ed 1 satisfies a m 1 mod n for all a coprime to n. 2 If m is even and a m/2 1 mod n for several randomly choosen a, set m m/2 and go to step 1. Otherwise let a be such that a m/2 / 1 mod n 3 Compute g gcd(a m/2 1, n) 4 If g > 1 we are done, otherwise go to step 2 and choose different a. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 13/41
14 Algorithm in (4) and example 1 Somehow we discover that the RSA cryptosystem with encryption key ( , ) has the following decryption key ( , ). We use previous algorithm to factor Let m = ed 1 = For each a 20 we find that a m/2 1 mod n. So we replace m m/2 = Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 14/41
15 Algorithm in (4) and example, continued 1 Again we find that a m/2 1 mod n. So we replace m by Yet again, for each a 20, a m/2 1 mod n, so we replace m by This is enough, since 2 m/2 = mod n. 2 Then g = gcd(2 m/2 1, n) = , and we have found a factor of n. 3 Then dividing n by g we find that n = Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 15/41
16 How to break RSA? The crucial point of the previous algorithm was not the knowledge of the decryption key, but the fact that we had know the multiple of the period of the function Breaking RSA algorithm 1 Choose a at random. f (x) = a x mod n. 2 Compute the period r of the function f (x) = a x mod n. 3 If r is even compute t = a r/2 mod n, otherwise go to 1. 4 If t + 1 a r/ mod n, then gcd(t 1, n) > 1 and gcd(t + 1, n)1, otherwise go to step 1. There is at least 50% probability that randomly choosen a satisfies all conditions in the above algorithm. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 16/41
17 Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 17/41
18 The following are equivalent: 1 Turing machine 2 Flowcharts 3 Recursive function 4 Lambda calculus 5 Classical circuit model 6 Quantum circuit model Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 18/41
19 Turing machine Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 19/41
20 Flowchart YES x := x 1 x = 0 NO y := 3 x := x 2 Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 20/41
21 Recursive function f (n) = 0 g(n) = n + 1 h(n, m, p) = n + m n f (0) = 8 f (n + 1) = n + 5 f (n) Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 21/41
22 Lambda calculus λx.yx λx.y(λx.y) (λxy.yx)y Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 22/41
23 Classical circuit x y AND XOR c x y Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 23/41
24 Quantum circuit Identity NOT Hadamard X H Controlled NOT Toffoli Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 24/41
25 Semantics of quantum circuit We describe the action of the circuits on the base vectors. We extend the action on all vectors by linearity. Identity X (NOT) H (Hadamard) ( ) ( 0 1 ) Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 25/41
26 Semantics of quantum circuit, continued cnot (Controlled NOT) Toffoli Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 26/41
27 Quantum logical circuit Quantum NOT Quantum AND x X NOT x x y x y 0 x AND y Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 27/41
28 Quantum logical circuit, continued Quantum XOR x 1 x 1 y x XOR y Quantum COPY x x x Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 28/41
29 Classical and quantum half adder Classical half adder x y AND XOR c x y Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 29/41
30 Shor s Algorithm Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 30/41
31 Shor s Algorithm In the previous section we show that the knowledge of the period of the function f (x) = a x mod n is sufficient to factor n with high probability. The main tast of the Shor s algorithm is to find such a period. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 31/41
32 Shor s Algorithm false approach We begin by using our quantum computer to construct the state 2 t 1 x=0 x f (x). Then we measure the output register. If the measurement yields the value f 0, then the rule of measurement tells us that the state of the input register will be ψ = m 1 j=0 k + jr. Here k is the smallest value of x at which f (x) = k and m is the smallest integer for which mr + k 2 t. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 32/41
33 Shor s Algorithm false approach, continued If we could produce a small number of identical copies of the state ψ we would be done. But this is impossible by the nocloning theorem. And if we ran the whole algorithm again, we would end up with a state ψ for another random value k. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 33/41
34 0 H H H H U f 0 s ) Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 34/41
35 Quantum Fourier transformation The heart of Shor s algorithm is the superfast quantum Fourier transform procedure. The quantum Fourier trannsform on the basis is given by U FT x = 2 n 1 y=0 e 2πixy/2n y. Applying this transform on the state ψ above yields m 1 U FT j=0 k + jr = 2 n 1 y=0 m 1 e 2πiky/2n j=0 e 2πijry/2n y. If we now make a measurement, the probability that we obtain valuable information about r is at least 40%. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 35/41
36 Shor s Algorithm 1 Classical part. 2 Quantum mechanical part. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 36/41
37 Classical part 1 If N is divisible by 2 then return 2. 2 For a 1 and b 2 if N = a b then return a. This can be done classically. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 37/41
38 Quantum mechanical part 1 Choose 1 < x < N. If gcd(n, x) > 1 then return f = gcd(n, x). 2 Select t resp. s such that N 2 < 2 t resp. N 2 s. ψ 1 Initialize register 1, which is t qubits in size to 0 t and register 2, which is s qubits in size to 0 s. ψ 2 Create a superposition on regiter 1: 2 t 1 a=0 a 0 s. ψ 3 Compute f (a) = x a mod N using a quantum circuit, to get a superposition 2 t 1 a=0 a x a mod N. ψ 4 Measure the second register. Now the first register contains the periodic superposition 2 t /r 1 j=0 jr + k for some k. ψ 5 Apply QFT on the first register and measure it. 3 Find the period r of f (a) = x a mod N. If r is even, compute a = gcd(x r/2 + 1, N). If a > 1 then return a. Otherwise go to step 1. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 38/41
39 0 H ) 0 H QFT ) 0 H U f ) 0 H ) 0 s ψ 1 ψ 2 ψ 3 ) ψ 4 ψ 5 Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 39/41
40 Protocol BB84 1 Alice chooses (4 + δ)n random data bits. 2 Alice chooses a random (4 + δ)nbit string b (control bits). She encodes each data bit as { 0, 1 } if the corresponding control bit of b is 0, otherwise she encodes it as { +, }. 3 Alice sends the resulting state to Bob. 4 Bob receives the (4 + δ)n qubits, announces this fact, and measures each qubit in the { 0, 1 } or { +, } basis at random. 5 Alice announces b. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 40/41
41 Protocol BB84 continued 6 Alice and Bob discard any bits where Bob measured a different basis than Alice had prepared. There are at least 2n bits left (if not, abort the protocol). They keep 2n bits. 7 Alice selects a subset of n bits that will serve as a check on Eve s interference, and tells Bob which bits she selected. 8 Alice and Bob announce and compare the value of the n check bits. If more than an acceptable number disagree, they abort the protocol. Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 41/41
PublicKey Cryptography. Oregon State University
PublicKey Cryptography Çetin Kaya Koç Oregon State University 1 Sender M Receiver Adversary Objective: Secure communication over an insecure channel 2 Solution: Secretkey cryptography Exchange the key
More informationCryptography: RSA and the discrete logarithm problem
Cryptography: and the discrete logarithm problem R. Hayden Advanced Maths Lectures Department of Computing Imperial College London February 2010 Public key cryptography Assymmetric cryptography two keys:
More informationApplied Cryptography Public Key Algorithms
Applied Cryptography Public Key Algorithms Sape J. Mullender Huygens Systems Research Laboratory Universiteit Twente Enschede 1 Public Key Cryptography Independently invented by Whitfield Diffie & Martin
More informationModular arithmetic. x ymodn if x = y +mn for some integer m. p. 1/??
p. 1/?? Modular arithmetic Much of modern number theory, and many practical problems (including problems in cryptography and computer science), are concerned with modular arithmetic. While this is probably
More information1720  Forward Secrecy: How to Secure SSL from Attacks by Government Agencies
1720  Forward Secrecy: How to Secure SSL from Attacks by Government Agencies Dave Corbett Technical Product Manager Implementing Forward Secrecy 1 Agenda Part 1: Introduction Why is Forward Secrecy important?
More informationThe Mathematics of the RSA PublicKey Cryptosystem
The Mathematics of the RSA PublicKey Cryptosystem Burt Kaliski RSA Laboratories ABOUT THE AUTHOR: Dr Burt Kaliski is a computer scientist whose involvement with the security industry has been through
More informationMathematics of Internet Security. Keeping Eve The Eavesdropper Away From Your Credit Card Information
The : Keeping Eve The Eavesdropper Away From Your Credit Card Information Department of Mathematics North Dakota State University 16 September 2010 Science Cafe Introduction Disclaimer: is not an internet
More informationLecture Note 5 PUBLICKEY CRYPTOGRAPHY. Sourav Mukhopadhyay
Lecture Note 5 PUBLICKEY CRYPTOGRAPHY Sourav Mukhopadhyay Cryptography and Network Security  MA61027 Modern/Publickey cryptography started in 1976 with the publication of the following paper. W. Diffie
More informationChapter 10 AsymmetricKey Cryptography
Chapter 10 AsymmetricKey Cryptography Copyright The McGrawHill Companies, Inc. Permission required for reproduction or display. 10.1 Chapter 10 Objectives To distinguish between two cryptosystems: symmetrickey
More informationNumber Theory and Cryptography using PARI/GP
Number Theory and Cryptography using Minh Van Nguyen nguyenminh2@gmail.com 25 November 2008 This article uses to study elementary number theory and the RSA public key cryptosystem. Various commands will
More informationPUBLIC KEY ENCRYPTION
PUBLIC KEY ENCRYPTION http://www.tutorialspoint.com/cryptography/public_key_encryption.htm Copyright tutorialspoint.com Public Key Cryptography Unlike symmetric key cryptography, we do not find historical
More informationSecure Network Communication Part II II Public Key Cryptography. Public Key Cryptography
Kommunikationssysteme (KSy)  Block 8 Secure Network Communication Part II II Public Key Cryptography Dr. Andreas Steffen 20002001 A. Steffen, 28.03.2001, KSy_RSA.ppt 1 Secure Key Distribution Problem
More information6 Introduction to Cryptography
6 Introduction to Cryptography This section gives a short introduction to cryptography. It is based on the recent tutorial by Jörg Rothe. For an indepth treatment of cryptography, please consult the Handbook
More informationChapter 10 AsymmetricKey Cryptography
Chapter 10 AsymmetricKey Cryptography Copyright The McGrawHill Companies, Inc. Permission required for reproduction or display. 10.1 Chapter 10 Objectives Present asymmetrickey cryptography. Distinguish
More informationCSCE 465 Computer & Network Security
CSCE 465 Computer & Network Security Instructor: Dr. Guofei Gu http://courses.cse.tamu.edu/guofei/csce465/ Public Key Cryptogrophy 1 Roadmap Introduction RSA DiffieHellman Key Exchange Public key and
More informationCRYPTOGRAPHIC ALGORITHMS (AES, RSA)
CALIFORNIA STATE POLYTECHNIC UNIVERSITY, POMONA CRYPTOGRAPHIC ALGORITHMS (AES, RSA) A PAPER SUBMITTED TO PROFESSOR GILBERT S. YOUNG IN PARTIAL FULFILLMENT OF THE REQUIREMENT FOR THE COURSE CS530 : ADVANCED
More informationQUANTUM COMPUTERS AND CRYPTOGRAPHY. Mark Zhandry Stanford University
QUANTUM COMPUTERS AND CRYPTOGRAPHY Mark Zhandry Stanford University Classical Encryption pk m c = E(pk,m) sk m = D(sk,c) m??? Quantum Computing Attack pk m aka Postquantum Crypto c = E(pk,m) sk m = D(sk,c)
More informationPublic Key Cryptography and RSA. Review: Number Theory Basics
Public Key Cryptography and RSA Murat Kantarcioglu Based on Prof. Ninghui Li s Slides Review: Number Theory Basics Definition An integer n > 1 is called a prime number if its positive divisors are 1 and
More informationNumber Theory and the RSA Public Key Cryptosystem
Number Theory and the RSA Public Key Cryptosystem Minh Van Nguyen nguyenminh2@gmail.com 05 November 2008 This tutorial uses to study elementary number theory and the RSA public key cryptosystem. A number
More informationPRIME NUMBERS & SECRET MESSAGES
PRIME NUMBERS & SECRET MESSAGES I. RSA CODEBREAKER GAME This is a game with two players or teams. The players take turns selecting either prime or composite numbers as outlined on the board below. The
More informationNetwork Security. Chapter 2 Basics 2.2 Public Key Cryptography. Public Key Cryptography. Public Key Cryptography
Chair for Network Architectures and Services Department of Informatics TU München Prof. Carle Encryption/Decryption using Public Key Cryptography Network Security Chapter 2 Basics 2.2 Public Key Cryptography
More informationSECURITY IMPROVMENTS TO THE DIFFIEHELLMAN SCHEMES
www.arpapress.com/volumes/vol8issue1/ijrras_8_1_10.pdf SECURITY IMPROVMENTS TO THE DIFFIEHELLMAN SCHEMES Malek Jakob Kakish Amman Arab University, Department of Computer Information Systems, P.O.Box 2234,
More informationSoftware Tool for Implementing RSA Algorithm
Software Tool for Implementing RSA Algorithm Adriana Borodzhieva, Plamen Manoilov Rousse University Angel Kanchev, Rousse, Bulgaria Abstract: RSA is one of the mostcommon used algorithms for publickey
More informationAnnouncements. CS243: Discrete Structures. More on Cryptography and Mathematical Induction. Agenda for Today. Cryptography
Announcements CS43: Discrete Structures More on Cryptography and Mathematical Induction Işıl Dillig Class canceled next Thursday I am out of town Homework 4 due Oct instead of next Thursday (Oct 18) Işıl
More informationIntroduction to Security Proof of Cryptosystems
Introduction to Security Proof of Cryptosystems D. J. Guan November 16, 2007 Abstract Provide proof of security is the most important work in the design of cryptosystems. Problem reduction is a tool to
More informationOutline. Cryptography. Bret Benesh. Math 331
Outline 1 College of St. Benedict/St. John s University Department of Mathematics Math 331 2 3 The internet is a lawless place, and people have access to all sorts of information. What is keeping people
More informationFactoring integers, Producing primes and the RSA cryptosystem HarishChandra Research Institute
RSA cryptosystem HRI, Allahabad, February, 2005 0 Factoring integers, Producing primes and the RSA cryptosystem HarishChandra Research Institute Allahabad (UP), INDIA February, 2005 RSA cryptosystem HRI,
More informationUNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Introduction to Cryptography ECE 597XX/697XX
UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Introduction to Cryptography ECE 597XX/697XX Part 6 Introduction to PublicKey Cryptography Israel Koren ECE597/697 Koren Part.6.1
More informationDiscrete Mathematics, Chapter 4: Number Theory and Cryptography
Discrete Mathematics, Chapter 4: Number Theory and Cryptography Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 4 1 / 35 Outline 1 Divisibility
More informationElements of Applied Cryptography Public key encryption
Network Security Elements of Applied Cryptography Public key encryption Public key cryptosystem RSA and the factorization problem RSA in practice Other asymmetric ciphers Asymmetric Encryption Scheme Let
More informationLecture 13: Factoring Integers
CS 880: Quantum Information Processing 0/4/0 Lecture 3: Factoring Integers Instructor: Dieter van Melkebeek Scribe: Mark Wellons In this lecture, we review order finding and use this to develop a method
More informationCryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur
Cryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Module No. # 01 Lecture No. # 05 Classic Cryptosystems (Refer Slide Time: 00:42)
More informationAlternative machine models
Alternative machine models Computational complexity thesis: All reasonable computer models can simulate one another in polynomial time (i.e. P is robust or machine independent ). But the Turing machine
More informationCIS 6930 Emerging Topics in Network Security. Topic 2. Network Security Primitives
CIS 6930 Emerging Topics in Network Security Topic 2. Network Security Primitives 1 Outline Absolute basics Encryption/Decryption; Digital signatures; DH key exchange; Hash functions; Application of hash
More informationMATH 168: FINAL PROJECT Troels Eriksen. 1 Introduction
MATH 168: FINAL PROJECT Troels Eriksen 1 Introduction In the later years cryptosystems using elliptic curves have shown up and are claimed to be just as secure as a system like RSA with much smaller key
More informationPrinciples of Public Key Cryptography. Applications of Public Key Cryptography. Security in Public Key Algorithms
Principles of Public Key Cryptography Chapter : Security Techniques Background Secret Key Cryptography Public Key Cryptography Hash Functions Authentication Chapter : Security on Network and Transport
More informationNEW DIGITAL SIGNATURE PROTOCOL BASED ON ELLIPTIC CURVES
NEW DIGITAL SIGNATURE PROTOCOL BASED ON ELLIPTIC CURVES Ounasser Abid 1, Jaouad Ettanfouhi 2 and Omar Khadir 3 1,2,3 Laboratory of Mathematics, Cryptography and Mechanics, Department of Mathematics, Fstm,
More informationNetwork Security. Computer Networking Lecture 08. March 19, 2012. HKU SPACE Community College. HKU SPACE CC CN Lecture 08 1/23
Network Security Computer Networking Lecture 08 HKU SPACE Community College March 19, 2012 HKU SPACE CC CN Lecture 08 1/23 Outline Introduction Cryptography Algorithms Secret Key Algorithm Message Digest
More informationA New Efficient Digital Signature Scheme Algorithm based on Block cipher
IOSR Journal of Computer Engineering (IOSRJCE) ISSN: 22780661, ISBN: 22788727Volume 7, Issue 1 (Nov.  Dec. 2012), PP 4752 A New Efficient Digital Signature Scheme Algorithm based on Block cipher 1
More informationComputer Security: Principles and Practice
Computer Security: Principles and Practice Chapter 20 PublicKey Cryptography and Message Authentication First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown PublicKey Cryptography
More informationBreaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and
Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study
More informationIntroduction. Chapter 1
Chapter 1 Introduction This is a chapter from version 1.1 of the book Mathematics of Public Key Cryptography by Steven Galbraith, available from http://www.isg.rhul.ac.uk/ sdg/cryptobook/ The copyright
More informationCRYPTOGRAPHY IN NETWORK SECURITY
ELE548 Research Essays CRYPTOGRAPHY IN NETWORK SECURITY AUTHOR: SHENGLI LI INSTRUCTOR: DR. JIENCHUNG LO Date: March 5, 1999 Computer network brings lots of great benefits and convenience to us. We can
More information7! Cryptographic Techniques! A Brief Introduction
7! Cryptographic Techniques! A Brief Introduction 7.1! Introduction to Cryptography! 7.2! Symmetric Encryption! 7.3! Asymmetric (PublicKey) Encryption! 7.4! Digital Signatures! 7.5! Public Key Infrastructures
More information9 Modular Exponentiation and Cryptography
9 Modular Exponentiation and Cryptography 9.1 Modular Exponentiation Modular arithmetic is used in cryptography. In particular, modular exponentiation is the cornerstone of what is called the RSA system.
More informationPublic Key Cryptography: RSA and Lots of Number Theory
Public Key Cryptography: RSA and Lots of Number Theory Public vs. PrivateKey Cryptography We have just discussed traditional symmetric cryptography: Uses a single key shared between sender and receiver
More informationQuantum Computing Lecture 7. Quantum Factoring. Anuj Dawar
Quantum Computing Lecture 7 Quantum Factoring Anuj Dawar Quantum Factoring A polynomial time quantum algorithm for factoring numbers was published by Peter Shor in 1994. polynomial time here means that
More informationRSA Attacks. By Abdulaziz Alrasheed and Fatima
RSA Attacks By Abdulaziz Alrasheed and Fatima 1 Introduction Invented by Ron Rivest, Adi Shamir, and Len Adleman [1], the RSA cryptosystem was first revealed in the August 1977 issue of Scientific American.
More informationOverview of PublicKey Cryptography
CS 361S Overview of PublicKey Cryptography Vitaly Shmatikov slide 1 Reading Assignment Kaufman 6.16 slide 2 PublicKey Cryptography public key public key? private key Alice Bob Given: Everybody knows
More informationPublicKey Cryptography RSA Attacks against RSA. Système et Sécurité
PublicKey Cryptography RSA Attacks against RSA Système et Sécurité 1 Public Key Cryptography Overview Proposed in Diffieand Hellman (1976) New Directions in Cryptography publickey encryption schemes
More informationNotes on Network Security Prof. Hemant K. Soni
Chapter 9 Public Key Cryptography and RSA PrivateKey Cryptography traditional private/secret/single key cryptography uses one key shared by both sender and receiver if this key is disclosed communications
More informationΕΠΛ 674: Εργαστήριο 3
ΕΠΛ 674: Εργαστήριο 3 Ο αλγόριθμος ασύμμετρης κρυπτογράφησης RSA Παύλος Αντωνίου Department of Computer Science PrivateKey Cryptography traditional private/secret/single key cryptography uses one key
More informationA SOFTWARE COMPARISON OF RSA AND ECC
International Journal Of Computer Science And Applications Vol. 2, No. 1, April / May 29 ISSN: 97413 A SOFTWARE COMPARISON OF RSA AND ECC Vivek B. Kute Lecturer. CSE Department, SVPCET, Nagpur 9975549138
More informationSoftware Implementation of GongHarn Publickey Cryptosystem and Analysis
Software Implementation of GongHarn Publickey Cryptosystem and Analysis by Susana Sin A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Master
More informationLukasz Pater CMMS Administrator and Developer
Lukasz Pater CMMS Administrator and Developer EDMS 1373428 Agenda Introduction Why do we need asymmetric ciphers? Oneway functions RSA Cipher Message Integrity Examples Secure Socket Layer Single Sign
More informationACTA UNIVERSITATIS APULENSIS No 13/2007 MATHEMATICAL FOUNDATION OF DIGITAL SIGNATURES. Daniela Bojan and Sidonia Vultur
ACTA UNIVERSITATIS APULENSIS No 13/2007 MATHEMATICAL FOUNDATION OF DIGITAL SIGNATURES Daniela Bojan and Sidonia Vultur Abstract.The new services available on the Internet have born the necessity of a permanent
More informationPublic Key Cryptography. c Eli Biham  March 30, 2011 258 Public Key Cryptography
Public Key Cryptography c Eli Biham  March 30, 2011 258 Public Key Cryptography Key Exchange All the ciphers mentioned previously require keys known apriori to all the users, before they can encrypt
More informationThe mathematics of cryptology
The mathematics of cryptology Paul E. Gunnells Department of Mathematics and Statistics University of Massachusetts, Amherst Amherst, MA 01003 www.math.umass.edu/ gunnells April 27, 2004 What is Cryptology?
More informationInternational Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013
FACTORING CRYPTOSYSTEM MODULI WHEN THE COFACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II MohammediaCasablanca,
More informationApplied Cryptology. Ed Crowley
Applied Cryptology Ed Crowley 1 Basics Topics Basic Services and Operations Symmetric Cryptography Encryption and Symmetric Algorithms Asymmetric Cryptography Authentication, Nonrepudiation, and Asymmetric
More informationThe New Approach of Quantum Cryptography in Network Security
The New Approach of Quantum Cryptography in Network Security Avanindra Kumar Lal 1, Anju Rani 2, Dr. Shalini Sharma 3 (Avanindra kumar) Abstract There are multiple encryption techniques at present time
More information3. Applications of Number Theory
3. APPLICATIONS OF NUMBER THEORY 163 3. Applications of Number Theory 3.1. Representation of Integers. Theorem 3.1.1. Given an integer b > 1, every positive integer n can be expresses uniquely as n = a
More informationThe RSA Algorithm. Evgeny Milanov. 3 June 2009
The RSA Algorithm Evgeny Milanov 3 June 2009 In 1978, Ron Rivest, Adi Shamir, and Leonard Adleman introduced a cryptographic algorithm, which was essentially to replace the less secure National Bureau
More informationUOSEC Week 2: Asymmetric Cryptography. Frank IRC kee Adam IRC xe0 IRC: irc.freenode.net #0x4f
UOSEC Week 2: Asymmetric Cryptography Frank farana@uoregon.edu IRC kee Adam pond2@uoregon.edu IRC xe0 IRC: irc.freenode.net #0x4f Agenda HackIM CTF Results GITSC CTF this Saturday 10:00am Basics of Asymmetric
More informationPublic Key (asymmetric) Cryptography
PublicKey Cryptography UNIVERSITA DEGLI STUDI DI PARMA Dipartimento di Ingegneria dell Informazione Public Key (asymmetric) Cryptography Luca Veltri (mail.to: luca.veltri@unipr.it) Course of Network Security,
More informationQuantum Computing. Robert Sizemore
Quantum Computing Robert Sizemore Outline Introduction: What is quantum computing? What use is quantum computing? Overview of Quantum Systems Dirac notation & wave functions Two level systems Classical
More informationBits Superposition Quantum Parallelism
7Qubit Quantum Computer Typical Ion Oscillations in a Trap Bits Qubits vs Each qubit can represent both a or at the same time! This phenomenon is known as Superposition. It leads to Quantum Parallelism
More informationCSC474/574  Information Systems Security: Homework1 Solutions Sketch
CSC474/574  Information Systems Security: Homework1 Solutions Sketch February 20, 2005 1. Consider slide 12 in the handout for topic 2.2. Prove that the decryption process of a oneround Feistel cipher
More informationSymmetric and asymmetric cryptography overview
Symmetric and asymmetric cryptography overview Modern cryptographic methods use a key to control encryption and decryption Two classes of keybased encryption algorithms symmetric (secretkey) asymmetric
More informationThe science of encryption: prime numbers and mod n arithmetic
The science of encryption: prime numbers and mod n arithmetic Go check your email. You ll notice that the webpage address starts with https://. The s at the end stands for secure meaning that a process
More informationSymmetric Key cryptosystem
SFWR C03: Computer Networks and Computer Security Mar 811 200 Lecturer: Kartik Krishnan Lectures 222 Symmetric Key cryptosystem Symmetric encryption, also referred to as conventional encryption or single
More informationChapter 9 Public Key Cryptography and RSA
Chapter 9 Public Key Cryptography and RSA Cryptography and Network Security: Principles and Practices (3rd Ed.) 2004/1/15 1 9.1 Principles of Public Key PrivateKey Cryptography traditional private/secret/single
More informationCryptography: Authentication, Blind Signatures, and Digital Cash
Cryptography: Authentication, Blind Signatures, and Digital Cash Rebecca Bellovin 1 Introduction One of the most exciting ideas in cryptography in the past few decades, with the widest array of applications,
More informationAdvanced Cryptography
Family Name:... First Name:... Section:... Advanced Cryptography Final Exam July 18 th, 2006 Start at 9:15, End at 12:00 This document consists of 12 pages. Instructions Electronic devices are not allowed.
More information159.334 Computer Networks. Network Security 1. Professor Richard Harris School of Engineering and Advanced Technology
Network Security 1 Professor Richard Harris School of Engineering and Advanced Technology Presentation Outline Overview of Identification and Authentication The importance of identification and Authentication
More informationLecture 6  Cryptography
Lecture 6  Cryptography CSE497b  Spring 2007 Introduction Computer and Network Security Professor Jaeger www.cse.psu.edu/~tjaeger/cse497bs07 Question 2 Setup: Assume you and I don t know anything about
More informationFinal Exam. IT 4823 Information Security Administration. Rescheduling Final Exams. Kerberos. Idea. Ticket
IT 4823 Information Security Administration Public Key Encryption Revisited April 5 Notice: This session is being recorded. Lecture slides prepared by Dr Lawrie Brown for Computer Security: Principles
More informationCryptography and Network Security: Summary
Cryptography and Network Security: Summary Timo Karvi 12.2013 Timo Karvi () Cryptography and Network Security: Summary 12.2013 1 / 17 Summary of the Requirements for the exam The advices are valid for
More informationEXAM questions for the course TTM4135  Information Security June 2010. Part 1
EXAM questions for the course TTM4135  Information Security June 2010 Part 1 This part consists of 6 questions all from one common topic. The number of maximal points for every correctly answered question
More informationLecture 8: Applications of Quantum Fourier transform
Department of Physical Sciences, University of Helsinki http://theory.physics.helsinki.fi/ quantumgas/ p. 1/25 Quantum information and computing Lecture 8: Applications of Quantum Fourier transform JaniPetri
More informationCIS 5371 Cryptography. 8. Encryption 
CIS 5371 Cryptography p y 8. Encryption  Asymmetric Techniques Textbook encryption algorithms In this chapter, security (confidentiality) is considered in the following sense: Allornothing secrecy.
More informationNetwork Security. Abusayeed Saifullah. CS 5600 Computer Networks. These slides are adapted from Kurose and Ross 81
Network Security Abusayeed Saifullah CS 5600 Computer Networks These slides are adapted from Kurose and Ross 81 Public Key Cryptography symmetric key crypto v requires sender, receiver know shared secret
More informationNumber Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may
Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition
More informationA Factoring and Discrete Logarithm based Cryptosystem
Int. J. Contemp. Math. Sciences, Vol. 8, 2013, no. 11, 511517 HIKARI Ltd, www.mhikari.com A Factoring and Discrete Logarithm based Cryptosystem Abdoul Aziz Ciss and Ahmed Youssef Ecole doctorale de Mathematiques
More informationThe RSA Algorithm: A Mathematical History of the Ubiquitous Cryptological Algorithm
The RSA Algorithm: A Mathematical History of the Ubiquitous Cryptological Algorithm Maria D. Kelly December 7, 2009 Abstract The RSA algorithm, developed in 1977 by Rivest, Shamir, and Adlemen, is an algorithm
More informationNetwork Security. Abusayeed Saifullah. CS 5600 Computer Networks. These slides are adapted from Kurose and Ross 81
Network Security Abusayeed Saifullah CS 5600 Computer Networks These slides are adapted from Kurose and Ross 81 Goals v understand principles of network security: cryptography and its many uses beyond
More informationThe application of prime numbers to RSA encryption
The application of prime numbers to RSA encryption Prime number definition: Let us begin with the definition of a prime number p The number p, which is a member of the set of natural numbers N, is considered
More informationNUMBER 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
More informationRSA Cryptosystem. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong. RSA Cryptosystem
Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong In this lecture, we will discuss the RSA cryptosystem, which is widely adopted as a way to encrypt a message, or
More informationMA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins
MA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins The RSA encryption scheme works as follows. In order to establish the necessary public
More informationCryptography. some history. modern secret key cryptography. public key cryptography. cryptography in practice
Cryptography some history Caesar cipher, rot13 substitution ciphers, etc. Enigma (Turing) modern secret key cryptography DES, AES public key cryptography RSA, digital signatures cryptography in practice
More informationSECURITY IN NETWORKS
SECURITY IN NETWORKS GOALS Understand principles of network security: Cryptography and its many uses beyond confidentiality Authentication Message integrity Security in practice: Security in application,
More informationAn Introduction to RSA PublicKey Cryptography
An Introduction to RSA PublicKey Cryptography David Boyhan August 5, 2008 According to the U.S. Census Bureau, in the 1st quarter of 2008, approximately $33 billion worth of retail sales were conducted
More informationCryptography and Network Security
Cryptography and Network Security Fifth Edition by William Stallings Chapter 9 Public Key Cryptography and RSA PrivateKey Cryptography traditional private/secret/single key cryptography uses one key shared
More informationCryptography and Network Security Chapter 9
Cryptography and Network Security Chapter 9 Fifth Edition by William Stallings Lecture slides by Lawrie Brown (with edits by RHB) Chapter 9 Public Key Cryptography and RSA Every Egyptian received two names,
More informationDigital Signatures. Meka N.L.Sneha. Indiana State University. nmeka@sycamores.indstate.edu. October 2015
Digital Signatures Meka N.L.Sneha Indiana State University nmeka@sycamores.indstate.edu October 2015 1 Introduction Digital Signatures are the most trusted way to get documents signed online. A digital
More informationToday ENCRYPTION. Cryptography example. Basic principles of cryptography
Today ENCRYPTION The last class described a number of problems in ensuring your security and privacy when using a computer online. This lecture discusses one of the main technological solutions. The use
More informationA Study on Asymmetric Key Cryptography Algorithms
A Study on Asymmetric Key Cryptography Algorithms ASAITHAMBI.N School of Computer Science and Engineering, Bharathidasan University, Trichy, asaicarrier@gmail.com Abstract Asymmetric key algorithms use
More informationLecture 9: Application of Cryptography
Lecture topics Cryptography basics Using SSL to secure communication links in J2EE programs Programmatic use of cryptography in Java Cryptography basics Encryption Transformation of data into a form that
More informationEnhancing privacy with quantum networks
Enhancing privacy with quantum networks P. Mateus N. Paunković J. Rodrigues A. Souto SQIG Instituto de Telecomunicações and DM  Instituto Superior Técnico  Universidade de Lisboa Abstract Using quantum
More information