PRIME NUMBERS PRESENTED BY : NANDAN GOEL.

Slides:



Advertisements
Similar presentations
Presented by Alex Atkins.  An integer p >= 2 is a prime if its only positive integer divisors are 1 and p.  Euclid proved that there are infinitely.
Advertisements

Cryptography and Network Security Chapter 8 Fourth Edition by William Stallings.
Opening quote. A number of concepts from number theory are essential in the design of public-key cryptographic algorithms, which this chapter will introduce.
WS Algorithmentheorie 03 – Randomized Algorithms (Primality Testing) Prof. Dr. Th. Ottmann.
Chapter 5 Number Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Cryptography and Network Security
Chapter 8 – Introduction to Number Theory. Prime Numbers prime numbers only have divisors of 1 and self –they cannot be written as a product of other.
Computability and Complexity
Chapter 8 Introduction To Number Theory. Prime Numbers Prime numbers only have divisors of 1 and Prime numbers only have divisors of 1 and self. self.
Agrawal-Kayal-Saxena Presented by: Xiaosi Zhou
Chapter 8 More Number Theory. Prime Numbers Prime numbers only have divisors of 1 and itself They cannot be written as a product of other numbers Prime.
Introduction to Modern Cryptography Lecture 6 1. Testing Primitive elements in Z p 2. Primality Testing. 3. Integer Multiplication & Factoring as a One.
Primality Testing By Ho, Ching Hei Cheung, Wai Kwok.
COM 5336 Cryptography Lecture 7a Primality Testing
Elementary Number Theory and Methods of Proof. Basic Definitions An integer n is an even number if there exists an integer k such that n = 2k. An integer.
Announcements: 1. Congrats on reaching the halfway point once again! 2. Reminder: HW5 due tomorrow, HW6 due Tuesday after break 3. Term project groups.
Chapter 8 – Introduction to Number Theory Prime Numbers  prime numbers only have divisors of 1 and self they cannot be written as a product of other numbers.
CSE 321 Discrete Structures Winter 2008 Lecture 8 Number Theory: Modular Arithmetic.
Chapter 8 – Introduction to Number Theory Prime Numbers
Chapter 8 – Introduction to Number Theory Prime Numbers  prime numbers only have divisors of 1 and self they cannot be written as a product of other numbers.
SECTION 5-2 Large Prime Numbers Slide THE INFINITUDE OF PRIMES Slide There is no largest prime number. Euclid proved this around 300 B.C.
CSE 321 Discrete Structures Winter 2008 Lecture 10 Number Theory: Primality.
Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations Copyright © The McGraw-Hill Companies, Inc. Permission required.
Section 5.1 Number Theory.

Information Security and Management 4. Finite Fields 8
CPSC 490 Number Theory Primes, Factoring and Euler Phi-function Mar.31 st, 2006 Sam Chan.
MA/CSSE 473 Day 08 Randomized Primality Testing Carmichael Numbers Miller-Rabin test.
The Complexity of Primality Testing. What is Primality Testing? Testing whether an integer is prime or not. – An integer p is prime if the only integers.
Number Theory and Advanced Cryptography 2
YSLInformation Security -- Public-Key Cryptography1 Prime and Relatively Prime Numbers Divisors: We say that b  0 divides a if a = mb for some m, where.
Fall 2002CS 395: Computer Security1 Chapters 4 and 8: The Mathematics Required for Public Key Cryptography In case you’re beginning to worry that this.
Pseudorandom numbers John von Neumann: Any one who considers
9/22/15UB Fall 2015 CSE565: S. Upadhyaya Lec 7.1 CSE565: Computer Security Lecture 7 Number Theory Concepts Shambhu Upadhyaya Computer Science & Eng. University.
6.3 Primality Testing. p2. (1) Prime numbers 1. How to generate large prime numbers? (1) Generate as candidate a random odd number n of appropriate size.
Primality Testing. Introduction The primality test provides the probability of whether or not a large number is prime. Several theorems including Fermat’s.
9.1 Primes and Related Congruence Equations 23 Sep 2013.
MA/CSSE 473 Day 10 Primality Testing. MA/CSSE 473 Day 10 In-class exam: Friday, Sept 28 –You may bring a two-sided 8.5x11 inch piece of paper containing.
MA/CSSE 473 Day 09 Modular Division Revisited Fermat's Little Theorem Primality Testing.
Chapter 4 With Question/Answer Animations 1. Chapter Summary Divisibility and Modular Arithmetic - Sec 4.1 – Lecture 16 Integer Representations and Algorithms.
1 Solve it with the Computer Rick Spillman CSCE 115 Spring 2013 Lecture 12.
PRIMES is in P Manindra Agrawal Neeraj Kayal Nitin Saxena Dept of CSE, IIT Kanpur.
A Prime Example CS Lecture 20 A positive integer p  2 is prime if the only positive integers that divide p are 1 and p itself. Positive integers.
RSA Encryption Greg Gronn Laura Trimmer. RSA Encryption  Requires two 30 digit prime numbers to create an encoding/decryption key.  Goal: analyze different.
Number-Theoretic Algorithms
MA/CSSE 473 Day 08 Randomized Primality Testing Carmichael Numbers
Section 5.1 Number Theory.
Public Key Encryption Major topics The RSA scheme was devised in 1978
CSE565: Computer Security Lecture 7 Number Theory Concepts
Probabilistic Algorithms
Handbook of Applied Cryptography - CH4, from 4.1~4.3
Randomness and Computation: Some Prime Examples
Textbook: Introduction to Cryptography 2nd ed. By J.A. Buchmann
Number-Theoretic Algorithms (UNIT-4)
Cryptography and Network Security
MA/CSSE 473 Day 08 Randomized Primality Testing Carmichael Numbers
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
Introduction to Number Theory
Number Theory (Chapter 7)
Cryptography and Network Security
RSA Cryptosystem Bits PCs Memory MB ,000 4GB 1,020
Section 5.1 Number Theory.
Prime and Relatively Prime Numbers
Cryptography and Network Security
Introduction to Cryptography
Section 5.1 Number Theory.
CSE 321 Discrete Structures
Copyright © 2013, 2010, and 2007, Pearson Education, Inc.
Practical Aspects of Modern Cryptography
Patrick Lee 12 July 2003 (updated on 13 July 2003)
Presentation transcript:

PRIME NUMBERS PRESENTED BY : NANDAN GOEL

HISTORY THE STUDY OF SURVIVING RECORDS OF EGYPTIANS SHOW THAT THEY HAD KNOWLEDGE OF PRIMES. THE GREEK MATHEMATICIAN “EUCLID PERFORMED” SOME EXCEPTIONAL WORK . HIS WORK “EUCLID ELEMENT” CONTAIN IMPORTANT THEOREMS SUCH AS INFINITUDE OF PRIMES AND BASIC THEOREM OF ARITHMETIC. THE FRENCH MONK “MARIN MERSENNE” LOOKED AT PRIMES OF THE FORM 2P − 1, WITH P A PRIME. THEY ARE CALLED MERSENNE PRIMES IN HIS HONOR.

PRIME NUMBER THEOREM LET Π(X) BE THE PRIME – COUNTING FUNCTION THAT GIVES THE NUMBER OF PRIMES LESS THAN OR EQUAL TO X, FOR ANY REAL NUMBER X. FOR EXAMPLE, Π(10) = 4 BECAUSE THERE ARE FOUR PRIME NUMBERS (2, 3, 5 AND 7) LESS THAN OR EQUAL TO 10. THE PRIME NUMBER THEOREM THEN STATES THAT X / LOG X IS A GOOD APPROXIMATION TO Π(X), IN THE SENSE THAT THE LIMIT OF THE QUOTIENT OF THE TWO FUNCTIONS Π(X) AND X / LOG X AS X INCREASES WITHOUT BOUND IS 1.

TESTING PRIMALITY THE MOST BASIC METHOD OF CHECKING THE PRIMALITY OF A GIVEN INTEGER N IS CALLED TRIAL DIVISION. THIS ROUTINE CONSISTS OF DIVIDING N BY EACH INTEGER M THAT IS GREATER THAN 1 AND LESS THAN OR EQUAL TO THE SQUARE ROOT OF N. IF THE RESULT OF ANY OF THESE DIVISIONS IS AN INTEGER, THEN N IS NOT A PRIME, OTHERWISE IT IS A PRIME. INDEED, IF N = ab IS COMPOSITE (WITH a AND b ≠ 1) THEN ONE OF THE FACTORS a OR b IS NECESSARILY AT MOST √N.

SIEVE OF ERATOSTHENES

MODERN PRIMALITY TESTS AKS primality test 2002 deterministic O(log6+ε(n)) Baillie PSW primality test 1980 probabilistic O(log3 n) no known counterexamples Elliptic curve primality proving 1977 O(log5+ε(n)) heuristically Fermat primality test O(k · log2+ε (n)) fails for Carmichael numbers Miller Rabin primality test error probability 4−k Solovay Strassen primality test O(k · log3 n) error probability 2−k

FERMAT PRIMALITY TEST FERMAT‘S THEOREM STATES THAT NP≡N (MOD P) FOR ANY N IF P IS A PRIME. IF WE HAVE A NUMBER B THAT WE WANT TO TEST FOR PRIMALITY. THEN WE WORK OUT NB (MOD B) FOR A RANDOM VALUE OF N AS OUR TEST. A FLAW WITH THIS TEST IS THAT THERE ARE SOME COMPOSITE NUMBERS THAT SATISFY THE FERMAT IDENTITY EVEN THOUGH THEY ARE NOT PRIME. SINCE THESE COMPOSITE NUMBERS ARE VERY RARE AS COMPARED TO PRIMES SO THIS TEST CAN BE USEFUL FOR PRACTICAL PURPOSES.

PRIMES IN NATURE CICADAS: GENUS MAGICICADA

PRIMES IN ART COMMUNICATION WITH ALIENS OLIVIER MESSIAEN

PRIMES:APPLICATION PUBLIC KEY CRYPTOGRAPHY HASH TABLES LARGE NUMBER GENERATORS

THANK YOU. ANY QUERIES?