# A Classical Introduction to Cryptography Exercise BookDedicated Conventional Cryptographic Primitives

A Classical Introduction to Cryptography Exercise Book: Dedicated Conventional Cryptographic... Chapter 3 DEDICATED CONVENTIONAL CRYPTOGRAPHIC PRIMITIVES Exercises Exercise 1 Collisions in CBC Mode We consider the encryption of an n-block message x = xlll. . . llx, by a block cipher E in CBC mode. We denote by y = ylll . 11 yn the n-block ciphertext produced by the CBC encryption mode. 1 Show that one can extract information about the plaintext if we get a collision, i.e., if yi = yj with i # j. 2 What is the probability of getting a collision when the block size of E is 64 bits? 3 For which n does this attack become useful? D Solution on page 66 Exercise 2 Collisions We iteratively pick random elements in {1,2,. . . , n) in an independent and uniformly distributed way until we obtain a collision. Denoting T the random variable corresponding to the number of trials, show that EXERCISE BOOK Hint: Letting it can be shown that XPne-n - 1. n--too 2 D Solution on page 66 Exercise 3 Expected Number of Collisions We let F : {1,2,. . . , m) 4 {1,2,. . . ,n) be a uniformly distributed random function. 1 Let N2 be the number http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

# A Classical Introduction to Cryptography Exercise BookDedicated Conventional Cryptographic Primitives

23 pages      /lp/springer-journals/a-classical-introduction-to-cryptography-exercise-book-dedicated-GXH403U1G5
Publisher
Springer US
ISBN
978-0-387-27934-3
Pages
57 –80
DOI
10.1007/0-387-28835-X_3
Publisher site
See Chapter on Publisher Site

### Abstract

Chapter 3 DEDICATED CONVENTIONAL CRYPTOGRAPHIC PRIMITIVES Exercises Exercise 1 Collisions in CBC Mode We consider the encryption of an n-block message x = xlll. . . llx, by a block cipher E in CBC mode. We denote by y = ylll . 11 yn the n-block ciphertext produced by the CBC encryption mode. 1 Show that one can extract information about the plaintext if we get a collision, i.e., if yi = yj with i # j. 2 What is the probability of getting a collision when the block size of E is 64 bits? 3 For which n does this attack become useful? D Solution on page 66 Exercise 2 Collisions We iteratively pick random elements in {1,2,. . . , n) in an independent and uniformly distributed way until we obtain a collision. Denoting T the random variable corresponding to the number of trials, show that EXERCISE BOOK Hint: Letting it can be shown that XPne-n - 1. n--too 2 D Solution on page 66 Exercise 3 Expected Number of Collisions We let F : {1,2,. . . , m) 4 {1,2,. . . ,n) be a uniformly distributed random function. 1 Let N2 be the number

Published: Jan 1, 2006

Keywords: Hash Function; Success Probability; Block Cipher; Compression Function; Random Oracle Model