CS682 Advanced Security Topics
|
|
- Audrey Stafford
- 6 years ago
- Views:
Transcription
1 CS682 Advanced Security Topics Lecture 2 Applied Cryptography Elias Athanasopoulos eliasathan@cs.ucy.ac.cy
2 2
3 The Need for Cryptography People had always secrets Ordinary applications are based on secrecy e.g., elections (or e-voting) Machines need to verify information detect errors Unforgeable information ordinary signatures vs digital signatures Many new applications From car keys to smartcards, and cellphones 3
4 Crypto Roadmap Basic Concepts Symmetric Ciphers Asymmetric Ciphers Cryptographic Hash Functions Digital Signatures Random Numbers 4
5 Basic Concepts Secret Public Public Plain Text Crypto System Cipher Text Secret 5
6 Security via Obscurity All crypto algorithms are assumed to be known Security is based on Secrecy of the key Hard to infer the plaintext via the ciphertext Cryptanalysis Infer the plaintext from ciphertext without knowing the key 6
7 Simple Example a simple message X à X + key (i.e., a becomes d ) dcwlpsohcp hwwdjh Invented by Julius Caesar! C = P + K mod 26 (assuming an alphabet of 26 letters!) 3 7
8 Monoalphabetic ciphers Assume an alphabet abcdefghijklmnopqrstuvwxyz_ Index the letters a is 1, b is 2, c is 3,, z is 26, _ is 27 Select a key (secret), which shifts the order Assuming the key is 3, then a is shifted three letters and becomes d, and z becomes b (wraps around the alphabet) 8
9 Multiple and Running Keys Vigenere Cipher Polyalphabetic Substitution Ciphers Key = r, u, n (three Caesar s keys) tobeornottobethatisthequestion runrunrunrunrunrunrunrunrunrun KIOVIEEIGKIOVNURNVJNUVKHVMGZIA 9
10 Secure Enough? Vigenere Cipher Polyalphabetic Substitution Ciphers Key = r, u, n (three Caesar s keys) tobeornottobethatisthequestion runrunrunrunrunrunrunrunrunrun KIOVIEEIGKIOVNURNVJNUVKHVMGZIA 10
11 Frequency Analysis At the cipher text: 11
12 Frequency Analysis English text: 12
13 Example 13
14 Repeat 14
15 One-Time Pad Pushing Vigenereto the extreme! Size of key is size of plain text Avoid repeated patterns Plain: helpsnowden Key: jitwojsktuw Cipher: qmelgwggwyj 15
16 One-Time Pad Key Integrity Plain: helpsnowden Key: jitwojsktuw Cipher: qmelgwggwyj Message Integrity Cipher: qmelgwggwyj Key: kejhopsktuw Plain: givesnowden Key: jitwojsktuw Cipher: pqoagwggwyj Plain: givesnowden 16
17 One-Time Pad Pushing Vigenereto the extreme! Size of key is size of plain text Avoid repeated patterns Plain: heilhitler Key: wclnbtdefj Cipher:DGTYIBWPJA 17
18 One-Time Pad Key Integrity Plain: heilhitler Key: wclnbtdefj Cipher:DGTYIBWPJA Message Integrity Cipher:DGTYIBWPJA Key: wggsbtdefj Plain: hanghitler Cipher:DCYTIBWPJA Key: wclnbtdefj Plain: hanghitler 18
19 One-time Pad Pros Perfect Secrecy Cons Impractical long key Key integrity, given a cipher you can select another key that produces a different valid plain text Message Integrity, given a key you can select a cipher text that produces the desired plain text 19
20 Block Ciphers So far, we: Treat the message as one-dimension stream Use only substitution We just shift letters (i.e., C = P + K mod 26) Block Ciphers Split message to equally sized blocks Encrypt each block 20
21 Playfair (rule 1) If two letters are in the same row (or column) they are replaced by the succeeding letters: am becomes LE P A L M E R S T O N B C D F G H I K Q U V W X Y Z 21
22 Playfair (rule 2) Otherwise the two letters stand at two of the corners of the rectangle in the table, and we replace them with the letters at the other two corners of this rectangle: lo becomes MT P A L M E R S T O N B C D F G H I K Q U V W X Y Z 22
23 Playfair Algorithm Replace all j with i in plaintext Split plaintext in two-letter blocks Double letters are separated by x z is used (conditionally) for padding Apply Rule 1 and 2 23
24 Example Lord Granville lo rd gr an vi lx le sl et te rz MT TB BN ES WH TL MR TA LN NL NV 24
25 SYMMETRIC CIPHERS 25
26 26
27 Hill Cipher Each letter is interpreted as a number (0-25) Message is written as a matrix CAT becomes: For encryption C = K M M = K -1 C 2 M =
28 Transposition Produces a new permutation of the message Does not change the statistics of the message Easiest way to implement it is by matrix multiplication 28
29 Transposition Initial order: [1, 2, 3, 4, 5] If you want to produce [3, 1, 2, 5, 4] you need to multiply it using
30 Basic Operations Substitution (αντικατάσταση) Changes the statistics of the message by substituting letters with other letters Transposition (μετάθεση) Reorders the letters of the message Both are linear operations (reversible) 30
31 Symmetric Ciphers Relatively fast One key encrypts and decrypts Block-based or Stream-based Several rounds Substitutions and Transpositions Not on letters, but on bits (or bytes) Major weakness Key distribution 31
32 Plain Text Symmetric Cryptographic Encryption Cipher Text Cipher Text Symmetric Cryptographic Decryption Plain Text 32
33 Modern Symmetric Ciphers DES, 3DES, and AES AES is the dominant one, today Based on Substitutions and transpositions Very complex Type Block Stream 33
34 Block vs Stream Block cipher A block of plaintext is treated as a whole and used to produce a block of ciphertext of equal length Typically, a block size of 64 or 128 bits is used Stream cipher Plaintext is treated as a data stream and one bit or one byte is processed at a time 34
35 Block cipher Plaintext of n bits produces a ciphertext of n bits Block size: n bits Space of different plaintext blocks: 2^n Each block must be unique 35
36 Reversibility REVERSIBLE MAPPING IRREVERSIBLE MAPPING Plaintext Ciphertext Plaintext Ciphertext
37 Ideal Substitution Cipher Mapping: key 4 bits x 16 rows = 64 bits! 37
38 Problems Vulnerable to statistical attacks Small blocks can take limited transformations Large blocks (increase n) are impractical Key size: 4 bits x 16 rows In general: n x 2 n Approximate the ideal case Example: 64-bit block requires a key of 64 x 2 64 = bits (!!) 38
39 Practical Ciphers Goal Approximate the ideal cipher Reduce statistical properties between plaintext, ciphertext, and key(s) Combining Substitutions and Transpositions Substitution: Each plaintext element or group of elements is uniquely replaced by a corresponding ciphertext element or group of elements Transposition: A sequence of plaintext elements is replaced by a permutation of that sequence; no elements are added or deleted or replaced in the sequence, rather the order in which the elements appear in the sequence is changed 39
40 40
41 41
42 Information Theory Approach Confusion Obscures the relationship between the plaintext and the ciphertext The easiest way to do this is through substitution Diffusion Reduces repeated plaintext patterns by spreading out the plaintext over the ciphertext The easiest way to do this is through transposition 42
43 Realizing Substitution (S-box) Mapping 6 bits of input to 4 bits (taken from DES) Example: S-box Middle 4 bits of input Outer bits
44 Super Complicated! 44
45 Properties Block size: Larger block sizes mean greater security but reduced encryption/decryption speed for a given algorithm A block size of 64 bits is reasonable tradeoff AES uses a 128-bit block size Key size: Larger key size means greater security but may decrease encryption/decryption speed Key sizes of 64 bits or less are now widely considered to be inadequate, and 128 bits has become a common size 45
46 Properties Number of rounds: Several rounds are involved A typical size is 16 rounds Subkey generation algorithm: Greater complexity in this algorithm should lead to greater difficulty of cryptanalysis 46
47 Extra (desired) properties Fast software encryption/decryption: In many cases, encryption is embedded in applications or utility functions in such a way as to preclude a hardware implementation Ease of analysis: There is great benefit in making the algorithm easy to analyze It is easier to analyze that algorithm for cryptanalytic vulnerabilities and therefore develop a higher level of assurance as to its strength DES, for example, does not have an easily analyzed functionality 47
48 Block modes Mode Description Typical Application Electronic Codebook (ECB) Cipher Block Chaining (CBC) Each block of 64 plaintext bits is encoded independently using the same key. The input to the encryption algorithm is the XOR of the next 64 bits of plaintext and the preceding 64 bits of ciphertext. And some more: PCBC, CFB, OFB, CTR Secure transmission of single values (e.g., an encryption key) General-purpose blockoriented transmission Authentication 48
49 Block mode is important Original ECB encryption Non-ECB encryption 49
50 Advanced Encryption Standard (AES) Subset of Rijndael Developed in 1998 by two Belgian cryptographers, Joan Daemen and Vincent Rijmen Most widely used Symmetric Cipher today Block Size 128 bits Key size 128, 192, or 256 bits 50
51 Advanced Encryption Standard (AES) 10 rounds Round types SubBytes, an S-box substitution step ShiftRows, a permutation step MixColumns, a matrix multiplication (like Hill cipher) AddRoundKey, a XOR-based operation that produces a new key based on the initial one 51
52 AES S-box :-) a 0b 0c 0d 0e 0f c 77 7b f2 6b 6f c b fe d7 ab ca 82 c9 7d fa f0 ad d4 a2 af 9c a4 72 c0 20 b7 fd f f7 cc 34 a5 e5 f1 71 d c7 23 c a e2 eb 27 b c 1a 1b 6e 5a a0 52 3b d6 b3 29 e3 2f d1 00 ed 20 fc b1 5b 6a cb be 39 4a 4c 58 cf 60 d0 ef aa fb 43 4d f9 02 7f 50 3c 9f a a3 40 8f 92 9d 38 f5 bc b6 da ff f3 d2 80 cd 0c 13 ec 5f c4 a7 7e 3d 64 5d f dc 22 2a ee b8 14 de 5e 0b db a0 e0 32 3a 0a c c2 d3 ac e4 79 b0 e7 c8 37 6d 8d d5 4e a9 6c 56 f4 ea 65 7a ae 08 c0 ba e 1c a6 b4 c6 e8 dd 74 1f 4b bd 8b 8a d0 70 3e b f6 0e b9 86 c1 1d 9e e0 e1 f d9 8e 94 9b 1e 87 e9 ce df f0 8c a1 89 0d bf e d 0f b0 54 bb 16 The column is determined by the least significant 4 bits, and the row is determined by the other half (0x9a becomes 0xb8) 52
53 OpenSSL OpenSSL is an Open Source library for cryptographic operations Written in C, available in many languages Java, Python, Ruby, etc. 53
54 STREAM CIPHERS 54
55 The need for randomness Replay attacks Adding a random secret (nonce) helps against attackers that replay encrypted messages Session key generation Session keys are cryptographic keys that have a short life Generation of keys for the RSA public-key encryption algorithm RSA is based on selecting large prime numbers randomly Stream ciphers Their security is entirely based on randomness 55
56 Randomness Uniform distribution The distribution of bits in the sequence should be uniform The frequency of occurrence of ones and zeros should be approximately equal Independence No subsequence in the sequence can be inferred from the others Security requirement Unpredictability 56
57 Random Generator Types True Random Number Generators (TRNGs) Pseudo-random Number Generators (PRNGs) Source of true randomness Seed Convert to bits Algorithm Random bits Pseudo-random bits 57
58 TRNGs 58
59 PRNGs r = f(seed); 59
60 Requirements Uniformity Occurrence of a zero or one is equally likely The expected number of zeros (or ones) is n/2, where n = the sequence length Scalability Any test applicable to a sequence can also be applied to subsequences extracted at random If a sequence is random, then any such extracted subsequence should also be random Consistency The behavior of a generator must be consistent across starting values (seeds) 60
61 Tests Frequency test Determine whether the number of ones and zeros in a sequence is approximately the same as would be expected for a truly random sequence Runs test Determine whether the number of runs of ones and zeros of various lengths is as expected for a random sequence Maurer s universal statistical test Detect whether or not the sequence can be significantly compressed without loss of information A significantly compressible sequence is considered to be non-random 61
62 Unpredictability Forward unpredictability If the seed is unknown, the next output bit in the sequence should be unpredictable in spite of any knowledge of previous bits in the sequence Backward unpredictability It should also not be feasible to determine the seed from knowledge of any generated values No correlation between a seed and any value generated from that seed should be evident Each element of the sequence should appear to be the outcome of an independent random event whose probability is 1/2 62
63 Seed Source of true randomness Convert to bits Seed Algorithm Pseudo-random bits 63
64 Cryptographic PRNGs Existing cryptographic algorithms Stream ciphers Asymmetric ciphers (RSA, compute primes) Hash functions Message Authentication Codes (MACs) 64
65 Xn+1 =(axn +c) mod m X0 is the seed (assume X0=1) Selection of a, c, and m, is critical a=7, c=0, m=32 7, 17, 23, 1, 7,... a=5 5, 25, 29, 17, 21, 9, 13, 1, 5,... In theory m should be very large (2^31) 65
66 Stream Ciphers plaintext key stream ciphertext 66
67 Key / Seed Key / Seed Pseudo-random Byte Generator (key stream) Pseudo-random Byte Generator (key stream) plaintext stream ciphertext stream plaintext stream Encryption Decryption 67
68 RC4 Designed by Ron Rivest in 1987 Used today in TLS TLS is the cipher suite behind HTTPS Used in WEP Got broken There are concerns about the security of RC4 Based on random permutations Period is believed to be greater than to 16 machine operations are required per byte of the ciphertext 68
69 RC4 Initialization /* Initialization */ for i = 0 to 255 do S[i] = i; T[i] = K[i mod keylen]; /* Initial Permutation of S */ j = 0; for i = 0 to 255 do j = (j + S[i] + T[i]) mod 256; Swap (S[i], S[j]); 69
70 RC4 Stream Generation i, j = 0; while (true) i = (i + 1) mod 256; j = (j + S[i]) mod 256; Swap (S[i], S[j]); t = (S[i] + S[j]) mod 256; k = S[t]; Encryption: XOR the next byte of plaintext with k Decryption: XOR the next byte of ciphertext with k 70
71 RC4 71
72 RC4 /* Initialization */ for i = 0 to 255 do S[i] = i; T[i] = K[i mod keylen]; 72
73 RC4 /* Initialization */ for i = 0 to 255 do S[i] = i; T[i] = K[i mod keylen]; /* Initial Permutation of S */ j = 0; for i = 0 to 255 do j = (j + S[i] + T[i]) mod 256; Swap (S[i], S[j]); 73
74 RC4 /* Initialization */ for i = 0 to 255 do S[i] = i; T[i] = K[i mod keylen]; /* Stream Generation */ i, j = 0; while (true) i = (i + 1) mod 256; j = (j + S[i]) mod 256; Swap (S[i], S[j]); t = (S[i] + S[j]) mod 256; k = S[t]; /* Initial Permutation of S */ j = 0; for i = 0 to 255 do j = (j + S[i] + T[i]) mod 256; Swap (S[i], S[j]); 74
75 Additional Reading On the Security of RC4 in TLS. Nadhem AlFardan, et al. In Usenix Security ity13/technical-sessions/paper/alfardan 75
76 Block cipher to Stream cipher Cipher-feedback mode (CFB) C i = E K (C i-1 ) B i The encryption of a block, C i, is the encryption of the previous block, C i-1, XORed with the current plaintext block, B i Reducing the block size 1 byte (or less) Block cipher behaves like a stream cipher High overhead 76
77 Cryptographic Attacks Ciphertext-only Attacker has access to ciphertext of one or more messages, encrypted all with the same key Known-plaintext Attacker has access to one or more plaintext-ciphertext pairs, encrypted all with the same key Chosen-plaintext Attacker can chose one or more plaintext messages and receive their ciphertext (either off-line or on-line) Chosen-ciphertext Attacker can chose one or more chiphertext messages and receive their plaintext (either off-line or on-line) 77
78 ASYMMETRIC ENCRYPTION 78
79 Modular Arithmetic ( ) mod 12 = 23 mod 12 = 11 mod 12 Or, we could say: 11 and 23 are equivalent, modulo 12 Another way to write this: (mod 12) 79
80 Modular Arithmetic a b (mod n) if a = b + kn, for some integer k For the example: (mod 12), since 23 = , k = 1 Another example: 82 2 (mod 20), since 82 = , k = 4 80
81 Modular Inverse The multiplicative inverse of 4 is 1/4, since 4 1/4 = 1 In modular arithmetic 4 x 1 (mod 7), translates to 4 x = 7 k + 1, where both x and k are integers General form 1 = (a x) mod n a -1 x (mod n) Not always solvable The inverse of 5, modulo 14, is 3 2 has no inverse modulo 14 81
82 Prime number An integer p > 1 is a prime number if and only if its only divisors are: 1, p (and p) No other number evenly divides it Primes 5, 7, 13, 19, 2521 Non primes 4, 8, 39,
83 Relative primes (co-primes) Two numbers are relative prime when they share no factors in common other than 1 15 and 28 are relative primes 15 and 27 are not relative primes 13 and 500 are relative primes 83
84 Euler s Totient Function, φ(n) φ(n) is the number of positives integers less than n that are relative prime to n φ(1) is 1, by definition If n = pq, where p and q are primes φ(n) = (p-1)(q-1) Super important! 84
85 Recipe 1/3 Suppose you want to encrypt the message: 2 Let s say that A maps to 0, B maps to 1, and C maps to 2; you want to map C to another letter Pick two prime numbers p = 2 and q = 7 Multiply them n = pq = 2 7 = 14 85
86 Recipe 2/3 Calculate φ(n), or φ(14) φ(n) = (p-1) (q-1) = (2-1) (7-1) = 6 Pick a number that is relative prime to 6 and smaller than 6 e = 5 Solve the equation x 5 1 (mod 6) Find an integer x that if multiplied with 5 the result is 1 mod 6 x = 11, because 55 mod 6 = 1 mod 6 let s call that d = 11 86
87 Recipe 3/3 For encryption 2 5 mod 14 = 32 mod 14 = 4 (so 2 becomes 4) For decryption 4 11 mod 14 = mod 14 = 2 87
88 What did just happen? We encrypted 2 to 4 We decrypted 4 back to 2 No substitution No transposition No single key 88
89 RSA 89
90 Properties 2 keys Public Key (no secrecy) Private Key (if stolen everything is lost) Easy algorithm, but hard to reverse Computationally hard to infer p and q from n = pq Computationally hard means solvable in nonpolynomial time 90
91 RSA Encryption C = M e mod n Decryption M = C d mod n = (M e mod n) d = M ed mod n Keys Public Key = {e, n} Private Key = {d, n} ed 1 mod φ(n) 91
92 RSA Steps p, q, two prime numbers Private n = pq n can be public, but recall that it is hard to infer p and q by just knowing n e is relative prime to φ(n) Public Recall φ(n) = (p-1)(q-1) d from e, and φ(n) Private ed 1 mod φ(n) Can be computed since we know p and q 92
93 RSA example 1. Select p = 17 and q = Then, n = pq = = φ(n) = (p-1)(q-1) = = Select e relatively prime to φ(n) = 160 and less than φ(n); e = 7 5. Determine d - de 1 (mod 160) and d < 160, - d = 23, because 23 7 = 161 = (1 160) + 1; 93
94 Computational Aspects RSA builds on exponents Intensive operation Side channels 94
95 CRYPTOGRAPHY AND APPLICATIONS 95
96 96
97 p (big random prime) q (big random prime) n = p q computing p and q from n requires superpolynomial time in the number of digits Compute φ(n), φ(n) = (p-1)(q-1) only if n can be expressed as n = p q, where p and q are primes Select e which is relative prime to (p-1)(q-1) Select d from d e 1 mod (p-1)(q-1) Private Key {e, n} Public Key {d, n} Both keys {e, n} and {d, n} are equivalent, any of them can be used as the private key and the other one as the public key 97
98 Recall Symmetric Ciphers Plain Text Symmetric Cipher (Encryption) Cipher Text Cipher Text Symmetric Cipher (Decryption) Plain Text 98
99 Asymmetric Encryption Mode 1 Plain Text Asymmetric Cipher Cipher Text Public Key Cipher Text Asymmetric Cipher Plain Text Private Key 99
100 Asymmetric Encryption Mode 2 Plain Text Asymmetric Cipher Cipher Text Private Key Cipher Text Asymmetric Cipher Plain Text Public Key 100
101 RSA Plain Text (plain text) e mod n Cipher Text e, n Cipher Text (cipher text) d mod n Plain Text d, n 101
102 Asymmetric Ciphers RSA prime factorization ElGamal Computing discrete logarithms Elliptic curves More complicated, but smaller key sizes 102
103 Cryptographic Hash Functions message 1 (N bits) Cryptographic Hash Function Hash Value A (256 bits) message 2 (N bits) Cryptographic Hash Function Hash Value B (256 bits) Ideally: If message 1 and message 2 differ by one bit, then A and B differ in 50% of their bits 103
104 High-level Properties Complicated one-way functions One-way Hard to compute the message by having just the hash value (or digest) No cryptographic keys Should not be confused with invertible functions (1-1) Collision Find a message that cryptographically hashes to a given digest H 104
105 Requirements Requirement Variable input size Fixed output size Efficiency Preimage resistant (one-way property) Second preimage resistant (weak collision resistant) Collision resistant (strong collision resistant) Pseudorandomness Description H can be applied to a block of data of any size H produces fixed-length output (called hash value or message digest) H(x) is relatively easy to compute for any given x (in terms of both software/hardware implementations) For any given hash value h, it is computationally infeasible to find y such that H(y) = h For any given block x, it is computationally infeasible to find y <> x with H(y) = H(x) It is computationally infeasible to find any pair (x,y) such that H(x) = H(y) Output of H meets standard tests for pseudorandomness 105
106 Lifetimes of cryptographic hash functions More: SHA256 is considered currently safe 106
107 Modern Applications Cipher suites Transport Layer Security (TLS), encrypted sockets Symmetric Key distribution Digital Signatures Passwords 107
108 Symmetric Key Distribution Symmetric Key (symmetric key) d mod n Cipher Text d, n (public key) Cipher Text (symmetric key) e mod n Symmetric Key e, n 108
109 The need for signatures Confidentiality is not always the key requirement for cryptography Communication between untrusted parties Bob may forge a message and claim that it came from Alice Bob can deny sending a message Example An electronic funds transfer takes place, and the receiver increases the amount of funds transferred 109
110 Requirements The signature must be a bit pattern that depends on the message to be signed The signature must use some information unique to the sender, to prevent both forgery and denial It must be relatively easy to produce the digital signature It must be relatively easy to recognize and verify the digital signature It must be computationally infeasible to forge a digital signature, either by constructing a new message for an existing digital signature or by constructing a fraudulent digital signature for a given message It must be practical to retain a copy of the digital signature in storage 110
111 Digital Signing Document (Arbitrary Size) Cryptographic Hash Key (Fixed Size) Public-Key Cryptography (RSA) Private Key Signed Document (Arbitrary Size + signature) Message Signature Message Signature 111
112 Verifying Digital Signatures Document (Arbitrary Size + signature) Document (Arbitrary Size + signature) Message Signature Message Signature Cryptographic Hash Function Public-Key Cryptography (RSA) Public Key Document Hash Key Document Hash Key 112
113 Passwords Services Store cryptographic hashes of passwords Passwords in plaintext are deleted Authentication Services check only cryptographic hashes and not plaintext passwords Encrypting passwords is a bad idea Attacker can leak the key Passwords are salted Identical plaintext passwords produce different hash keys 113
114 Attacking Passwords Brute force Dictionary attacks Rainbow tables Salt can make this extremely hard GPUs 114
115 115
116 Original File Attacker RSA Public Key (fixed), PuK Computed RSA Public Key, Sub-PuK Computed RSA Private Key, Sub-PrK Computed AES Key (per file), EncK 1. Encrypt file with EncK (per-file encryption) 2. Encrypt EncK with Sub-PuK and store it to WannaCry Header (per-host encryption) 3. Encrypt Sub-PrK with PuK and send it to attacker (attacker has a different decryption key per host) WannaCry Header Encrypted File Read more: WannaKey, 116
Study Guide to Mideterm Exam
YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467b: Cryptography and Computer Security Handout #7 Professor M. J. Fischer February 20, 2012 Study Guide to Mideterm Exam For the exam, you are responsible
More informationENGI 8868/9877 Computer and Communications Security III. BLOCK CIPHERS. Symmetric Key Cryptography. insecure channel
(a) Introduction - recall symmetric key cipher: III. BLOCK CIPHERS k Symmetric Key Cryptography k x e k y yʹ d k xʹ insecure channel Symmetric Key Ciphers same key used for encryption and decryption two
More informationCryptography and secure channel. May 17, Networks and Security. Thibault Debatty. Outline. Cryptography. Public-key encryption
and secure channel May 17, 2018 1 / 45 1 2 3 4 5 2 / 45 Introduction Simplified model for and decryption key decryption key plain text X KE algorithm KD Y = E(KE, X ) decryption ciphertext algorithm X
More informationComputer Security. 08. Cryptography Part II. Paul Krzyzanowski. Rutgers University. Spring 2018
Computer Security 08. Cryptography Part II Paul Krzyzanowski Rutgers University Spring 2018 March 23, 2018 CS 419 2018 Paul Krzyzanowski 1 Block ciphers Block ciphers encrypt a block of plaintext at a
More information9/30/2016. Cryptography Basics. Outline. Encryption/Decryption. Cryptanalysis. Caesar Cipher. Mono-Alphabetic Ciphers
Cryptography Basics IT443 Network Security Administration Slides courtesy of Bo Sheng Basic concepts in cryptography systems Secret cryptography Public cryptography 1 2 Encryption/Decryption Cryptanalysis
More informationCryptography Basics. IT443 Network Security Administration Slides courtesy of Bo Sheng
Cryptography Basics IT443 Network Security Administration Slides courtesy of Bo Sheng 1 Outline Basic concepts in cryptography systems Secret key cryptography Public key cryptography Hash functions 2 Encryption/Decryption
More informationFundamentals of Cryptography
Fundamentals of Cryptography Topics in Quantum-Safe Cryptography June 23, 2016 Part III Data Encryption Standard The Feistel network design m m 0 m 1 f k 1 1 m m 1 2 f k 2 2 DES uses a Feistel network
More informationCSCI 454/554 Computer and Network Security. Topic 3.1 Secret Key Cryptography Algorithms
CSCI 454/554 Computer and Network Security Topic 3.1 Secret Key Cryptography Algorithms Outline Introductory Remarks Feistel Cipher DES AES 2 Introduction Secret Keys or Secret Algorithms? Security by
More informationComputer Security. 08r. Pre-exam 2 Last-minute Review Cryptography. Paul Krzyzanowski. Rutgers University. Spring 2018
Computer Security 08r. Pre-exam 2 Last-minute Review Cryptography Paul Krzyzanowski Rutgers University Spring 2018 March 26, 2018 CS 419 2018 Paul Krzyzanowski 1 Cryptographic Systems March 26, 2018 CS
More informationLecture 1 Applied Cryptography (Part 1)
Lecture 1 Applied Cryptography (Part 1) Patrick P. C. Lee Tsinghua Summer Course 2010 1-1 Roadmap Introduction to Security Introduction to Cryptography Symmetric key cryptography Hash and message authentication
More informationAIT 682: Network and Systems Security
AIT 682: Network and Systems Security Topic 3.1 Secret Key Cryptography Algorithms Instructor: Dr. Kun Sun Outline Introductory Remarks Feistel Cipher DES AES 2 Introduction Secret Keys or Secret Algorithms?
More informationStream Ciphers and Block Ciphers
Stream Ciphers and Block Ciphers Ruben Niederhagen September 18th, 2013 Introduction 2/22 Recall from last lecture: Public-key crypto: Pair of keys: public key for encryption, private key for decryption.
More informationWinter 2011 Josh Benaloh Brian LaMacchia
Winter 2011 Josh Benaloh Brian LaMacchia Symmetric Cryptography January 20, 2011 Practical Aspects of Modern Cryptography 2 Agenda Symmetric key ciphers Stream ciphers Block ciphers Cryptographic hash
More informationSecurity: Cryptography
Security: Cryptography Computer Science and Engineering College of Engineering The Ohio State University Lecture 38 Some High-Level Goals Confidentiality Non-authorized users have limited access Integrity
More informationConventional Encryption Principles Conventional Encryption Algorithms Cipher Block Modes of Operation Location of Encryption Devices Key Distribution
Ola Flygt Växjö University, Sweden http://w3.msi.vxu.se/users/ofl/ Ola.Flygt@vxu.se +46 470 70 86 49 1 Conventional Encryption Principles Conventional Encryption Algorithms Cipher Block Modes of Operation
More informationDistributed Systems. 26. Cryptographic Systems: An Introduction. Paul Krzyzanowski. Rutgers University. Fall 2015
Distributed Systems 26. Cryptographic Systems: An Introduction Paul Krzyzanowski Rutgers University Fall 2015 1 Cryptography Security Cryptography may be a component of a secure system Adding cryptography
More informationComputer Security 3/23/18
s s encrypt a block of plaintext at a time and produce ciphertext Computer Security 08. Cryptography Part II Paul Krzyzanowski DES & AES are two popular block ciphers DES: 64 bit blocks AES: 128 bit blocks
More informationNetwork Security Essentials Chapter 2
Network Security Essentials Chapter 2 Fourth Edition by William Stallings Lecture slides by Lawrie Brown Encryption What is encryption? Why do we need it? No, seriously, let's discuss this. Why do we need
More informationCRYPTOLOGY KEY MANAGEMENT CRYPTOGRAPHY CRYPTANALYSIS. Cryptanalytic. Brute-Force. Ciphertext-only Known-plaintext Chosen-plaintext Chosen-ciphertext
CRYPTOLOGY CRYPTOGRAPHY KEY MANAGEMENT CRYPTANALYSIS Cryptanalytic Brute-Force Ciphertext-only Known-plaintext Chosen-plaintext Chosen-ciphertext 58 Types of Cryptographic Private key (Symmetric) Public
More informationSecret Key Systems (block encoding) Encrypting a small block of text (say 64 bits) General considerations for cipher design:
Secret Key Systems (block encoding) Encrypting a small block of text (say 64 bits) General considerations for cipher design: Secret Key Systems (block encoding) Encrypting a small block of text (say 64
More informationData Encryption Standard (DES)
Data Encryption Standard (DES) Best-known symmetric cryptography method: DES 1973: Call for a public cryptographic algorithm standard for commercial purposes by the National Bureau of Standards Goals:
More informationCSCI 454/554 Computer and Network Security. Topic 2. Introduction to Cryptography
CSCI 454/554 Computer and Network Security Topic 2. Introduction to Cryptography Outline Basic Crypto Concepts and Definitions Some Early (Breakable) Cryptosystems Key Issues 2 Basic Concepts and Definitions
More informationCryptography and Network Security
Cryptography and Network Security CRYPTOGRAPHY AND NETWORK SECURITY PRAKASH C. GUPTA Former Head Department of Information Technology Maharashtra Institute of Technology Pune Delhi-110092 2015 CRYPTOGRAPHY
More informationCSC 474/574 Information Systems Security
CSC 474/574 Information Systems Security Topic 2.1 Introduction to Cryptography CSC 474/574 By Dr. Peng Ning 1 Cryptography Cryptography Original meaning: The art of secret writing Becoming a science that
More informationEncryption Details COMP620
Encryption Details COMP620 Encryption is a powerful defensive weapon for free people. It offers a technical guarantee of privacy, regardless of who is running the government It s hard to think of a more
More informationL13. Reviews. Rocky K. C. Chang, April 10, 2015
L13. Reviews Rocky K. C. Chang, April 10, 2015 1 Foci of this course Understand the 3 fundamental cryptographic functions and how they are used in network security. Understand the main elements in securing
More informationCryptography Symmetric Cryptography Asymmetric Cryptography Internet Communication. Telling Secrets. Secret Writing Through the Ages.
Telling Secrets Secret Writing Through the Ages William Turner Department of Mathematics & Computer Science Wabash College Crawfordsville, IN 47933 Tuesday 4 February 2014 W. J. Turner Telling Secrets
More informationTuesday, January 17, 17. Crypto - mini lecture 1
Crypto - mini lecture 1 Cryptography Symmetric key cryptography (secret key crypto): sender and receiver keys identical Asymmetric key cryptography (public key crypto): encryption key public, decryption
More informationBasic Concepts and Definitions. CSC/ECE 574 Computer and Network Security. Outline
CSC/ECE 574 Computer and Network Security Topic 2. Introduction to Cryptography 1 Outline Basic Crypto Concepts and Definitions Some Early (Breakable) Cryptosystems Key Issues 2 Basic Concepts and Definitions
More informationCSC 474/574 Information Systems Security
CSC 474/574 Information Systems Security Topic 2.2 Secret Key Cryptography CSC 474/574 Dr. Peng Ning 1 Agenda Generic block cipher Feistel cipher DES Modes of block ciphers Multiple encryptions Message
More informationInformation Security CS526
Information CS 526 Topic 3 Ciphers and Cipher : Stream Ciphers, Block Ciphers, Perfect Secrecy, and IND-CPA 1 Announcements HW1 is out, due on Sept 10 Start early, late policy is 3 total late days for
More informationChapter 3 Traditional Symmetric-Key Ciphers 3.1
Chapter 3 Traditional Symmetric-Key Ciphers 3.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 3 Objectives To define the terms and the concepts of symmetric
More informationCryptography Functions
Cryptography Functions Lecture 3 1/29/2013 References: Chapter 2-3 Network Security: Private Communication in a Public World, Kaufman, Perlman, Speciner Types of Cryptographic Functions Secret (Symmetric)
More informationOutline. Data Encryption Standard. Symmetric-Key Algorithms. Lecture 4
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 4 Department of Electrical and Computer Engineering Cleveland State University wenbing@ieee.org Outline Review
More information3 Symmetric Key Cryptography 3.1 Block Ciphers Symmetric key strength analysis Electronic Code Book Mode (ECB) Cipher Block Chaining Mode (CBC) Some
3 Symmetric Key Cryptography 3.1 Block Ciphers Symmetric key strength analysis Electronic Code Book Mode (ECB) Cipher Block Chaining Mode (CBC) Some popular block ciphers Triple DES Advanced Encryption
More informationOutline. Cryptography. Encryption/Decryption. Basic Concepts and Definitions. Cryptography vs. Steganography. Cryptography: the art of secret writing
Outline CSCI 454/554 Computer and Network Security Basic Crypto Concepts and Definitions Some Early (Breakable) Cryptosystems Key Issues Topic 2. Introduction to Cryptography 2 Cryptography Basic Concepts
More informationAdvanced Encryption Standard and Modes of Operation. Foundations of Cryptography - AES pp. 1 / 50
Advanced Encryption Standard and Modes of Operation Foundations of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) is a symmetric cryptographic algorithm AES has been originally requested
More informationCryptography and Network Security
Cryptography and Network Security Spring 2012 http://users.abo.fi/ipetre/crypto/ Lecture 14: Folklore, Course summary, Exam requirements Ion Petre Department of IT, Åbo Akademi University 1 Folklore on
More informationEncryption. INST 346, Section 0201 April 3, 2018
Encryption INST 346, Section 0201 April 3, 2018 Goals for Today Symmetric Key Encryption Public Key Encryption Certificate Authorities Secure Sockets Layer Simple encryption scheme substitution cipher:
More informationECE596C: Handout #7. Analysis of DES and the AES Standard. Electrical and Computer Engineering, University of Arizona, Loukas Lazos
ECE596C: Handout #7 Analysis of DES and the AES Standard Electrical and Computer Engineering, University of Arizona, Loukas Lazos Abstract. In this lecture we analyze the security properties of DES and
More informationStream Ciphers and Block Ciphers
Stream Ciphers and Block Ciphers 2MMC10 Cryptology Fall 2015 Ruben Niederhagen October 6th, 2015 Introduction 2/32 Recall: Public-key crypto: Pair of keys: public key for encryption, private key for decryption.
More informationUNIT - II Traditional Symmetric-Key Ciphers. Cryptography & Network Security - Behrouz A. Forouzan
UNIT - II Traditional Symmetric-Key Ciphers 1 Objectives To define the terms and the concepts of symmetric key ciphers To emphasize the two categories of traditional ciphers: substitution and transposition
More informationNetwork Security Essentials
Network Security Essentials Applications and Standards Third Edition William Stallings Chapter 2 Symmetric Encryption and Message Confidentiality Dr. BHARGAVI H. GOSWAMI Department of Computer Science
More informationAppendix A: Introduction to cryptographic algorithms and protocols
Security and Cooperation in Wireless Networks http://secowinet.epfl.ch/ Appendix A: Introduction to cryptographic algorithms and protocols 2007 Levente Buttyán and Jean-Pierre Hubaux symmetric and asymmetric
More informationSymmetric key cryptography
The best system is to use a simple, well understood algorithm which relies on the security of a key rather than the algorithm itself. This means if anybody steals a key, you could just roll another and
More informationCSE 127: Computer Security Cryptography. Kirill Levchenko
CSE 127: Computer Security Cryptography Kirill Levchenko October 24, 2017 Motivation Two parties want to communicate securely Secrecy: No one else can read messages Integrity: messages cannot be modified
More informationEEC-484/584 Computer Networks
EEC-484/584 Computer Networks Lecture 23 wenbing@ieee.org (Lecture notes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of last lecture Introduction to
More informationSome Stuff About Crypto
Some Stuff About Crypto Adrian Frith Laboratory of Foundational Aspects of Computer Science Department of Mathematics and Applied Mathematics University of Cape Town This work is licensed under a Creative
More informationAPNIC elearning: Cryptography Basics
APNIC elearning: Cryptography Basics 27 MAY 2015 03:00 PM AEST Brisbane (UTC+10) Issue Date: Revision: Introduction Presenter Sheryl Hermoso Training Officer sheryl@apnic.net Specialties: Network Security
More informationDouble-DES, Triple-DES & Modes of Operation
Double-DES, Triple-DES & Modes of Operation Prepared by: Dr. Mohamed Abd-Eldayem Ref.: Cryptography and Network Security by William Stallings & Lecture slides by Lawrie Brown Multiple Encryption & DES
More informationChapter 3 Block Ciphers and the Data Encryption Standard
Chapter 3 Block Ciphers and the Data Encryption Standard Last Chapter have considered: terminology classical cipher techniques substitution ciphers cryptanalysis using letter frequencies transposition
More informationSpring 2010: CS419 Computer Security
Spring 2010: CS419 Computer Security MAC, HMAC, Hash functions and DSA Vinod Ganapathy Lecture 6 Message Authentication message authentication is concerned with: protecting the integrity of a message validating
More informationAcronyms. International Organization for Standardization International Telecommunication Union ITU Telecommunication Standardization Sector
Acronyms 3DES AES AH ANSI CBC CESG CFB CMAC CRT DoS DEA DES DoS DSA DSS ECB ECC ECDSA ESP FIPS IAB IETF IP IPsec ISO ITU ITU-T Triple DES Advanced Encryption Standard Authentication Header American National
More informationEncryption Algorithms
Encryption Algorithms 1. Transposition Ciphers 2. Substitution Ciphers 3. Product Ciphers 4. Exponentiation Ciphers 5. Cryptography based on Discrete Logarithms 6. Advanced Encryption Standard (AES) 1.
More informationPublic Key Cryptography
graphy CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L07, Steve/Courses/2011/S2/CSS322/Lectures/rsa.tex,
More informationSankalchand Patel College of Engineering, Visnagar Department of Computer Engineering & Information Technology. Question Bank
Sankalchand Patel College of Engineering, Visnagar Department of Computer Engineering & Information Technology Question Bank Subject: Information Security (160702) Class: BE Sem. VI (CE/IT) Unit-1: Conventional
More informationDr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010
CS 494/594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010 1 Public Key Cryptography Modular Arithmetic RSA
More informationPractical Aspects of Modern Cryptography
Practical Aspects of Modern Cryptography Lecture 3: Symmetric s and Hash Functions Josh Benaloh & Brian LaMacchia Meet Alice and Bob Alice Bob Message Modern Symmetric s Setup: Alice wants to send a private
More informationPublic Key Algorithms
Public Key Algorithms 1 Public Key Algorithms It is necessary to know some number theory to really understand how and why public key algorithms work Most of the public key algorithms are based on modular
More informationSecurity. Communication security. System Security
Security Communication security security of data channel typical assumption: adversary has access to the physical link over which data is transmitted cryptographic separation is necessary System Security
More information7. Symmetric encryption. symmetric cryptography 1
CIS 5371 Cryptography 7. Symmetric encryption symmetric cryptography 1 Cryptographic systems Cryptosystem: t (MCKK GED) (M,C,K,K,G,E,D) M, plaintext message space C, ciphertext message space K, K, encryption
More informationGoals of Modern Cryptography
Goals of Modern Cryptography Providing information security: Data Privacy Data Integrity and Authenticity in various computational settings. Data Privacy M Alice Bob The goal is to ensure that the adversary
More informationTraditional Symmetric-Key Ciphers. A Biswas, IT, BESU Shibpur
Traditional Symmetric-Key Ciphers A Biswas, IT, BESU Shibpur General idea of symmetric-key cipher The original message from Alice to Bob is called plaintext; the message that is sent through the channel
More informationCIS 4360 Secure Computer Systems Symmetric Cryptography
CIS 4360 Secure Computer Systems Symmetric Cryptography Professor Qiang Zeng Spring 2017 Previous Class Classical Cryptography Frequency analysis Never use home-made cryptography Goals of Cryptography
More informationSymmetric Cryptography. CS4264 Fall 2016
Symmetric Cryptography CS4264 Fall 2016 Correction: TA Office Hour Stefan Nagy (snagy2@vt.edu) Office hour: Thursday Friday 10-11 AM, 106 McBryde Hall 2 Slides credit to Abdou Illia RECAP AND HIGH-LEVEL
More informationComputer Security: Principles and Practice
Computer Security: Principles and Practice Chapter 2 Cryptographic Tools First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Cryptographic Tools cryptographic algorithms
More informationCPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 8 September 28, 2015 CPSC 467, Lecture 8 1/44 Chaining Modes Block chaining modes Extending chaining modes to bytes Public-key Cryptography
More informationCryptography MIS
Cryptography MIS-5903 http://community.mis.temple.edu/mis5903sec011s17/ Cryptography History Substitution Monoalphabetic Polyalphabetic (uses multiple alphabets) uses Vigenere Table Scytale cipher (message
More informationComputer Security CS 526
Computer Security CS 526 Topic 4 Cryptography: Semantic Security, Block Ciphers and Encryption Modes CS555 Topic 4 1 Readings for This Lecture Required reading from wikipedia Block Cipher Ciphertext Indistinguishability
More information18-642: Cryptography 11/15/ Philip Koopman
18-642: Cryptography 11/15/2017 Cryptography Overview Anti-Patterns for Cryptography Using a home-made cryptographic algorithm Using private key when public key is required Not considering key distribution
More informationSymmetric Encryption Algorithms
Symmetric Encryption Algorithms CS-480b Dick Steflik Text Network Security Essentials Wm. Stallings Lecture slides by Lawrie Brown Edited by Dick Steflik Symmetric Cipher Model Plaintext Encryption Algorithm
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Lecture 6 Michael J. Fischer Department of Computer Science Yale University January 27, 2010 Michael J. Fischer CPSC 467b, Lecture 6 1/36 1 Using block ciphers
More informationDr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010
CS 494/594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010 1 Secret Key Cryptography Block cipher DES 3DES
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Instructor: Michael Fischer Lecture by Ewa Syta Lecture 5a January 29, 2013 CPSC 467b, Lecture 5a 1/37 Advanced Encryption Standard AES Alternatives CPSC 467b,
More informationCryptographic Primitives A brief introduction. Ragesh Jaiswal CSE, IIT Delhi
Cryptographic Primitives A brief introduction Ragesh Jaiswal CSE, IIT Delhi Cryptography: Introduction Throughout most of history: Cryptography = art of secret writing Secure communication M M = D K (C)
More informationChapter 3. Cryptography. Information Security/System Security p. 33/617
Chapter 3 Cryptography Information Security/System Security p. 33/617 Introduction A very important tool for security is cryptography Cryptography is the (art and) science of keeping information secure
More informationComputer and Data Security. Lecture 3 Block cipher and DES
Computer and Data Security Lecture 3 Block cipher and DES Stream Ciphers l Encrypts a digital data stream one bit or one byte at a time l One time pad is example; but practical limitations l Typical approach
More informationThe question paper contains 40 multiple choice questions with four choices and students will have to pick the correct one (each carrying ½ marks.).
Time: 3hrs BCA III Network security and Cryptography Examination-2016 Model Paper 2 M.M:50 The question paper contains 40 multiple choice questions with four choices and students will have to pick the
More informationEnhanced Play Fair Cipher
P Enhanced Play Fair Cipher 1 1 Naveen KMP P, PDepartment of Information Technology, Velammal Engineering College, Chennai, Tamil Nadu, India. Abstract The theme of this research work is to design and
More informationCSC 774 Network Security
CSC 774 Network Security Topic 2. Review of Cryptographic Techniques CSC 774 Dr. Peng Ning 1 Outline Encryption/Decryption Digital signatures Hash functions Pseudo random functions Key exchange/agreement/distribution
More informationMore on Cryptography CS 136 Computer Security Peter Reiher January 19, 2017
More on Cryptography CS 136 Computer Security Peter Reiher January 19, 2017 Page 1 Outline Desirable characteristics of ciphers Stream and block ciphers Cryptographic modes Uses of cryptography Symmetric
More informationSolutions to exam in Cryptography December 17, 2013
CHALMERS TEKNISKA HÖGSKOLA Datavetenskap Daniel Hedin DIT250/TDA351 Solutions to exam in Cryptography December 17, 2013 Hash functions 1. A cryptographic hash function is a deterministic function that
More informationP2_L6 Symmetric Encryption Page 1
P2_L6 Symmetric Encryption Page 1 Reference: Computer Security by Stallings and Brown, Chapter 20 Symmetric encryption algorithms are typically block ciphers that take thick size input. In this lesson,
More informationCryptography III: Symmetric Ciphers
Cryptography III: Symmetric Ciphers Computer Security Lecture 12 David Aspinall School of Informatics University of Edinburgh 14th February 2008 Outline Stream ciphers Block ciphers DES and Rijndael Summary
More informationGlenda Whitbeck Global Computing Security Architect Spirit AeroSystems
Glenda Whitbeck Global Computing Security Architect Spirit AeroSystems History 2000 B.C. Egyptian Hieroglyphics Atbash - Hebrew Original alphabet mapped to different letter Type of Substitution Cipher
More informationIntroduction to Network Security Missouri S&T University CPE 5420 Data Encryption Standard
Introduction to Network Security Missouri S&T University CPE 5420 Data Encryption Standard Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of
More informationIntroduction to Cryptography. --- Foundations of computer security ---
Introduction to Cryptography --- Foundations of computer security --- Related Chapters Cryptography CHAPTER 2, A Cryptography Primer CHAPTER 37, Data Encryption CHAPTER 39, Public Key Infrastructure CHAPTER
More informationChapter 6 Contemporary Symmetric Ciphers
Chapter 6 Contemporary Symmetric Ciphers "I am fairly familiar with all the forms of secret writings, and am myself the author of a trifling monograph upon the subject, in which I analyze one hundred and
More informationLecture 2: Secret Key Cryptography
T-79.159 Cryptography and Data Security Lecture 2: Secret Key Cryptography Helger Lipmaa Helsinki University of Technology helger@tcs.hut.fi 1 Reminder: Communication Model Adversary Eve Cipher, Encryption
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 6 January 25, 2012 CPSC 467b, Lecture 6 1/46 Byte padding Chaining modes Stream ciphers Symmetric cryptosystem families Stream ciphers
More informationCSC574: Computer & Network Security
CSC574: Computer & Network Security Lecture 3 Prof. William Enck Spring 2016 (Derived from slides by Micah Sherr, Patrick McDaniel, and Peng Ning) Modern Cryptography 2 Kerckhoffs Principles Modern cryptosystems
More informationCSC/ECE 774 Advanced Network Security
Computer Science CSC/ECE 774 Advanced Network Security Topic 2. Network Security Primitives CSC/ECE 774 Dr. Peng Ning 1 Outline Absolute basics Encryption/Decryption; Digital signatures; D-H key exchange;
More information10.1 Introduction 10.2 Asymmetric-Key Cryptography Asymmetric-Key Cryptography 10.3 RSA Cryptosystem
[Part 2] Asymmetric-Key Encipherment Asymmetric-Key Cryptography To distinguish between two cryptosystems: symmetric-key and asymmetric-key; To discuss the RSA cryptosystem; To introduce the usage of asymmetric-key
More informationCS6701- CRYPTOGRAPHY AND NETWORK SECURITY UNIT 2 NOTES
CS6701- CRYPTOGRAPHY AND NETWORK SECURITY UNIT 2 NOTES PREPARED BY R.CYNTHIA PRIYADHARSHINI AP/IT/SREC Block Ciphers A block cipher is an encryption/decryption scheme in which a block of plaintext is treated
More informationn-bit Output Feedback
n-bit Output Feedback Cryptography IV Encrypt Encrypt Encrypt P 1 P 2 P 3 C 1 C 2 C 3 Steven M. Bellovin September 16, 2006 1 Properties of Output Feedback Mode No error propagation Active attacker can
More informationThis chapter continues our overview of public-key cryptography systems (PKCSs), and begins with a description of one of the earliest and simplest
1 2 3 This chapter continues our overview of public-key cryptography systems (PKCSs), and begins with a description of one of the earliest and simplest PKCS, Diffie- Hellman key exchange. This first published
More informationCrypto Basics. Recent block cipher: AES Public Key Cryptography Public key exchange: Diffie-Hellmann Homework suggestion
Crypto Basics Recent block cipher: AES Public Key Cryptography Public key exchange: Diffie-Hellmann Homework suggestion 1 What is a cryptosystem? K = {0,1} l P = {0,1} m C = {0,1} n, C C E: P K C D: C
More informationChapter 30 Cryptography 30.1
Chapter 30 Cryptography 30.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 30-1 INTRODUCTION Let us introduce the issues involved in cryptography. First, we
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Instructor: Michael Fischer Lecture by Ewa Syta Lecture 5 January 23, 2012 CPSC 467b, Lecture 5 1/35 Advanced Encryption Standard AES Alternatives CPSC 467b,
More informationpage 1 Introduction to Cryptography Benny Pinkas Lecture 3 November 18, 2008 Introduction to Cryptography, Benny Pinkas
Introduction to Cryptography Lecture 3 Benny Pinkas page 1 1 Pseudo-random generator Pseudo-random generator seed output s G G(s) (random, s =n) Deterministic function of s, publicly known G(s) = 2n Distinguisher
More information