{"product_id":"symmetric-cryptography-volume-1-design-and-security-proofs-hardback-9781789451467","title":"Symmetric Cryptography, Volume 1; Design and Security Proofs (Hardback) 9781789451467","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eSymmetric Cryptography, Volume 1\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eDesign and Security Proofs\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eChristina Boura (Edited by), Maria Naya-Plasencia (Edited by)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781789451467, Wiley\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 13 December 2023\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e272 pages\u003cbr\u003e23.5 x 15.6 x 1.8 cm, 0.662 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003e\u003cp\u003eSymmetric cryptology is one of the two main branches of cryptology. Its applications are essential and vital in the Information Age, due to the efficiency of its constructions.\u003c\/p\u003e \u003cp\u003eThe scope of this book in two volumes is two-fold. First, it presents the most important ideas that have been used in the design of symmetric primitives, their inner components and their most relevant constructions. Second, it describes and provides insights on the most popular cryptanalysis and proof techniques for analyzing the security of the above algorithms. A selected number of future directions, such as post-quantum security or design of ciphers for modern needs and particular applications, are also discussed.\u003c\/p\u003e \u003cp\u003eWe believe that the two volumes of this work will be of interest to researchers, to master’s and PhD students studying or working in the field of cryptography, as well as to all professionals working in the field of cybersecurity.\u003c\/p\u003e\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e\u003cp\u003ePreface xi\u003cbr\u003e\u003ci\u003eChristina BOURA and María NAYA-PLASENCIA\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart 1 Design of Symmetric-key Algorithms 1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 1 Introduction to Design in Symmetric Cryptography 3\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eJoan DAEMEN\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e1.1 Introduction 3\u003c\/p\u003e \u003cp\u003e1.2 Cryptographic building blocks 3\u003c\/p\u003e \u003cp\u003e1.2.1 The block cipher and its variants 4\u003c\/p\u003e \u003cp\u003e1.3 Differentially uniform functions 5\u003c\/p\u003e \u003cp\u003e1.4 Arbitrary-length schemes 5\u003c\/p\u003e \u003cp\u003e1.4.1 Modes and constructions 6\u003c\/p\u003e \u003cp\u003e1.4.2 Dedicated schemes 7\u003c\/p\u003e \u003cp\u003e1.4.3 Modes and constructions versus primitives 7\u003c\/p\u003e \u003cp\u003e1.5 Iterated (tweakable) block ciphers and permutations 8\u003c\/p\u003e \u003cp\u003e1.5.1 Cryptanalysis and safety margin 8\u003c\/p\u003e \u003cp\u003e1.5.2 Designing the round function of primitives 9\u003c\/p\u003e \u003cp\u003e1.6 A short history 10\u003c\/p\u003e \u003cp\u003e1.6.1 The data encryption standard 10\u003c\/p\u003e \u003cp\u003e1.6.2 The block cipher FEAL 11\u003c\/p\u003e \u003cp\u003e1.6.3 Differential and linear cryptanalysis 11\u003c\/p\u003e \u003cp\u003e1.6.4 The block cipher IDEA 12\u003c\/p\u003e \u003cp\u003e1.6.5 The advanced encryption standard 12\u003c\/p\u003e \u003cp\u003e1.6.6 Cache attacks 13\u003c\/p\u003e \u003cp\u003e1.6.7 KECCAK 14\u003c\/p\u003e \u003cp\u003e1.6.8 Lightweight cryptography 15\u003c\/p\u003e \u003cp\u003e1.7 Acknowledgments 15\u003c\/p\u003e \u003cp\u003e1.8 References 15\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 2 The Design of Stream Ciphers 21\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eChaoyun LI and Bart PRENEEL\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e2.1 Introduction 21\u003c\/p\u003e \u003cp\u003e2.1.1 What is a synchronous additive stream cipher? 21\u003c\/p\u003e \u003cp\u003e2.1.2 Generic construction 23\u003c\/p\u003e \u003cp\u003e2.1.3 Generic attacks 24\u003c\/p\u003e \u003cp\u003e2.1.4 Open competitions 25\u003c\/p\u003e \u003cp\u003e2.1.5 Standards 26\u003c\/p\u003e \u003cp\u003e2.2 Constructions based on FSRs 27\u003c\/p\u003e \u003cp\u003e2.2.1 LFSR-based constructions 27\u003c\/p\u003e \u003cp\u003e2.2.2 NFSR-based constructions 28\u003c\/p\u003e \u003cp\u003e2.3 Table-based constructions 29\u003c\/p\u003e \u003cp\u003e2.4 Block ciphers and permutations in stream cipher mode 29\u003c\/p\u003e \u003cp\u003e2.4.1 Block cipher modes OFB and CTR 30\u003c\/p\u003e \u003cp\u003e2.4.2 Permutations in stream cipher mode 30\u003c\/p\u003e \u003cp\u003e2.5 Authenticated encryption (AE) 31\u003c\/p\u003e \u003cp\u003e2.5.1 Block ciphers and permutations in stream cipher modes 32\u003c\/p\u003e \u003cp\u003e2.6 Emerging low-complexity stream ciphers 33\u003c\/p\u003e \u003cp\u003e2.7 References 34\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 3 Block Ciphers 39\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eOrr DUNKELMAN\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e3.1 General purpose block ciphers 41\u003c\/p\u003e \u003cp\u003e3.1.1 Feistel block ciphers 42\u003c\/p\u003e \u003cp\u003e3.1.2 Substitution permutation networks 43\u003c\/p\u003e \u003cp\u003e3.2 Key schedule algorithms 44\u003c\/p\u003e \u003cp\u003e3.3 Generic attacks 46\u003c\/p\u003e \u003cp\u003e3.4 Tweakable block ciphers 48\u003c\/p\u003e \u003cp\u003e3.5 Some positive results concerning security 49\u003c\/p\u003e \u003cp\u003e3.6 The case of algebraic ciphers 51\u003c\/p\u003e \u003cp\u003e3.7 References 53\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 4 Hash Functions 55\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eGilles VAN ASSCHE\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e4.1 Definitions and requirements 55\u003c\/p\u003e \u003cp\u003e4.1.1 An ideal model: the random oracle 57\u003c\/p\u003e \u003cp\u003e4.1.2 Expressing security claims 58\u003c\/p\u003e \u003cp\u003e4.2 Design of hash functions 60\u003c\/p\u003e \u003cp\u003e4.2.1 The Merkle-Damgård construction 60\u003c\/p\u003e \u003cp\u003e4.2.2 Fixing the Merkle-Damgård construction 61\u003c\/p\u003e \u003cp\u003e4.2.3 Building a compression function 62\u003c\/p\u003e \u003cp\u003e4.2.4 Indifferentiability 64\u003c\/p\u003e \u003cp\u003e4.2.5 The sponge construction 65\u003c\/p\u003e \u003cp\u003e4.2.6 KECCAK, SHA-3 and beyond 67\u003c\/p\u003e \u003cp\u003e4.3 Tree hashing 68\u003c\/p\u003e \u003cp\u003e4.4 References 69\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 5 Modes of Operation 73\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eGaëtan LEURENT\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e5.1 Encryption schemes 73\u003c\/p\u003e \u003cp\u003e5.1.1 Cipher block chaining 74\u003c\/p\u003e \u003cp\u003e5.1.2 Counter mode 75\u003c\/p\u003e \u003cp\u003e5.2 Message authentication codes 75\u003c\/p\u003e \u003cp\u003e5.2.1 CBC-MAC 76\u003c\/p\u003e \u003cp\u003e5.2.2 PMAC 77\u003c\/p\u003e \u003cp\u003e5.2.3 Hash-based MACs 77\u003c\/p\u003e \u003cp\u003e5.2.4 Wegman-Carter MACs and GMAC 78\u003c\/p\u003e \u003cp\u003e5.3 Security of modes: generic attacks 78\u003c\/p\u003e \u003cp\u003e5.3.1 The birthday bound 79\u003c\/p\u003e \u003cp\u003e5.3.2 Generic attack against iterated MACs 79\u003c\/p\u003e \u003cp\u003e5.3.3 Generic attack against Wegman-Carter MACs 80\u003c\/p\u003e \u003cp\u003e5.3.4 Generic attack against CBC 80\u003c\/p\u003e \u003cp\u003e5.3.5 Generic attack against CTR 80\u003c\/p\u003e \u003cp\u003e5.3.6 Small block sizes 81\u003c\/p\u003e \u003cp\u003e5.3.7 Misuse 81\u003c\/p\u003e \u003cp\u003e5.3.8 Limitations of encryption 82\u003c\/p\u003e \u003cp\u003e5.4 References 83\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 6 Authenticated Encryption Schemes 87\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eMaria EICHLSEDER\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e6.1 Introduction 87\u003c\/p\u003e \u003cp\u003e6.2 Security notions 88\u003c\/p\u003e \u003cp\u003e6.3 Design strategies for authenticated encryption 89\u003c\/p\u003e \u003cp\u003e6.3.1 Generic composition 91\u003c\/p\u003e \u003cp\u003e6.3.2 Dedicated primitive-based designs 92\u003c\/p\u003e \u003cp\u003e6.3.3 Fully dedicated designs 94\u003c\/p\u003e \u003cp\u003e6.3.4 Standards and competitions 95\u003c\/p\u003e \u003cp\u003e6.4 References 96\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 7 MDS Matrices 99\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eGaëtan LEURENT\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e7.1 Definition 99\u003c\/p\u003e \u003cp\u003e7.1.1 Differential and linear properties 100\u003c\/p\u003e \u003cp\u003e7.1.2 Near-MDS matrices 101\u003c\/p\u003e \u003cp\u003e7.2 Constructions 101\u003c\/p\u003e \u003cp\u003e7.3 Implementation cost 102\u003c\/p\u003e \u003cp\u003e7.3.1 Optimizing the implementation of a matrix 103\u003c\/p\u003e \u003cp\u003e7.3.2 Implementation of the inverse matrix 104\u003c\/p\u003e \u003cp\u003e7.4 Construction of lightweight MDS matrices 104\u003c\/p\u003e \u003cp\u003e7.4.1 Choice of the field or ring 105\u003c\/p\u003e \u003cp\u003e7.4.2 MDS matrices with the lowest XOR count 105\u003c\/p\u003e \u003cp\u003e7.4.3 Iterative MDS matrices 106\u003c\/p\u003e \u003cp\u003e7.4.4 Involutory MDS matrices 107\u003c\/p\u003e \u003cp\u003e7.5 References 108\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 8 S-boxes 111\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eChristina BOURA\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e8.1 Important design criteria 113\u003c\/p\u003e \u003cp\u003e8.1.1 Differential properties 113\u003c\/p\u003e \u003cp\u003e8.1.2 Linear properties 115\u003c\/p\u003e \u003cp\u003e8.1.3 Algebraic properties 116\u003c\/p\u003e \u003cp\u003e8.1.4 Other properties 117\u003c\/p\u003e \u003cp\u003e8.2 Popular S-boxes for different dimensions 117\u003c\/p\u003e \u003cp\u003e8.2.1 S-boxes with an odd number of variables 118\u003c\/p\u003e \u003cp\u003e8.2.2 4-bit S-boxes 118\u003c\/p\u003e \u003cp\u003e8.2.3 8-bit S-boxes 119\u003c\/p\u003e \u003cp\u003e8.3 Further reading 119\u003c\/p\u003e \u003cp\u003e8.4 References 119\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 9 Rationale, Backdoors and Trust 123\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eLéo PERRIN\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e9.1 Lifecycle of a cryptographic primitive 124\u003c\/p\u003e \u003cp\u003e9.1.1 Design phase 124\u003c\/p\u003e \u003cp\u003e9.1.2 Public cryptanalysis 125\u003c\/p\u003e \u003cp\u003e9.1.3 Deployment? 125\u003c\/p\u003e \u003cp\u003e9.1.4 The limits of this process 126\u003c\/p\u003e \u003cp\u003e9.2 When a selection process fails 126\u003c\/p\u003e \u003cp\u003e9.2.1 Under-engineered algorithms 127\u003c\/p\u003e \u003cp\u003e9.2.2 Primitives with hidden properties 128\u003c\/p\u003e \u003cp\u003e9.3 Can we trust modern algorithms? 131\u003c\/p\u003e \u003cp\u003e9.3.1 Standardization and normalization 131\u003c\/p\u003e \u003cp\u003e9.3.2 Some rules of thumb 132\u003c\/p\u003e \u003cp\u003e9.4 References 133\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart 2 Security Proofs for Symmetric-key Algorithms 135\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 10 Modeling Security 137\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eBart MENNINK\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e10.1 Different types of adversary models 137\u003c\/p\u003e \u003cp\u003e10.2 When is an attack considered successful? 138\u003c\/p\u003e \u003cp\u003e10.3 Random oracle 138\u003c\/p\u003e \u003cp\u003e10.4 Distinguishing advantage 139\u003c\/p\u003e \u003cp\u003e10.5 Understanding the distinguishing advantage 141\u003c\/p\u003e \u003cp\u003e10.5.1 Adversarial complexity 141\u003c\/p\u003e \u003cp\u003e10.5.2 Claiming security 142\u003c\/p\u003e \u003cp\u003e10.5.3 Breaking claims 143\u003c\/p\u003e \u003cp\u003e10.6 Adaptation to block ciphers 143\u003c\/p\u003e \u003cp\u003e10.6.1 Distinguishing advantage 144\u003c\/p\u003e \u003cp\u003e10.6.2 Security of AES 145\u003c\/p\u003e \u003cp\u003e10.7 Acknowledgments 146\u003c\/p\u003e \u003cp\u003e10.8 References 146\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 11 Encryption and Security of Counter Mode 147\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eBart MENNINK\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e11.1 Block encryption 147\u003c\/p\u003e \u003cp\u003e11.1.1 Padding 148\u003c\/p\u003e \u003cp\u003e11.1.2 Cipher block chaining 149\u003c\/p\u003e \u003cp\u003e11.2 Stream encryption 150\u003c\/p\u003e \u003cp\u003e11.2.1 Output feedback mode 151\u003c\/p\u003e \u003cp\u003e11.2.2 Counter mode 152\u003c\/p\u003e \u003cp\u003e11.3 Provable security of modes: the case of counter mode 153\u003c\/p\u003e \u003cp\u003e11.4 Acknowledgments 156\u003c\/p\u003e \u003cp\u003e11.5 References 156\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 12 Message Authentication and Authenticated Encryption 159\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eTetsu IWATA\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e12.1 Message authentication 159\u003c\/p\u003e \u003cp\u003e12.1.1 WCS construction 160\u003c\/p\u003e \u003cp\u003e12.1.2 Provable security 161\u003c\/p\u003e \u003cp\u003e12.2 Authenticated encryption 164\u003c\/p\u003e \u003cp\u003e12.2.1 GCM, Galois\/counter mode 164\u003c\/p\u003e \u003cp\u003e12.2.2 Provable security 166\u003c\/p\u003e \u003cp\u003e12.3 References 169\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 13 H-coefficients Technique 171\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eYannick SEURIN\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e13.1 The H-Coefficients technique 171\u003c\/p\u003e \u003cp\u003e13.2 A worked out example: the three-round Feistel construction 176\u003c\/p\u003e \u003cp\u003e13.3 The Even-Mansour construction 178\u003c\/p\u003e \u003cp\u003e13.3.1 H-coefficients security proof 179\u003c\/p\u003e \u003cp\u003e13.3.2 Extension to multiple rounds 181\u003c\/p\u003e \u003cp\u003e13.4 References 182\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 14 Chi-square Method 183\u003c\/b\u003e\u003cbr\u003e\u003ci\u003eMridul NANDI\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e14.1 Introduction 183\u003c\/p\u003e \u003cp\u003e14.2 Preliminaries 185\u003c\/p\u003e \u003cp\u003e14.2.1 PRF-security definition 185\u003c\/p\u003e \u003cp\u003e14.2.2 Hypergeometric distribution 186\u003c\/p\u003e \u003cp\u003e14.3 Truncation of random permutation 187\u003c\/p\u003e \u003cp\u003e14.3.1 PRF-security of truncation 188\u003c\/p\u003e \u003cp\u003e14.4 XOR of random permutations 190\u003c\/p\u003e \u003cp\u003e14.5 Other applications of the chi-squared method 192\u003c\/p\u003e \u003cp\u003e14.6 Acknowledgments 193\u003c\/p\u003e \u003cp\u003e14.7 References 193\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart 3 Appendices 195\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003eAppendix 1 Data Encryption Standard (DES) 197\u003cbr\u003e\u003ci\u003eChristina BOURA\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eAppendix 2 Advanced Encryption Standard (AES) 205\u003cbr\u003e\u003ci\u003eChristina BOURA and Orr DUNKELMAN\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eAppendix 3 PRESENT 217\u003cbr\u003e\u003ci\u003eChristina BOURA\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eAppendix 4 KECCAK 223\u003cbr\u003e\u003ci\u003eChristina BOURA\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eList of Authors 231\u003c\/p\u003e \u003cp\u003eIndex 233\u003c\/p\u003e \u003cp\u003eSummary of Volume 2 239\u003c\/p\u003e\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Computer science [\u003ca title=\"See our other books on Computer science\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Computer%20science%20%5BUY%5D%22\"\u003eUY\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Wiley-ISTE","offers":[{"title":"Brand New","offer_id":52509178200344,"sku":"9781789451467","price":104.99,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9781789451467.jpg?v=1786496283","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/symmetric-cryptography-volume-1-design-and-security-proofs-hardback-9781789451467","provider":"Freshly Printed Books","version":"1.0","type":"link"}