5-RSA - PublicKeyCryptographyandRSA...

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

View Full Document Right Arrow Icon
Public Key Cryptography and RSA CSE 651: Introduction to Network Security
Background image of page 1

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

View Full DocumentRight Arrow Icon
Abstract We will discuss The concept of public-key cryptography RSA algorithm Attacks on RSA Suggested reading: Sections 4.2, 4.3, 8.1, 8.2, 8.4 Chapter 9 2
Background image of page 2
Public-Key Cryptography Also known as asymmetric-key cryptography. Each user has a pair of keys: a public key and a private key. The public key is used for encryption. The key is known to the public. The private key is used for decryption. The key is only known to the owner. 3
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 Bob Alice
Background image of page 4
Why Public-Key Cryptography? Developed to address two main issues: key distribution digital signatures Invented by Whitfield Diffie & Martin Hellman 1976. 5
Background image of page 5

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

View Full DocumentRight Arrow Icon
6 1 1 trapdoor Easy: Hard: Use as the private key. Many public-key cryptosystems are based on trapdoor one-way fu trapdoor One-way function with trapdoor f f f xy ⎯⎯→ ←⎯⎯ ←⎯⎯⎯ nctions.
Background image of page 6
Modular Arithmetic Mathematics used in RSA (Sections 4.2, 4.3, 8.1, 8.2, 8.4)
Background image of page 7

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

View Full DocumentRight Arrow Icon
| : divides , is a divisor of . gcd( , ): greatest common divisor of and . Coprime or relatively prime: gcd( , ) 1. Euclid's algorithm: computes gcd( , ). Extented Eucl Integers ab a ba b a b •= id's algorithm: computes integers and such that gcd( , ). x y ax by a b +=
Background image of page 8
0 1 1 11 Comment: compute gcd( , ), where 1. : : for : 1, 2, until = 0 : mod return ( ) Euclidean Algorithm n ii i n ab a b ra rb ir rr r r + +− >> = = = =
Background image of page 9

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

View Full DocumentRight Arrow Icon
17 8 26 5 11 3 6 299 221 221 78 78 65 55 1 30 gcd(229,221) 13 (2 ) 3 3( 299 221) 221 299 2 78 65 78 221 78 78 22 21 1 4 1 3 Extended Euclidean Algorithm:Example gcd(299,221) ? =⋅ + + + + == =− = −⋅ =
Background image of page 10
id A group, denoted by ( , ), is a set with a binary operation : such that 1. ( ) ( ) (associative) 2. s.t. , ( ) 3. s.t. entity Group GG G ab c a bc eG xG x x x yG x y y x ee ×→ = ∃∈ = = ∀∈ = = D D DD () A group ( , ) is if , . Examples: ( , abel ), ( , ), ( \{0}, ), ( , inver ), ( \{0} ian s , ). e e Gx y Gxyy x ZQQ R R •∀ = •+ + × + × D
Background image of page 11

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

View Full DocumentRight Arrow Icon
Let 2 be an integer. Def: is congruent to modulo , written mod , if | ( ), i.e., and have the same remainder when d m ivided by . Note: d od an Integers modulo n ab n n n a b a b n n n •≡ ≡− {} are different. Def: [ ] all integers congruent to modulo . [ ] is called a residue calss modulo , and is a representati mod ve of that class. n n aa n an a n = =
Background image of page 12
[ ] [ ] if and only if mod . There are exactly residue classes modulo : [0], [1], [2], , [ 1]. If [ ], [ ], then [ ] and [ ]. Define addition and multiplication nn ab a bn n x a yb x ya b x b =≡ ∈∈ + + for residue classes: [ ] [ ] [ ] [ ] [ ] [ ]. a b a b += + ⋅=
Background image of page 13

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

View Full DocumentRight Arrow Icon
{ } {} () Define [0], [1], . .., [ 1] . Or, more conveniently, 0, 1, . .., 1 . , forms an abelian additive group. For , , ( )mod . (Or, [ ] [ ] [ ] [ mod ].) 0 is th n n n n Zn Z ab Z ab n a b n =− + + =+ + = += + i i 10 e identity element. The inverse of , denoted by , is . When doing addition/substraction in , just do the regular addition/substraction and reduce the result modulo . In , 5 n aa n a Z n Z −− i i 5946283 ?
Background image of page 14
Image of page 15
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/22/2011 for the course CSE 651 taught by Professor Tenh.lai during the Spring '10 term at Ohio State.

Page1 / 66

5-RSA - PublicKeyCryptographyandRSA...

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

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