Class-5-26-10

Class-5-26-10 - MODERN CRYPTOGRAPHY next BASIC FACTS FOR...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
MODERN CRYPTOGRAPHY next
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
BASIC FACTS FOR RSA EULER FERMAT next
Background image of page 2
next
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
THE CONSTRUCTION OF BIG PRIME NUMBERS next
Background image of page 4
Quadratic Residues next Tables of squares has no solutions has no solutions Mod 5 1 2 3 4 1 4 4 1 x 2 x 0 1 2 3 4 4 6 5 1 2 2 1 4 Mod 7 x 2 x 0 1 2 3 4 6 5 7 11 9 8 0 1 4 9 5 3 3 5 1 4 9 Mod 11 x 2 x QR [5] = { 1 , 4 }
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
How many Quadratic Residues ? next A useful result
Background image of page 6
THE LEGENDRE AND JACOBI SYMBOLS Definition we set The previous theorem gives (false) Not easy to compute from this definition when n is large and its prime factors are not known However see next page next
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Don’t forget that for a =0 J(a,n) =0 THE LAW OF QUADRATIC RECIPROCITY has a solution has a solution For instance when (p-1)(q-1)/4 is even A fast way of computing the Jacobi symbol !!! next
Background image of page 8
The Strassen Solovay Primality Test 1) Pick at random in the interval {1,2,3,. ..,n-1} i 2) For each a = a check the two equalities 3) if any of these tests fails then n is not a prime The bigger is k the higher the probability of reaching a correct conclusion i
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/22/2010 for the course MATH MATH187 taught by Professor Math187 during the Spring '10 term at UCSD.

Page1 / 19

Class-5-26-10 - MODERN CRYPTOGRAPHY next BASIC FACTS FOR...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online