DOCSLIB.ORG

ECE596C: Handout #6

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
ECE596C: Handout #6 ECE596C: Handout #6 Product Cryptosystems and Block Ciphers Electrical and Computer Engineering, University of Arizona, Loukas Lazos Abstract. In this lecture we present the idea of a product cryptosystem introduced by Shan- non. This idea is exploited in block ciphers such as the Advanced Encryption Standard. We also present the basic principles of Substitution-Permutation Networks (SPNs), and examine the structure of DES. 1 Product Cryptosystems 1 Let two endomorphic cryptosystems be S1 = {P, P, K1, E1, D1}, S2 = {P, P, K2, E2, D2}. The product cryptosystem of S1,S2 is defined to be the cryptosystem: S1 × S2 = {P, P, K1 × K2, E, D} (1) The key for such system is (K1, K2) with K1 ∈ K1 and K2 ∈ K2. The encryption in a product cryptosystem is defined as: y = e(K1,K2)(x) = eK2 (eK1 (x)). (2) and the decryption function is applying the keys in the reverse order: x = d(K1,K2) = dK1 (dK2 (y)). (3) Example of a product cipher–Multiplicative Cipher × Shift Cipher: Definition 1. Let P = C = Z26 and K = {a ∈ Z26 : gcd(a, 26) = 1} (4) For a ∈ K the encryption and decryption rules are defined as follows: ea(x) = ax mod 26 (5) −1 da(y) = a y mod 26. (6) Let M be a multiplicative cipher and let S be a Shift cipher, with keys for both ciphers chosen equiprobably from the respective keyspaces. It is very easy to see that the product M × S is nothing more but the Affine cipher. It can also be shown that the cyptosystem S × M is equivalent to an affine cipher. When S × M = M × S we say that the two cryptosystems commute. Regardless, the associative property always holds for cryptosystems. That is, (S1 × S2) × S3 = S1 × (S2 × S3). Definition 2. A cryptosystem is called idempotent if S × S = S. 1 A cryptosystem is called endomorphic if C = P. 2 ECE 596C: Cryptography for Secure Communications with Applications to Network Security Examples of idempotent cryptosystems are the Shift, Substitution, Affine, Hill, Vig´enere and Permutation ciphers. Question: Does a product of any idempotent cryptosystems has an increased level of security com- pared to a single encryption system? Lemma 1. If two cryptosystems are idempotent and they commute, then the product cryptosystem is also idempotent. Handout # 6 3 2 Block Ciphers In a block cipher the plaintext is split into blocks , and each block is processed separately. A common design for such cipher is that of an iterative cipher where each block is passed through a number of rounds of encryption according to a key schedule. From a key K of some length we derive Nr subkeys denoted by K1, K2 ...KNr Let g be the round function (publicly known) that takes as an input the current key Kr and the state from the previous round wr−1. w0 ← x w1 ← g(w0, K1) w2 ← g(w1, K2) . ← . ← . ← . wNr−1 ← g(wNr−2, KNr−1) wN r ← g(wNr−1, KNr) y ← wNr. Necessary condition for decryption is that g is injective when the second argument is fixed. The decryption rule is: − g 1(g(w,y),y) = w (7) The decryption is accomplished by recovering the plaintext in reverse order from encryption. wNr ← y wNr−1 ← g−1(wNr, KNr) wNr−2 ← g−1(wNr−1, KNr−1) . ← . ← . ← . w1 ← g−1(w2, K2) w0 ← g−1(w1, K1) x ← w0. 2.1 Substitution-Permutation Networks (SPN) Idea: Diffusion and Confusion principle from Shannon. Let ℓ, m be two positive integer numbers, and the plaintext/ciphertecxt be blocks of length ℓm. An SPN is built into two components, denoted as πS, πP . ℓ ℓ πS : {0, 1} → {0, 1} , (8) and πP : {1,...ℓm} → {1,...,ℓm}. (9) 4 ECE 596C: Cryptography for Secure Communications with Applications to Network Security The component πS is essentially a substitution cipher and is known as an S-box, while the com- ponent πP is a permutation cipher used to permute the letters of the input text. At each round, the state is whitened by an XOR operation with a key according to the key schedule. An SPN network is depicted in figure 1. Fig. 1. An SPN network with 4 rounds. Illustration of an SPN via an example: Assume that for an SPN ℓ = m = Nr = 4 and πS be: x 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 πS(x) 14 4 13 1 2 15 11 8 3 10 6 12 5 9 0 7 Define also the permutation πP be: Handout # 6 5 x 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 πp(x) 1 5 9 13 2 6 10 14 3 7 11 15 4 8 12 16 Let also the key schedule be derived from a 32-bit key K in a cyclic manner by considering 16 consecutive bits beginning from bit k4r−3 where r denotes the round. Assume that the initial key is: K = 0011 1010 1001 0100 1101 0110 0011 1111 (10) and the plaintext be x = 0010 0110 1011 0111. (11) Find the ciphertext: 6 ECE 596C: Cryptography for Secure Communications with Applications to Network Security 2.2 Properties of SPN – S-boxes are very easy to implement in the form of a look-up table. – Storage requirement is ℓ2ℓ since we have to store 2ℓ values of length ℓ each. Hence S-boxes have to be small. 3 The Data Encryption Standard DES became a standard in 1973. It was developed at IBM and is a modification of an earlier cipher called Lucifer. It is a special type of cipher known as the Feistel cipher. 3.1 Description of a Feistel cipher – At each state ui divide the text into two halves of equal length, denoted as Li,Ri. – The round function g performs the following transformations − Li = Ri 1 (12) − − Ri = Li 1 ⊕ f(Ri 1, Ki) (13) ¡ ¢ £ ¡ ¢ £ ¤ ¥ §¡ ¦ ¡ ¤ ¡ Fig. 2. One round of a Feistel Cipher. Question: Does the function f need to be injective? Handout # 6 7 ¨ © Fig. 3. The algorithm for the generation of the Key schedule in DES. Source: Wikipedia. 3.2 Description of DES DES is a 16-round Feistel cipher, with a block length of 64 bits. The key used is a 56-bit long key from which a key schedule of 16 48-bit keys are derived. To generate a DES cipher the following steps are followed. The algorithm for the derivation of the key schedule is shown on figure 3 1. Apply an initial permutation IP on the plaintext and generate IP (x) = L0R0. 2. Take the right half of the current state as an input to function f along with subkey Ki. 3. Perform an ⊕ operation between the left half of the current state and the ouput of function f and set the result as the right half of the next state. 4. Set the right half of the current state as the left half of the next state. 5. Repeat steps 1-3 for 16 rounds. 6. Perform the reverse permutation IP −1 on the output of the 16th state. The construction of the f function is critical. It basically follows the principle of an SPN network with consecutive, XOR, substitution and permutation operations. The structure of function f is depicted in figure 4. 1. Expand the input to a bitstring of length 48 according to a fixed expansion function E. Expansion function is a permutation with 16 bits appearing twice. 8 ECE 596C: Cryptography for Secure Communications with Applications to Network Security Fig. 4. The f function of the DES cipher. Source: Wikipedia. 2. XOR the expanded bitstring with the subkey. 3. Break the bitstring to 8 blocks of 6 bits each 4. Pass each block through an S-box that takes as an input 6 bits and gives an output of 4 bits 5. Permute the entire bitstring. The S-box calculation There are 8 S-boxes that are 4 × 16 look up tables. Assume that the input to the S-box is B = b1b2b3b4b5b6. 1. The bits b1b6 define the row r of the S-box. 2. The bits b2b3b4b5 define the column c of the S-box. 3. The number S(r, c) is represented using four bits and becomes the output of the S-box. Handout # 6 9 Fig. 5. The first S-box for the DES cipher..
Load more

Recommended publications
  • Chapter 3 – Block Ciphers and the Data Encryption Standard
    Chapter 3 –Block Ciphers and the Data Cryptography and Network Encryption Standard Security All the afternoon Mungo had been working on Stern's Chapter 3 code, principally with the aid of the latest messages which he had copied down at the Nevin Square drop. Stern was very confident. He must be well aware London Central knew about that drop. It was obvious Fifth Edition that they didn't care how often Mungo read their messages, so confident were they in the by William Stallings impenetrability of the code. —Talking to Strange Men, Ruth Rendell Lecture slides by Lawrie Brown Modern Block Ciphers Block vs Stream Ciphers now look at modern block ciphers • block ciphers process messages in blocks, each one of the most widely used types of of which is then en/decrypted cryptographic algorithms • like a substitution on very big characters provide secrecy /hii/authentication services – 64‐bits or more focus on DES (Data Encryption Standard) • stream ciphers process messages a bit or byte at a time when en/decrypting to illustrate block cipher design principles • many current ciphers are block ciphers – better analysed – broader range of applications Block vs Stream Ciphers Block Cipher Principles • most symmetric block ciphers are based on a Feistel Cipher Structure • needed since must be able to decrypt ciphertext to recover messages efficiently • bloc k cihiphers lklook like an extremely large substitution • would need table of 264 entries for a 64‐bit block • instead create from smaller building blocks • using idea of a product cipher 1 Claude
    [Show full text]
  • Chapter 3 – Block Ciphers and the Data Encryption Standard
    Symmetric Cryptography Chapter 6 Block vs Stream Ciphers • Block ciphers process messages into blocks, each of which is then en/decrypted – Like a substitution on very big characters • 64-bits or more • Stream ciphers process messages a bit or byte at a time when en/decrypting – Many current ciphers are block ciphers • Better analyzed. • Broader range of applications. Block vs Stream Ciphers Block Cipher Principles • Block ciphers look like an extremely large substitution • Would need table of 264 entries for a 64-bit block • Arbitrary reversible substitution cipher for a large block size is not practical – 64-bit general substitution block cipher, key size 264! • Most symmetric block ciphers are based on a Feistel Cipher Structure • Needed since must be able to decrypt ciphertext to recover messages efficiently Ideal Block Cipher Substitution-Permutation Ciphers • in 1949 Shannon introduced idea of substitution- permutation (S-P) networks – modern substitution-transposition product cipher • These form the basis of modern block ciphers • S-P networks are based on the two primitive cryptographic operations we have seen before: – substitution (S-box) – permutation (P-box) (transposition) • Provide confusion and diffusion of message Diffusion and Confusion • Introduced by Claude Shannon to thwart cryptanalysis based on statistical analysis – Assume the attacker has some knowledge of the statistical characteristics of the plaintext • Cipher needs to completely obscure statistical properties of original message • A one-time pad does this Diffusion
    [Show full text]
  • A Tutorial on the Implementation of Block Ciphers: Software and Hardware Applications
    A Tutorial on the Implementation of Block Ciphers: Software and Hardware Applications Howard M. Heys Memorial University of Newfoundland, St. John's, Canada email: [email protected] Dec. 10, 2020 2 Abstract In this article, we discuss basic strategies that can be used to implement block ciphers in both software and hardware environments. As models for discussion, we use substitution- permutation networks which form the basis for many practical block cipher structures. For software implementation, we discuss approaches such as table lookups and bit-slicing, while for hardware implementation, we examine a broad range of architectures from high speed structures like pipelining, to compact structures based on serialization. To illustrate different implementation concepts, we present example data associated with specific methods and discuss sample designs that can be employed to realize different implementation strategies. We expect that the article will be of particular interest to researchers, scientists, and engineers that are new to the field of cryptographic implementation. 3 4 Terminology and Notation Abbreviation Definition SPN substitution-permutation network IoT Internet of Things AES Advanced Encryption Standard ECB electronic codebook mode CBC cipher block chaining mode CTR counter mode CMOS complementary metal-oxide semiconductor ASIC application-specific integrated circuit FPGA field-programmable gate array Table 1: Abbreviations Used in Article 5 6 Variable Definition B plaintext/ciphertext block size (also, size of cipher state) κ number
    [Show full text]
  • Symmetric Key Ciphers Objectives
    Symmetric Key Ciphers Debdeep Mukhopadhyay Assistant Professor Department of Computer Science and Engineering Indian Institute of Technology Kharagpur INDIA -721302 Objectives • Definition of Symmetric Types of Symmetric Key ciphers – Modern Block Ciphers • Full Size and Partial Size Key Ciphers • Components of a Modern Block Cipher – PBox (Permutation Box) – SBox (Substitution Box) –Swap – Properties of the Exclusive OR operation • Diffusion and Confusion • Types of Block Ciphers: Feistel and non-Feistel ciphers D. Mukhopadhyay Crypto & Network Security IIT Kharagpur 1 Symmetric Key Setting Communication Message Channel Message E D Ka Kb Bob Alice Assumptions Eve Ka is the encryption key, Kb is the decryption key. For symmetric key ciphers, Ka=Kb - Only Alice and Bob knows Ka (or Kb) - Eve has access to E, D and the Communication Channel but does not know the key Ka (or Kb) Types of symmetric key ciphers • Block Ciphers: Symmetric key ciphers, where a block of data is encrypted • Stream Ciphers: Symmetric key ciphers, where block size=1 D. Mukhopadhyay Crypto & Network Security IIT Kharagpur 2 Block Ciphers Block Cipher • A symmetric key modern cipher encrypts an n bit block of plaintext or decrypts an n bit block of ciphertext. •Padding: – If the message has fewer than n bits, padding must be done to make it n bits. – If the message size is not a multiple of n, then it should be divided into n bit blocks and the last block should be padded. D. Mukhopadhyay Crypto & Network Security IIT Kharagpur 3 Full Size Key Ciphers • Transposition Ciphers: – Involves rearrangement of bits, without changing value. – Consider an n bit cipher – How many such rearrangements are possible? •n! – How many key bits are necessary? • ceil[log2 (n!)] Full Size Key Ciphers • Substitution Ciphers: – It does not transpose bits, but substitutes values – Can we model this as a permutation? – Yes.
    [Show full text]
  • Network Security Chapter 8
    Network Security Chapter 8 Network security problems can be divided roughly into 4 closely intertwined areas: secrecy (confidentiality), authentication, nonrepudiation, and integrity control. Question: what does non-repudiation mean? What does “integrity” mean? • Cryptography • Symmetric-Key Algorithms • Public-Key Algorithms • Digital Signatures • Management of Public Keys • Communication Security • Authentication Protocols • Email Security -- skip • Web Security • Social Issues -- skip Revised: August 2011 CN5E by Tanenbaum & Wetherall, © Pearson Education-Prentice Hall and D. Wetherall, 2011 Network Security Security concerns a variety of threats and defenses across all layers Application Authentication, Authorization, and non-repudiation Transport End-to-end encryption Network Firewalls, IP Security Link Packets can be encrypted on data link layer basis Physical Wireless transmissions can be encrypted CN5E by Tanenbaum & Wetherall, © Pearson Education-Prentice Hall and D. Wetherall, 2011 Network Security (1) Some different adversaries and security threats • Different threats require different defenses CN5E by Tanenbaum & Wetherall, © Pearson Education-Prentice Hall and D. Wetherall, 2011 Cryptography Cryptography – 2 Greek words meaning “Secret Writing” Vocabulary: • Cipher – character-for-character or bit-by-bit transformation • Code – replaces one word with another word or symbol Cryptography is a fundamental building block for security mechanisms. • Introduction » • Substitution ciphers » • Transposition ciphers » • One-time pads
    [Show full text]
  • Outline Block Ciphers
    Block Ciphers: DES, AES Guevara Noubir http://www.ccs.neu.edu/home/noubir/Courses/CSG252/F04 Textbook: —Cryptography: Theory and Applications“, Douglas Stinson, Chapman & Hall/CRC Press, 2002 Reading: Chapter 3 Outline n Substitution-Permutation Networks n Linear Cryptanalysis n Differential Cryptanalysis n DES n AES n Modes of Operation CSG252 Classical Cryptography 2 Block Ciphers n Typical design approach: n Product cipher: substitutions and permutations n Leading to a non-idempotent cipher n Iteration: n Nr: number of rounds → 1 2 Nr n Key schedule: k k , k , …, k , n Subkeys derived according to publicly known algorithm i n w : state n Round function r r-1 r n w = g(w , k ) 0 n w : plaintext x n Required property of g: ? n Encryption and Decryption sequence CSG252 Classical Cryptography 3 1 SPN: Substitution Permutation Networks n SPN: special type of iterated cipher (w/ small change) n Block length: l x m n x = x(1) || x(2) || … || x(m) n x(i) = (x(i-1)l+1, …, xil) n Components: π l → l n Substitution cipher s: {0, 1} {0, 1} π → n Permutation cipher (S-box) P: {1, …, lm} {1, …, lm} n Outline: n Iterate Nr times: m substitutions; 1 permutation; ⊕ sub-key; n Definition of SPN cryptosytems: n P = ?; C = ?; K ⊆ ?; n Algorithm: n Designed to allow decryption using the same algorithm n What are the parameters of the decryption algorithm? CSG252 Classical Cryptography 4 SPN: Example n l = m = 4; Nr = 4; n Key schedule: n k: (k1, …, k32) 32 bits r n k : (k4r-3, …, k4r+12) z 0 1 2 3 4 5 6 7 8 9 A B C D E F π S(z) E 4 D 1 2 F B 8 3 A 6 C
    [Show full text]
  • Symmetric Key Cryptosystems Definition
    Symmetric Key Cryptosystems Debdeep Mukhopadhyay IIT Kharagpur Definition • Alice and Bob has the same key to encrypt as well as to decrypt • The key is shared via a “secured channel” • Symmetric Ciphers are of two types: – Block : The plaintext is encrypted in blocks – Stream: The block length is 1 • Symmetric Ciphers are used for bulk encryption, as they have better performance than their asymmetric counter-part. 1 Block Ciphers What we have learnt from history? • Observation: If we have a cipher C1=(P,P,K1,e1,d1) and a cipher C2 (P,P,K2,e2,d2). • We define the product cipher as C1xC2 by the process of first applying C1 and then C2 • Thus C1xC2=(P,P,K1xK2,e,d) • Any key is of the form: (k1,k2) and e=e2(e1(x,k1),k2). Likewise d is defined. Note that the product rule is always associative 2 Question: • Thus if we compute product of ciphers, does the cipher become stronger? – The key space become larger –2nd Thought: Does it really become larger. • Let us consider the product of a 1. multiplicative cipher (M): y=ax, where a is co-prime to 26 //Plain Texts are characters 2. shift cipher (S) : y=x + k Is MxS=SxM? • MxS: y=ax+k : key=(a,k). This is an affine cipher, as total size of key space is 312. • SxM: y=a(x+k)=ax+ak – Now, since gcd(a,26)=1, this is also an affine cipher. – key = (a,ak) – As gcd(a,26)=1, a-1 exists. There is a one-one relation between ak and k.
    [Show full text]
  • 15-853:Algorithms in the Real World Cryptography Outline Cryptography
    Cryptography Outline Introduction: terminology, cryptanalysis, security 15-853:Algorithms in the Real World Primitives: one-way functions, trapdoors, … Protocols: digital signatures, key exchange, .. Cryptography 1 and 2 Number Theory: groups, fields, … Private-Key Algorithms: Rijndael, DES Public-Key Algorithms: Knapsack, RSA, El-Gamal, … Case Studies: Kerberos, SSL 15-853 Page 1 15-853 Page 2 Cryptography Outline Enigma Machine Introduction: "It was thanks to Ultra – terminology that we won the war.” – cryptanalytic attacks - Winston Churchill – security Primitives: one-way functions, trapdoors, … Protocols: digital signatures, key exchange, .. Number Theory: groups, fields, … Private-Key Algorithms: Rijndael, DES Public-Key Algorithms: Knapsack, RSA, El-Gamal, … Case Studies: Kerberos, SSL 15-853 Page 3 15-853 Page 4 1 Some Terminology More Definitions Plaintext Cryptography – the general term Cryptology – the mathematics Key1 Encryption Ek(M) = C Encryption – encoding but sometimes used as general term) Cyphertext Cryptanalysis – breaking codes Key2 Decryption Dk(C) = M Steganography – hiding message Cipher – a method or algorithm for encrypting or Original Plaintext decrypting Private Key or Symmetric: Key1 = Key2 Public Key or Asymmetric: Key1 ≠ Key2 Key1 or Key2 is public depending on the protocol 15-853 Page 5 15-853 Page 6 Cryptanalytic Attacks What does it mean to be secure? C = ciphertext messages Unconditionally Secure: Encrypted message cannot M = plaintext messages be decoded without the key Shannon showed in 1943 that key must be as long as the message to be unconditionally secure – this is Ciphertext Only:Attacker has multiple Cs but does based on information theory not know the corresponding Ms A one time pad – xor a random key with a message Known Plaintext: Attacker knows some number of (Used in 2nd world war) (C,M) pairs.
    [Show full text]
  • Data Encryption Standard (DES)
    6 Data Encryption Standard (DES) Objectives In this chapter, we discuss the Data Encryption Standard (DES), the modern symmetric-key block cipher. The following are our main objectives for this chapter: + To review a short history of DES + To defi ne the basic structure of DES + To describe the details of building elements of DES + To describe the round keys generation process + To analyze DES he emphasis is on how DES uses a Feistel cipher to achieve confusion and diffusion of bits from the Tplaintext to the ciphertext. 6.1 INTRODUCTION The Data Encryption Standard (DES) is a symmetric-key block cipher published by the National Institute of Standards and Technology (NIST). 6.1.1 History In 1973, NIST published a request for proposals for a national symmetric-key cryptosystem. A proposal from IBM, a modifi cation of a project called Lucifer, was accepted as DES. DES was published in the Federal Register in March 1975 as a draft of the Federal Information Processing Standard (FIPS). After the publication, the draft was criticized severely for two reasons. First, critics questioned the small key length (only 56 bits), which could make the cipher vulnerable to brute-force attack. Second, critics were concerned about some hidden design behind the internal structure of DES. They were suspicious that some part of the structure (the S-boxes) may have some hidden trapdoor that would allow the National Security Agency (NSA) to decrypt the messages without the need for the key. Later IBM designers mentioned that the internal structure was designed to prevent differential cryptanalysis.
    [Show full text]
  • Algorithms and Mechanisms Historical Ciphers
    Algorithms and Mechanisms Cryptography is nothing more than a mathematical framework for discussing the implications of various paranoid delusions — Don Alvarez Historical Ciphers Non-standard hieroglyphics, 1900BC Atbash cipher (Old Testament, reversed Hebrew alphabet, 600BC) Caesar cipher: letter = letter + 3 ‘fish’ ‘ilvk’ rot13: Add 13/swap alphabet halves •Usenet convention used to hide possibly offensive jokes •Applying it twice restores the original text Substitution Ciphers Simple substitution cipher: a=p,b=m,c=f,... •Break via letter frequency analysis Polyalphabetic substitution cipher 1. a = p, b = m, c = f, ... 2. a = l, b = t, c = a, ... 3. a = f, b = x, c = p, ... •Break by decomposing into individual alphabets, then solve as simple substitution One-time Pad (1917) Message s e c r e t 18 5 3 17 5 19 OTP +15 8 1 12 19 5 7 13 4 3 24 24 g m d c x x OTP is unbreakable provided •Pad is never reused (VENONA) •Unpredictable random numbers are used (physical sources, e.g. radioactive decay) One-time Pad (ctd) Used by •Russian spies •The Washington-Moscow “hot line” •CIA covert operations Many snake oil algorithms claim unbreakability by claiming to be a OTP •Pseudo-OTPs give pseudo-security Cipher machines attempted to create approximations to OTPs, first mechanically, then electronically Cipher Machines (~1920) 1. Basic component = wired rotor •Simple substitution 2. Step the rotor after each letter •Polyalphabetic substitution, period = 26 Cipher Machines (ctd) 3. Chain multiple rotors Each rotor steps the next one when a full
    [Show full text]
  • Cryptographic Analysis of All 4 × 4-Bit S-Boxes
    Cryptographic Analysis of All 4 × 4-Bit S-Boxes Markku-Juhani O. Saarinen REVERE SECURITY 4500 Westgrove Drive, Suite 335, Addison, TX 75001, USA. [email protected] Abstract. We present cryptanalytic results of an exhaustive search of all 16! bijective 4-bit S-Boxes. Previously affine equivalence classes have been exhaus- tively analyzed in 2007 work by Leander and Poschmann. We extend on this work by giving further properties of the optimal S-Box linear equivalence classes. In our main analysis we consider two S-Boxes to be cryptanalytically equivalent if they are isomorphic up to the permutation of input and output bits and a XOR of a constant in the input and output. We have enumerated all such equivalence classes with respect to their differential and linear properties. These equivalence classes are equivalent not only in their differential and linear bounds but also have equiv- alent algebraic properties, branch number and circuit complexity. We describe a “golden” set of S-boxes that have ideal cryptographic properties. We also present a comparison table of S-Boxes from a dozen published cryptographic algorithms. Keywords: S-Box, Differential cryptanalysis, Linear cryptanalysis, Exhaustive permutation search. 1 Introduction Horst Feistel introduced the Lucifer cipher, which can be considered to be the first modern block cipher, some 40 years ago. Feistel followed closely the prin- ciples outlined by Claude Shannon in 1949 [36] when designing Lucifer. We quote from Feistel’s 1971 patent text [20]: Shannon, in his paper, presents further developments in the art of cryp- tography by introducing the product cipher. That is, the successive ap- plication of two or more distinctly different kinds of message symbol transformations.
    [Show full text]
  • A Brief Outlook at Block Ciphers
    A Brief Outlook at Block Ciphers Pascal Junod Ecole¶ Polytechnique F¶ed¶eralede Lausanne, Suisse CSA'03, Rabat, Maroc, 10-09-2003 Content F Generic Concepts F DES / AES F Cryptanalysis of Block Ciphers F Provable Security CSA'03, 10 septembre 2003, Rabat, Maroc { i { Block Cipher P e d P C K K CSA'03, 10 septembre 2003, Rabat, Maroc { ii { Block Cipher (2) F Deterministic, invertible function: e : {0, 1}n × K → {0, 1}n d : {0, 1}n × K → {0, 1}n F The function is parametered by a key K. F Mapping an n-bit plaintext P to an n-bit ciphertext C: C = eK(P ) F The function must be a bijection for a ¯xed key. CSA'03, 10 septembre 2003, Rabat, Maroc { iii { Product Ciphers and Iterated Block Ciphers F A product cipher combines two or more transformations in a manner intending that the resulting cipher is (hopefully) more secure than the individual components. F An iterated block cipher is a block cipher involving the sequential repeti- tion of an internal function f called a round function. Parameters include the number of rounds r, the block bit size n and the bit size k of the input key K from which r subkeys ki (called round keys) are derived. For invertibility purposes, the round function f is a bijection on the round input for each value ki. CSA'03, 10 septembre 2003, Rabat, Maroc { iv { Product Ciphers and Iterated Block Ciphers (2) P K f k1 f k2 f kr C CSA'03, 10 septembre 2003, Rabat, Maroc { v { Good and Bad Block Ciphers F Flexibility F Throughput F Estimated Security Level CSA'03, 10 septembre 2003, Rabat, Maroc { vi { Data Encryption Standard (DES) F American standard from (1976 - 1998).
    [Show full text]