{"product_id":"symmetric-cryptography-volume-2-cryptanalysis-and-future-directions-hardback-9781789451474","title":"Symmetric Cryptography, Volume 2; Cryptanalysis and Future Directions (Hardback) 9781789451474","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eSymmetric Cryptography, Volume 2\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eCryptanalysis and Future Directions\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\"\u003e9781789451474, 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.653 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\"\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. \u003cbr\u003e\u003cbr\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. \u003cbr\u003e\u003cbr\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\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e\u003cp\u003ePreface xiii\u003cbr\u003e \u003ci\u003eChristina Boura and María Naya-Plasencia\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart 1 Cryptanalysis of Symmetric-key Algorithms 1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 1 Differential Cryptanalysis 3\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eHenri Gilbert and Jérémy Jean\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e1.1. Statistical attacks on block ciphers: preliminaries 4\u003c\/p\u003e \u003cp\u003e1.2. Principle of differential cryptanalysis and application to DES 7\u003c\/p\u003e \u003cp\u003e1.2.1. Differential transitions and differential characteristics 7\u003c\/p\u003e \u003cp\u003e1.2.2. Derivation of non-trivial differential characteristics 10\u003c\/p\u003e \u003cp\u003e1.2.3. Leveraging characteristics to mount a key-recovery attack 14\u003c\/p\u003e \u003cp\u003e1.3. Some refinements and generalizations 18\u003c\/p\u003e \u003cp\u003e1.3.1. Differential effect 18\u003c\/p\u003e \u003cp\u003e1.3.2. Truncated differentials 19\u003c\/p\u003e \u003cp\u003e1.4. Design strategies and evaluation 20\u003c\/p\u003e \u003cp\u003e1.4.1 Case of the AES 21\u003c\/p\u003e \u003cp\u003e1.4.2. Automated analysis 23\u003c\/p\u003e \u003cp\u003e1.5. Further notes and references 23\u003c\/p\u003e \u003cp\u003e1.6. References 26\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 2 Linear Cryptanalysis 29\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eKaisa Nyberg and Antonio Flórez-Gutiérrez\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e2.1. History 29\u003c\/p\u003e \u003cp\u003e2.2. Correlation and linear hull 30\u003c\/p\u003e \u003cp\u003e2.3. Multidimensional linear approximation 31\u003c\/p\u003e \u003cp\u003e2.4. Walsh-Hadamard transform 32\u003c\/p\u003e \u003cp\u003e2.5. Linear approximation of an iterative block cipher 32\u003c\/p\u003e \u003cp\u003e2.6. Matsui’s Algorithm 1 type of key recovery 33\u003c\/p\u003e \u003cp\u003e2.7. Matsui’s Algorithm 2 type of key recovery 34\u003c\/p\u003e \u003cp\u003e2.8. Searching for linear approximations and estimating correlations 35\u003c\/p\u003e \u003cp\u003e2.9. Speeding up key recovery 36\u003c\/p\u003e \u003cp\u003e2.10. Key-recovery distinguisher 38\u003c\/p\u003e \u003cp\u003e2.11. Classical model of Algorithm 2 39\u003c\/p\u003e \u003cp\u003e2.12. Algorithm 2 with distinct known plaintext and randomized key 40\u003c\/p\u003e \u003cp\u003e2.13. Multiple linear approximations 40\u003c\/p\u003e \u003cp\u003e2.14. Multidimensional linear cryptanalysis 42\u003c\/p\u003e \u003cp\u003e2.15. References 43\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 3 Impossible Differential Cryptanalysis 47\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eChristina Boura and María Naya-Plasencia\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e3.1. Finding impossible differentials 48\u003c\/p\u003e \u003cp\u003e3.2. Key recovery 49\u003c\/p\u003e \u003cp\u003e3.2.1. Data, time and memory complexities 50\u003c\/p\u003e \u003cp\u003e3.3. Some improvements 52\u003c\/p\u003e \u003cp\u003e3.3.1. Early abort technique 52\u003c\/p\u003e \u003cp\u003e3.3.2. Multiple impossible differentials or multiple extension paths 53\u003c\/p\u003e \u003cp\u003e3.4. Applications 54\u003c\/p\u003e \u003cp\u003e3.5. References 54\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 4 Zero-Correlation Cryptanalysis 57\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eVincent Rijmen\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e4.1. Correlation and linear cryptanalysis 57\u003c\/p\u003e \u003cp\u003e4.1.1. Correlation matrix 57\u003c\/p\u003e \u003cp\u003e4.1.2. Linear trails and linear hulls 58\u003c\/p\u003e \u003cp\u003e4.1.3. Approximations of linear functions 59\u003c\/p\u003e \u003cp\u003e4.1.4. Computing the correlations over a permutation 60\u003c\/p\u003e \u003cp\u003e4.2. Attacks using a linear hull with correlation zero 60\u003c\/p\u003e \u003cp\u003e4.2.1. Correlation zero in random permutations 61\u003c\/p\u003e \u003cp\u003e4.2.2. Distinguisher 61\u003c\/p\u003e \u003cp\u003e4.2.3. Reducing the data complexity 62\u003c\/p\u003e \u003cp\u003e4.3. Linear hulls with correlation zero 62\u003c\/p\u003e \u003cp\u003e4.3.1. Feistel ciphers 63\u003c\/p\u003e \u003cp\u003e4.3.2. AES 64\u003c\/p\u003e \u003cp\u003e4.3.3 Extended result on AES 64\u003c\/p\u003e \u003cp\u003e4.4. References 64\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 5 Differential-Linear Cryptanalysis 67\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eYosuke Todo\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e5.1. Brief introduction of differential-linear attacks 67\u003c\/p\u003e \u003cp\u003e5.2. How to estimate correlations of a differential-linear distinguisher 69\u003c\/p\u003e \u003cp\u003e5.3. On the key recovery 71\u003c\/p\u003e \u003cp\u003e5.4. State of the art for differential-linear attacks 72\u003c\/p\u003e \u003cp\u003e5.4.1. Differential-linear connecting table 72\u003c\/p\u003e \u003cp\u003e5.4.2. Three techniques to improve differential-linear attacks 73\u003c\/p\u003e \u003cp\u003e5.5. References 76\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 6 Boomerang Cryptanalysis 77\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eLing Song\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e6.1. Basic boomerang attack 77\u003c\/p\u003e \u003cp\u003e6.2. Variants and refinements 79\u003c\/p\u003e \u003cp\u003e6.3. Tricks and failures 80\u003c\/p\u003e \u003cp\u003e6.4. Formalize the dependency 83\u003c\/p\u003e \u003cp\u003e6.5. References 86\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 7 Meet-in-the-Middle Cryptanalysis 89\u003cbr\u003e \u003c\/b\u003eBrice Minaud\u003c\/p\u003e \u003cp\u003e7.1. Introduction 89\u003c\/p\u003e \u003cp\u003e7.2. Basic meet-in-the-middle framework 90\u003c\/p\u003e \u003cp\u003e7.2.1. The 2DES attack 90\u003c\/p\u003e \u003cp\u003e7.2.2. Algorithmic framework 91\u003c\/p\u003e \u003cp\u003e7.2.3. Complexity analysis and memory usage 92\u003c\/p\u003e \u003cp\u003e7.3. Meet-in-the-middle techniques 94\u003c\/p\u003e \u003cp\u003e7.3.1. Filtering 94\u003c\/p\u003e \u003cp\u003e7.3.2. Splice-and-cut 96\u003c\/p\u003e \u003cp\u003e7.3.3. Bicliques 97\u003c\/p\u003e \u003cp\u003e7.4. Automatic tools 98\u003c\/p\u003e \u003cp\u003e7.5. References 98\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 8 Meet-in-the-Middle Demirci-Selçuk Cryptanalysis 101\u003cbr\u003e \u003c\/b\u003ePatrick Derbez\u003c\/p\u003e \u003cp\u003e8.1. Original Demirci-Selçuk attack 101\u003c\/p\u003e \u003cp\u003e8.2. Improvements 103\u003c\/p\u003e \u003cp\u003e8.2.1. Data\/time\/memory trade-off 104\u003c\/p\u003e \u003cp\u003e8.2.2. Difference instead of value 104\u003c\/p\u003e \u003cp\u003e8.2.3. Multiset 105\u003c\/p\u003e \u003cp\u003e8.2.4. Linear combinations 105\u003c\/p\u003e \u003cp\u003e8.2.5. Differential enumeration technique 106\u003c\/p\u003e \u003cp\u003e8.3. Finding the best attacks 108\u003c\/p\u003e \u003cp\u003e8.3.1. Tools 108\u003c\/p\u003e \u003cp\u003e8.3.2. Results 109\u003c\/p\u003e \u003cp\u003e8.4. References 109\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 9 Invariant Cryptanalysis 111\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eChristof Beierle\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e9.1. Introduction 111\u003c\/p\u003e \u003cp\u003e9.2. Invariants for permutations and block ciphers 112\u003c\/p\u003e \u003cp\u003e9.2.1. Invariant subspaces 113\u003c\/p\u003e \u003cp\u003e9.2.2. Quadratic invariants 117\u003c\/p\u003e \u003cp\u003e9.3. On design criteria to prevent attacks based on invariants 117\u003c\/p\u003e \u003cp\u003e9.4. A link to linear approximations 119\u003c\/p\u003e \u003cp\u003e9.5. References 121\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 10 Higher Order Differentials, Integral Attacks and Variants 123\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eAnne Canteaut\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e10.1. Integrals and higher order derivatives 123\u003c\/p\u003e \u003cp\u003e10.2. Algebraic degree of an iterated function 126\u003c\/p\u003e \u003cp\u003e10.3. Division property 128\u003c\/p\u003e \u003cp\u003e10.4. Attacks based on integrals 130\u003c\/p\u003e \u003cp\u003e10.4.1. Distinguishers 130\u003c\/p\u003e \u003cp\u003e10.4.2. Attacks 130\u003c\/p\u003e \u003cp\u003e10.5. References 131\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 11 Cube Attacks and Distinguishers 133\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eItai Dinur\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e11.1. Cube attacks and cube testers 133\u003c\/p\u003e \u003cp\u003e11.1.1. Terminology 134\u003c\/p\u003e \u003cp\u003e11.1.2. Main observation 135\u003c\/p\u003e \u003cp\u003e11.1.3. The basic cube attack 136\u003c\/p\u003e \u003cp\u003e11.1.4. The preprocessing phase on cube attacks 137\u003c\/p\u003e \u003cp\u003e11.1.5. Cube testers 138\u003c\/p\u003e \u003cp\u003e11.1.6. Applications 139\u003c\/p\u003e \u003cp\u003e11.2. Conditional differential attacks and dynamic cube attacks 140\u003c\/p\u003e \u003cp\u003e11.2.1. Conditional differential attacks 140\u003c\/p\u003e \u003cp\u003e11.2.2. Dynamic cube attacks 140\u003c\/p\u003e \u003cp\u003e11.2.3. A toy example 140\u003c\/p\u003e \u003cp\u003e11.3. References 141\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 12 Correlation Attacks on Stream Ciphers 143\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eThomas Johansson\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e12.1. Correlation attacks on the nonlinear combination generator 144\u003c\/p\u003e \u003cp\u003e12.2. Correlation attacks and decoding linear codes 145\u003c\/p\u003e \u003cp\u003e12.3. Fast correlation attacks 146\u003c\/p\u003e \u003cp\u003e12.3.1. Fast correlation attacks and low weight feedback polynomials 147\u003c\/p\u003e \u003cp\u003e12.3.2. Finding low weight multiples of the feedback polynomial 148\u003c\/p\u003e \u003cp\u003e12.3.3. Fast correlation attacks by reducing the code dimension 150\u003c\/p\u003e \u003cp\u003e12.4. Generalizing fast correlation attacks 151\u003c\/p\u003e \u003cp\u003e12.4.1. The E0 stream cipher 151\u003c\/p\u003e \u003cp\u003e12.4.2. The A5\/1 stream cipher 152\u003c\/p\u003e \u003cp\u003e12.5. References 153\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 13 Addition, Rotation, XOR 155\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eLéo Perrin\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e13.1. What is ARX? 155\u003c\/p\u003e \u003cp\u003e13.1.1. Structure of an ARX-based primitive 156\u003c\/p\u003e \u003cp\u003e13.1.2. Development of ARX 156\u003c\/p\u003e \u003cp\u003e13.2. Understanding modular addition 157\u003c\/p\u003e \u003cp\u003e13.2.1. Expressing modular addition in F\u003csup\u003en\u003c\/sup\u003e\u003csub\u003e2\u003c\/sub\u003e 158\u003c\/p\u003e \u003cp\u003e13.2.2. Cryptographic properties of modular addition 158\u003c\/p\u003e \u003cp\u003e13.3. Analyzing ARX-based primitives 160\u003c\/p\u003e \u003cp\u003e13.3.1. Searching for differential and linear trails 160\u003c\/p\u003e \u003cp\u003e13.3.2. Proving security against differential and linear attacks 161\u003c\/p\u003e \u003cp\u003e13.3.3. Other cryptanalysis techniques 162\u003c\/p\u003e \u003cp\u003e13.4. References 163\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 14 SHA-3 Contest Related Cryptanalysis 167\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eYu S Asaki\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e14.1. Chapter overview 167\u003c\/p\u003e \u003cp\u003e14.2. Differences between attacks against keyed and keyless primitives 168\u003c\/p\u003e \u003cp\u003e14.3. Rebound attack 169\u003c\/p\u003e \u003cp\u003e14.3.1. Basic strategy of the rebound attack 169\u003c\/p\u003e \u003cp\u003e14.3.2. Rebound attack against AES-like structures 171\u003c\/p\u003e \u003cp\u003e14.4. Improving rebound attacks with Super-Sbox 173\u003c\/p\u003e \u003cp\u003e14.5. References for further reading about rebound attacks 175\u003c\/p\u003e \u003cp\u003e14.6. Brief introduction of other cryptanalysis 176\u003c\/p\u003e \u003cp\u003e14.6.1. Internal differential cryptanalysis 176\u003c\/p\u003e \u003cp\u003e14.6.2. Rotational cryptanalysis 177\u003c\/p\u003e \u003cp\u003e14.7. References 177\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 15 Cryptanalysis of SHA-1 181\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eMarc Stevens\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e15.1. Design of SHA-1 181\u003c\/p\u003e \u003cp\u003e15.2. SHA-1 compression function 182\u003c\/p\u003e \u003cp\u003e15.3. Differential analysis 184\u003c\/p\u003e \u003cp\u003e15.4. Near-collision attacks 184\u003c\/p\u003e \u003cp\u003e15.5. Near-collision search 185\u003c\/p\u003e \u003cp\u003e15.6. Message expansion differences 186\u003c\/p\u003e \u003cp\u003e15.7. Differential trail 187\u003c\/p\u003e \u003cp\u003e15.8. Local collisions 187\u003c\/p\u003e \u003cp\u003e15.9. Disturbance vector 188\u003c\/p\u003e \u003cp\u003e15.10. Disturbance vector selection 189\u003c\/p\u003e \u003cp\u003e15.11. Differential trail construction 190\u003c\/p\u003e \u003cp\u003e15.12. Message modification techniques 190\u003c\/p\u003e \u003cp\u003e15.13. Overview of published collision attacks 191\u003c\/p\u003e \u003cp\u003e15.14. References 192\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart 2 Future Directions 195\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 16 Lightweight Cryptography 197\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eMeltem Sönmez Turan\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e16.1. Lightweight cryptography standardization efforts 197\u003c\/p\u003e \u003cp\u003e16.2. Desired features 198\u003c\/p\u003e \u003cp\u003e16.3. Design approaches in lightweight cryptography 200\u003c\/p\u003e \u003cp\u003e16.4. References 202\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 17 Post-Quantum Symmetric Cryptography 203\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eMaría Naya-Plasencia\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e17.1. Different considered models 204\u003c\/p\u003e \u003cp\u003e17.1.1. With respect to the queries 204\u003c\/p\u003e \u003cp\u003e17.1.2. With respect to memory 205\u003c\/p\u003e \u003cp\u003e17.2. On Simon’s and Q2 attacks 206\u003c\/p\u003e \u003cp\u003e17.2.1. Off-line Simon’s attack 207\u003c\/p\u003e \u003cp\u003e17.3. Quantizing classical attacks in Q 1 207\u003c\/p\u003e \u003cp\u003e17.3.1. About collisions 207\u003c\/p\u003e \u003cp\u003e17.4. On the design of quantum-safe primitives 208\u003c\/p\u003e \u003cp\u003e17.5. Perspectives and conclusion 209\u003c\/p\u003e \u003cp\u003e17.5.1. About losing the quantum and classical surname 209\u003c\/p\u003e \u003cp\u003e17.5.2. No panic 209\u003c\/p\u003e \u003cp\u003e17.6. References 209\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 18 New Fields in Symmetric Cryptography 215\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eLéo Perrin\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e18.1. Arithmetization-oriented symmetric primitives (ZK proof systems) 216\u003c\/p\u003e \u003cp\u003e18.1.1. The current understanding of this new language 217\u003c\/p\u003e \u003cp\u003e18.1.2. The first attempts 218\u003c\/p\u003e \u003cp\u003e18.1.3. Cryptanalysis 219\u003c\/p\u003e \u003cp\u003e18.2. Symmetric ciphers for hybrid homomorphic encryption 220\u003c\/p\u003e \u003cp\u003e18.2.1. The current understanding of this new language 221\u003c\/p\u003e \u003cp\u003e18.2.2. First design strategies 221\u003c\/p\u003e \u003cp\u003e18.3. Parting thoughts 223\u003c\/p\u003e \u003cp\u003e18.4. References 223\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 19 Deck-function-based Cryptography 227\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eJoan Daemen\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e19.1. Block-cipher centric cryptography 227\u003c\/p\u003e \u003cp\u003e19.2. Permutation-based cryptography 227\u003c\/p\u003e \u003cp\u003e19.3. The problem of the random permutation security model 228\u003c\/p\u003e \u003cp\u003e19.4. Deck functions 228\u003c\/p\u003e \u003cp\u003e19.5. Modes of deck functions and instances 229\u003c\/p\u003e \u003cp\u003e19.6. References 230\u003c\/p\u003e \u003cp\u003eList of Authors 231\u003c\/p\u003e \u003cp\u003eIndex 233\u003c\/p\u003e \u003cp\u003eSummary of Volume 1 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":52509178233112,"sku":"9781789451474","price":104.99,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9781789451474.jpg?v=1786496283","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/symmetric-cryptography-volume-2-cryptanalysis-and-future-directions-hardback-9781789451474","provider":"Freshly Printed Books","version":"1.0","type":"link"}