QUANTUM CRYPTOGRAPHY.

Slides:



Advertisements
Similar presentations
Quantum Cryptography Post Tenebras Lux!
Advertisements

Quantum Cryptography Nick Papanikolaou Third Year CSE Student
Use of Time as a Quantum Key By Caleb Parks and Dr. Khalil Dajani.
BY : Darshana Chaturvedi.  INTRODUCTION  RSA ALGORITHM  EXAMPLES  RSA IS EFFECTIVE  FERMAT’S LITTLE THEOREM  EUCLID’S ALGORITHM  REFERENCES.
QUANTUM CRYPTOGRAPHY ABHINAV GUPTA CSc Introduction [1,2]  Quantum cryptography is an emerging technology in which two parties can secure network.
Quantum Cryptography Ranveer Raaj Joyseeree & Andreas Fognini Alice Bob Eve.
Quantum Key Distribution (QKD) John A Clark Dept. of Computer Science University of York, UK
Public-key Cryptography Montclair State University CMPT 109 J.W. Benham Spring, 1998.
QUANTUM CRYPTOGRAPHY Narayana D Kashyap Security through Uncertainty CS 265 Spring 2003.
Introduction to Quantum Cryptography Dr. Janusz Kowalik IEEE talk Seattle, February 9,2005.
Quantum Cryptography Marshall Roth March 9, 2007.
Public Key Cryptography
Quantum Cryptography Prafulla Basavaraja CS 265 – Spring 2005.
8: Network Security8-1 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key: K r e.g., key is knowing substitution.
CRYPTOGRAPHY Lecture 10 Quantum Cryptography. Quantum Computers for Cryptanalysis Nobody understands quantum theory. - Richard Feynman, Nobel prize-winning.
CS4600/5600 Biometrics and Cryptography UTC/CSE
Public Key Model 8. Cryptography part 2.
Cryptography Instructor : Dr. Yanqing Zhang Presented by : Rajapaksage Jayampthi S.
Network and Communications Network Security Department of Computer Science Virginia Commonwealth University.
Gagan Deep Singh GTBIT (IT) August 29,2009.
RSA Public Key Algorithm. RSA Algorithm history  Invented in 1977 at MIT  Named for Ron Rivest, Adi Shamir, and Len Adleman  Based on 2 keys, 1 public.
April 12, 2006 Berk Akinci 1 Quantum Cryptography Berk Akinci.
1 Lecture 9 Public Key Cryptography Public Key Algorithms CIS CIS 5357 Network Security.
Public-Key Cryptography CS110 Fall Conventional Encryption.
Quantum Cryptography. Cryptography  Art of writing messages so that no one other than intended receiver can read it.  Encryption – Performing mathematical.
Cryptography Wei Wu. Internet Threat Model Client Network Not trusted!!
Public Key Cryptography. symmetric key crypto requires sender, receiver know shared secret key Q: how to agree on key in first place (particularly if.
Quantum cryptography CS415 Biometrics and Cryptography UTC/CSE.
IIS 2004, CroatiaSeptember 22, 2004 Quantum Cryptography and Security of Information Systems 1 2
PUBLIC-KEY CRYPTOGRAPH IT 352 : Lecture 2- part3 Najwa AlGhamdi, MSc – 2012 /1433.
CS555Topic 251 Cryptography CS 555 Topic 25: Quantum Crpytography.
Quantum Cryptography Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”
Overview of Cryptography & Its Applications
Network Security Lecture 18 Presented by: Dr. Munam Ali Shah.
Nawaf M Albadia
Encryption Basics Module 7 Section 2. History of Encryption Secret - NSA National Security Agency –has powerful computers - break codes –monitors all.
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
Presented By, Mohammad Anees SSE, Mukka. Contents Cryptography Photon Polarization Quantum Key Distribution BB84 Protocol Security of Quantum Cryptography.
INCS 741: Cryptography Overview and Basic Concepts.
Cryptography services Lecturer: Dr. Peter Soreanu Students: Raed Awad Ahmad Abdalhalim
-SECRECY ENSURED TECHNOLOGYKEY DISTRIBUTUION CLASSICAL CRYPTOGRAPHY QUANTAM CRYPTOGRAPHY WORKING INTRODUCTION SECURITY CONCLUSION ADVANTAGESLIMITATIONS.
15-853Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” Including Quantum Communication Quantum Computing.
Public Key Cryptography
최신정보보호기술 경일대학교 사이버보안학과 김 현성.
CS480 Cryptography and Information Security
Encryption and Integrity
J. Miranda University of Ottawa 21 November 2003
Computer Communication & Networks
COMPSCI 290.2: Computer Security
Quantum Information Promises new insights Anthony J
Public-key Cryptography
Public Key Encryption and the RSA Algorithm
Quantum Cryptography Quantum Computing
Cryptography.
Cryptography, part 2.
Quantum Cryptography Arjun Vinod S3 EC Roll No:17.
Group 7 Justin Jones Ashley Robinett Jonathan Bull
Quantum Key Distribution
Quantum Cryptography Alok.T.J EC 11.
PART VII Security.
Brandin L Claar CSE 597E 5 December 2001
Lecture 14: Blocking and Catching Photons Background
Quantum Cryptography Scott Roberts CSE /01/2001.
Cryptography and Quantum Computing
Quantum Technology programme
Discrete Math for CS CMPSC 360 LECTURE 14 Last time:
Public-Key, Digital Signatures, Management, Security
Chapter 3 - Public-Key Cryptography & Authentication
Quantum Cryptography Quantum Computing
Secure Diffie-Hellman Algorithm
Presentation transcript:

QUANTUM CRYPTOGRAPHY

Cryptography. Transmitting information with access restricted to the intended recipient even if the message is intercepted by others. Cryptography is of increasing importance in our technological age using broadcast, network communications, Internet ,e-mail, cell phones which may transmit sensitive information related to finances, politics, business and private confidential matters.

The process Key Plaintext Encryption Crypto text Plaintext Decryption Secure transmission Key ready for use Plaintext Decryption Message encryption Secure key distribution

The classic cryptography Encryption algorithm and related key are kept secret. Breaking the system is hard due to large numbers of possible keys. For example: for a key 128 bits long there are The fundamental difficulty is key distribution to parties who want to exchange messages.

PKC :the modern cryptography In 1970s the Public Key Cryptography emerged. Each user has two mutually inverse keys, The encryption key is published; The decryption key is kept secret. Anybody can send a message to Bob but only Bob can read it.

RSA Algorithm The most widely used PKC is the RSA algorithm based on the difficulty of factoring a product ot two large primes Choose two large prime numbers p and q. Compute N=p*q. Choose e(<<<N) such that e and (p-1)(q-1) is relatively prime Choose d such that (e*d) mod [(p-1)(q-1)] is equal to 1;

EXAMPLE Let the Private key is (119,77)and Public key is (119,5). If we want to send B then the ciphertext c = 25 mod 119 = 32 Then the Plaintext p = 3277 mod 119 = 2

Factoring a product of two large primes The best known conventional algorithm requires the solution time proportional to: For p & q 65 digits long T(n) is approximately one month using cluster of workstations. For p&q 200 digits long T(n) is astronomical.

Quantum Computing algorithm for factoring. In 1994 Peter Shor from the AT&T Bell Laboratory showed that in principle a quantum computer could factor a very long product of primes in seconds. Shor’s algorithm time computational complexity is Once a quantum computer is built the RSA method would not be safe.

Elements of the Quantum Theory Light waves are propagated as discrete quanta called photons. They are mass less and have energy, momentum and angular momentum called spin. If on its way we put a polarization filter a photon may pass through it or may not.

Photon Polarization Tilted filter at the angle Vertical filter The probability of a photon appearing after the second filter depends on the angle and becomes 0 at = 90 degrees. The first filter randomizes the measurements of the second filter.

Heisenberg Uncertainty Principle Certain pairs of physical properties are related in such a way that measuring one property prevents the observer from knowing the value of the other. When measuring the polarization of a photon, the choice of what direction to measure affects all subsequent measurements. If a photon passes through a vertical filter it will have the vertical orientation regardless of its initial direction of polarization

EXAMPLE

Quantum key distribution Both Alice and Bob have two polarizers each. One with the 0-90 degree basis (+) and one with 45-135 degree basis ( ) (a) Alice uses her polarizers to send randomly photons to Bob in one of the four possible polarizations 0,45,90,135 degree. (b) Bob uses his polarizers to measure each polarization of photons he receives. He can use the( + )basis or the ( ) but not both simultaneously.

EXAMPLE CONTD. Where λ is probability of error. Stage 1: Communication over a quantum channel. Stage 2:Communication in two phases in public channel Phase 1:Extraction of raw key Phase 2:Detection of Eve’s intrusion through error calculation Where λ is probability of error. m is the no of places where comparison takes place If λ is 1 and m is 200 then

Eavesdropper Eve If Eve uses the filter aligned with Alice’s she can recover the original polarization of the photon. If she uses the misaligned filter she will receive no information about the photon Also she will influence the original photon and be unable to retransmit it with the original polarization. Bob will be able to deduce Eve’s presence.

KEY DISTRIBUTION IN PRESENCE OF EAVESDROPPER

QUANTUM KEY DISTRIBUTION IN NOISY CHANNEL Stage 1: Communication over a quantum channel. Stage 2: Detection of Eve’s intrusion or noise by calculating error. Phase 1: Same as above method. Phase 2: Estimation of error. Phase 3: Extraction of reconciled key. Phase 4: Privacy amplification i.e. Extraction of final secret key. The secret key may contain n-k-s. n : the number of keys present in the reconciled key k : the number of place where there is error s : the security parameter sender and receiver have decided to maintain.

Binary information A user can suggest a key by sending a stream of randomly polarized photons. This sequence can be converted to a binary key. If the key was intercepted it could be discarded and a new stream of randomly polarized photons sent.

Security of quantum key distribution Quantum cryptography obtains its fundamental security from the fact that each qubit is carried by a single photon, and each photon will be altered as soon as it is read. This makes impossible to intercept message without being detected.

State of the QC technology. Experimental implementations have existed since 1990. Current QC is performed over distances of 30-40 kilometers using optical fiber In general we need two capabilities. Single photon gun. (2) Being able to measure single photons. Efforts are being made to use Pulsed Laser Beam with low intensity for firing single photons. Detecting and measuring photons is hard. The most common method is exploiting Avalanche Photodiodes where single photon triggers a detectable electron avalanche.

State of the QC technology. Key transmissions can be achieved for about 80 km distance. For longer distances we can use repeaters. But practical repeaters are a long way in the future. Another option is using satellites .But the satellites distance from earth is in hundreds of kilometers.

Commercial QC providers id Quantique, Geneva Switzerland Optical fiber based system Tens of kilometers distances MagiQ Technologies, NY City Optical fiber-glass Up to 100 kilometers distances NEC Tokyo 150 kilometers QinetiQ Farnborough, England Through the air 10 kilometers. Supplied system to BBN in Cambridge Mass.

CONCLUSION For the first time in history, the security of cryptography does not depend any more on the computing resources of the adversary, nor does it depend on mathematical progress. Quantum cryptography allows exchanging encryption keys, whose secrecy is future-proof and guaranteed by the laws of quantum physics. Its combination with conventional secret-key cryptographic algorithms allows raising the confidentiality of data transmissions to an unprecedented level .Recognizing this fact, the MIT Technology Review and Newsweek magazine identified quantum cryptography as one of the “ten technologies that will change the world.

References google.com yahoo.com wikipedia.com webopedia.com idquantique.com csee.umbc.edu

THANX A LOT... FREE TO ASK....