Random Number Generation Using Quantum Physics. Introduction to randomness and random numbers PRNG-s TRNG-s Comparison between PRNG-s and TRNG-s.

Slides:



Advertisements
Similar presentations
Random Number Generation Graham Netherton Logan Stelly.
Advertisements

IP Traceback in Cloud Computing Through Deterministic Flow Marking Mouiad Abid Hani Presentation figures are from references given on slide 21. By Presented.
Network Security. Confidentiality Using Symmetric Encryption John wrote the letters of the alphabet under the letters in its first lines and tried it.
CS457 – Introduction to Information Systems Security Cryptography 1b Elias Athanasopoulos
QUANTUM CRYPTOGRAPHY ABHINAV GUPTA CSc Introduction [1,2]  Quantum cryptography is an emerging technology in which two parties can secure network.
Basic Input Output System
Random number generation Algorithms and Transforms to Univariate Distributions.
MotoHawk Training Model-Based Design of Embedded Systems.
1 “Introduction to Modern Power Electronics”, 2 nd Ed., John Wiley 2010 by Andrzej M. Trzynadlowski.
Stream cipher diagram + + Recall: One-time pad in Chap. 2.
Dr Alejandra Flores-Mosri Message Authentication Internet Management & Security 06 Learning outcomes At the end of this session, you should be able to:
Overview of Cryptography Oct. 29, 2002 Su San Im CS Dept. EWU.
Rita Pizzi Department of Information Technology Università degli Studi di Milano.
McGraw-Hill©The McGraw-Hill Companies, Inc., Security PART VII.
Quantum Cryptography Prafulla Basavaraja CS 265 – Spring 2005.
Chapter 3 Supplementary Components and Systems
Laser Shoot-Out Game By Steven Noto and Laura Miller Advisor Steven Gutschlag February 15, 2000 Senior Project Status.
The Basics  A population is the entire group on which we would like to have information.  A sample is a smaller group, selected somehow from.
Cryptography and Network Security Chapter 7
Even More Random Number Generators Using Genetic Programming Joe Barker.
15-853Page :Algorithms in the Real World Generating Random and Pseudorandom Numbers.
April 13, 2004 CS 551: CRyptography Applications Bistro Electronic National Lotteries Jessica Greer.
Project supported by YESS 2009 Young Engineering Scientist Symposium « Identity Management » Cryptography for the Security of Embedded Systems Ambient.
2 A. Prof. Hala Abdel-monem Elsadek Microstrip Department Head, Electronics Research Institute Institute /Company: Electronics Research Institute l December.
TECHNOLOGY GUIDE 2: Software 1. 2 TG2.1 Introduction to Software TG2.2 Software Issues TG2.3 Systems Software TG2.4 Application Software TECHNOLOGY GUIDE.
Cryptography Lecture 1: Introduction Piotr Faliszewski.
CSI-4138/CEG-4394 Design of Secure Computer Systems Virtual Election Booth Lab Project Jean-Yves Chouinard Fall 2002.
KAIS T A lightweight secure protocol for wireless sensor networks 윤주범 ELSEVIER Mar
Event Stream Processing for Intrusion Detection in ZigBee Home Area Networks Sandra Pogarcic, Samujjwal Bhandari, Kedar Hippalgaonkar, and Susan Urban.
Cryptography and Network Security (CS435)
1 “Introduction to Modern Power Electronics”, 2 nd Ed., John Wiley 2010 by Andrzej M. Trzynadlowski.
1/ , Graz, Austria Power Spectral Density of Convolutional Coded Pulse Interval Modulation Z. Ghassemlooy, S. K. Hashemi and M. Amiri Optical Communications.
Smart card security Nora Dabbous Security Technologies Department.
Random Number Generators 1. Random number generation is a method of producing a sequence of numbers that lack any discernible pattern. Random Number Generators.
1 Everyday Statistics in Monte Carlo Shielding Calculations  One Key Statistics: ERROR, and why it can’t tell the whole story  Biased Sampling vs. Random.
Chapter 7 – Confidentiality Using Symmetric Encryption.
Chapter 7 Confidentiality Using Symmetric Encryption.
The Principle of Electronic Data Serial and Parallel Data Communication Transmission Rate Bandwidth Bit Rate Parity bits.
Quantum Computing by Mathew Ross Jared Davis - Group L -
Stores the OS/data currently in use and software currently in use Memory Unit 21.
Network Security Lecture 18 Presented by: Dr. Munam Ali Shah.
Potential and specific features of the method of transmission and integrated protection of information Stocos, Ltd.1.
WP5 – Wirespeed Photonic Firewall Validation Start M27, finish M35 Avanex lead Description of Work –Establish test bed suitable to validated the optical.
Validation of Pseudo Random Numbers through Graphical Analysis Andrew Cronwright Supervisor: Barry Irwin.
Pseudo Randomness (in digital system) PRESENTED BY GROUP 8 SHU-YU HUANG, FONG-JHENG LIN
1 Calorimeters LED control LHCb CALO meeting Anatoli Konoplyannikov /ITEP/ Status of the calorimeters LV power supply and ECS control Status of.
RFID Paper presentation The Security of EPC Gen2 Compliant RFID Protocols Source : Applied Cryptography and Network Security, VOL. 5037, 2008, pp
020116EIS_JTM.1 EIS Sensitivity Update John Mariska NRL 3-5 Feb 2003.
Timer 1 and 2 operation, PWM Principles. Timer 1 Operation.
IT 221: Introduction to Information Security Principles Lecture 5: Message Authentications, Hash Functions and Hash/Mac Algorithms For Educational Purposes.
Chapter 7 – Confidentiality Using Symmetric Encryption.
WP5 – Wirespeed Photonic Firewall Validation Start M27, finish M41(tbc) CIP now lead Description of Work –Establish test bed suitable to validated the.
I. UML Tool review (Rhapsody) and II. Requirement and TEST in UML modeling May 31th 2005 KIM, YUN GOO Lab Seminar.
Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.
PC-based L0TP Status Report “on behalf of the Ferrara L0TP Group” Ilaria Neri University of Ferrara and INFN - Italy Ferrara, September 02, 2014.
Computer Graphics Lecture 1. Books D. Hearn, M. P. Baker, "Computer Graphics with OpenGL", 3rd Ed., Prentice Hall, 2003, ISBN
VIDYA PRATISHTHAN’S COLLEGE OF ENGINEERING, BARAMATI.
Chapter I: Introduction to Computer Science. Computer: is a machine that accepts input data, processes the data and creates output data. This is a specific-purpose.
Hatice Kübra Eryılmaz CMPE220/Fall
STEGANOGRAPHY.
Quantum Cryptography Arjun Vinod S3 EC Roll No:17.
PART VII Security.
Timers.
Design Of Low-Power Wireless Communication System Based On MSP430
One Time Signature.
Hashing Hash are the auxiliary values that are used in cryptography.
Generating Random and Pseudorandom Numbers
Generating Random and Pseudorandom Numbers
Pseudorandom Numbers Network Security.
Hash Function Requirements
Presentation transcript:

Random Number Generation Using Quantum Physics

Introduction to randomness and random numbers PRNG-s TRNG-s Comparison between PRNG-s and TRNG-s

Application of random numbers Authentication Confidentiality Scientific calculations -What is a random number -Testing randomness -What is a random number -Testing randomness

Generating random numbers Software solutions Physical sources of randomness - Biased and unbiased sequences - Determinism hidden behind complexity - Randomness revealed by simplicity

The Quantis QRNG Figure 1: Optical system used to generate random numbers

Principles High bit rate 4-16 Mb/s of truly random bits Transmission upon semi-transparent mirror Absolutely random transmission or reflection

Figure 2: Block diagram of the Quantis RNG

Three subsystems 1.The core of generator-comprises the diode and two single photon detectors 2.Synchronisation electronic circuit-comprises a clock, triggering electronics and acquisition electronics for a single photon detectors 3.The processing and interfacing subsystem –performs statistical and hardware checks, as well as unbiasing of the sequence, shaping the output electronic signals

Unbiasing of the random numbers Status monitoring Packaging Conclusion

Parking lot test Randomly place unit circles in a 100*100 square If the circle overlaps an existing one, try again After tries, the number of successfully ’’parked’’ circles should follow a certain normal distribution Pi values for files between and TRNG satisfies test

References [1] Schneier, B., Applied Cryptography: Protocols, Algorithms, and Source Code in C, John Wiley & Sons, New York, (1996). [2] Knuth, D., The Art of Computer Programming, Vol. 2, 2nd ed., Addison-Wesley, Reading, (1981). [3] Maurer, U., "A universal statistical test for random bits generators", Journal of Cryptology, 5, (1992). [4] Markoff, J., "Security flaw is discovered in software used in shopping", The New York Times (19 September 1995)