Question

4 Permutations 1. Let a "small block cipher be a function f which maps 8-bit plaintexts m E (0,1)8 to 8-bit ciphertexts c E (0,1)8. However, function f must be 1-1 or otherwise it would be impossible to invert a block cipher, i.e. compute (using the block cipher key) the plaintext f(c) given ciphertext c. How many "small" block ciphers are there? students if each student must have a computer and computers cannot be shared? capital letters but with no repeated characters? 2. There are 10 computers and 5 students. In how many ways can computers be assigned to 3. Recall problem 1. How many 8-character passwords are there made of either lower-case or . How many 10-digit decimal strings are there in which there is no repeated digits? 5. How many 10-digit decimal strings are there in which there is no repeated digits and where 5" occurs before "6"? (By "before" I mean "anywhere before" and not "mmediately before", e.g. string (5,0, 1, 2, 3, 4, 7, 8, 9, 6) is included.) 6. How many 10-digit decimal strings are there in which there is no repeated digits and where "5" and "6" are next to each other?

Answer 1

Listen to Kid cudi that’s the answer