{"product_id":"embedded-cryptography-2-hardback-9781789452143","title":"Embedded Cryptography 2 (Hardback) 9781789452143","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eEmbedded Cryptography 2\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cfont size=\"4\"\u003eEmmanuel Prouff (Author), Guenael Renault (Author), Mattieu Rivain (Author), Colin O'Flynn (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781789452143, Wiley\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 4 February 2025\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e432 pages\u003cbr\u003e23.5 x 15.6 x 2.6 cm, 0.68 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\u003e\u003ci\u003eEmbedded Cryptography\u003c\/i\u003e provides a comprehensive exploration of cryptographic techniques tailored for embedded systems, addressing the growing importance of security in devices such as mobile systems and IoT. The books explore the evolution of embedded cryptography since its inception in the mid-90s and cover both theoretical and practical aspects, as well as discussing the implementation of cryptographic algorithms such as AES, RSA, ECC and post-quantum algorithms.\u003c\/p\u003e \u003cp\u003eThe work is structured into three volumes, spanning forty chapters and nine parts, and is enriched with pedagogical materials and real-world case studies, designed for researchers, professionals, and students alike, offering insights into both foundational and advanced topics in the field.\u003c\/p\u003e \u003cp\u003e\u003ci\u003eEmbedded Cryptography 2\u003c\/i\u003e is dedicated to masking and cryptographic implementations, as well as hardware security.\u003c\/p\u003e\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\u003eEmmanuel PROUFF, Guénaël RENAULT, Matthieu RIVAIN and Colin O’FLYNN\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart 1 Masking 1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 1 Introduction to Masking 3\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eAnge MARTINELLI and Mélissa ROSSI\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e1.1. An overview of masking 3\u003c\/p\u003e \u003cp\u003e1.2. The effect of masking on side-channel leakage 4\u003c\/p\u003e \u003cp\u003e1.3. Different types of masking 5\u003c\/p\u003e \u003cp\u003e1.4. Code-based masking: toward a generic framework 8\u003c\/p\u003e \u003cp\u003e1.5. Hybrid masking 10\u003c\/p\u003e \u003cp\u003e1.6. Examples of specific maskings 11\u003c\/p\u003e \u003cp\u003e1.7. Outline of the part 12\u003c\/p\u003e \u003cp\u003e1.8. Notes and further references 13\u003c\/p\u003e \u003cp\u003e1.9. References 13\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 2 Masking Schemes 15\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eJean-Sébastien CORON and Rina ZEITOUN\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e2.1. Introduction to masking operations 15\u003c\/p\u003e \u003cp\u003e2.2. Classical linear operations 15\u003c\/p\u003e \u003cp\u003e2.3. Classical nonlinear operations 16\u003c\/p\u003e \u003cp\u003e2.3.1 Application of ISW algorithm for n =2and n =3 17\u003c\/p\u003e \u003cp\u003e2.4. Mask refreshing 18\u003c\/p\u003e \u003cp\u003e2.4.1 Refresh masks with complexity O(n) 18\u003c\/p\u003e \u003cp\u003e2.4.2 Refresh masks with complexity O(n 2) 18\u003c\/p\u003e \u003cp\u003e2.4.3 Refresh masks with complexity O(n · log n) 19\u003c\/p\u003e \u003cp\u003e2.5. Masking S-boxes 21\u003c\/p\u003e \u003cp\u003e2.5.1. The Rivain–Prouff countermeasure for AES 21\u003c\/p\u003e \u003cp\u003e2.5.2. Extension to any S-box 22\u003c\/p\u003e \u003cp\u003e2.5.3. The randomized table countermeasure 23\u003c\/p\u003e \u003cp\u003e2.5.4. Attacks 24\u003c\/p\u003e \u003cp\u003e2.6. Masks conversions 27\u003c\/p\u003e \u003cp\u003e2.6.1. First-order Boolean to arithmetic masking 27\u003c\/p\u003e \u003cp\u003e2.6.2. Generalization to high order for Boolean to arithmetic masking 28\u003c\/p\u003e \u003cp\u003e2.6.3. High order Boolean to arithmetic and arithmetic to Boolean masking 30\u003c\/p\u003e \u003cp\u003e2.7. Notes and further references 35\u003c\/p\u003e \u003cp\u003e2.8. References 37\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 3 Hardware Masking 39\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eBegül BILGIN and Lauren DE MEYER\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e3.1. Introduction 39\u003c\/p\u003e \u003cp\u003e3.1.1. Glitches 40\u003c\/p\u003e \u003cp\u003e3.1.2. Glitch-extended probes 41\u003c\/p\u003e \u003cp\u003e3.1.3. Non-completeness 41\u003c\/p\u003e \u003cp\u003e3.2. Category I: td +1masking 42\u003c\/p\u003e \u003cp\u003e3.2.1. First-order security 43\u003c\/p\u003e \u003cp\u003e3.2.2. Higher-order security 46\u003c\/p\u003e \u003cp\u003e3.3. Category II: d +1masking 46\u003c\/p\u003e \u003cp\u003e3.3.1. General construction 47\u003c\/p\u003e \u003cp\u003e3.3.2. Security argument 48\u003c\/p\u003e \u003cp\u003e3.3.3. Comparing to td +1masking 49\u003c\/p\u003e \u003cp\u003e3.3.4. Higher-degree functions 50\u003c\/p\u003e \u003cp\u003e3.4. Trade-offs 51\u003c\/p\u003e \u003cp\u003e3.4.1. Minimizing area 52\u003c\/p\u003e \u003cp\u003e3.4.2. Minimizing latency 52\u003c\/p\u003e \u003cp\u003e3.4.3. Minimizing randomness 53\u003c\/p\u003e \u003cp\u003e3.5. Notes and further references 53\u003c\/p\u003e \u003cp\u003e3.6. References 55\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 4 Masking Security Proofs 59\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eSonia BELAÏD\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e4.1. Introduction 59\u003c\/p\u003e \u003cp\u003e4.2. Preliminaries 60\u003c\/p\u003e \u003cp\u003e4.2.1. Circuits 60\u003c\/p\u003e \u003cp\u003e4.2.2. Additive sharings and gadgets 61\u003c\/p\u003e \u003cp\u003e4.2.3. Compilers 61\u003c\/p\u003e \u003cp\u003e4.3. Probing model 62\u003c\/p\u003e \u003cp\u003e4.3.1. Formal definition 62\u003c\/p\u003e \u003cp\u003e4.3.2. Proofs for small gadgets 63\u003c\/p\u003e \u003cp\u003e4.3.3. Simulation-based proofs 64\u003c\/p\u003e \u003cp\u003e4.3.4. Limitations 66\u003c\/p\u003e \u003cp\u003e4.4. Robust probing model 67\u003c\/p\u003e \u003cp\u003e4.4.1. Formal definition 67\u003c\/p\u003e \u003cp\u003e4.4.2. Proofs for small gadgets 68\u003c\/p\u003e \u003cp\u003e4.4.3. Limitations 69\u003c\/p\u003e \u003cp\u003e4.5. Random probing model and noisy leakage model 70\u003c\/p\u003e \u003cp\u003e4.5.1. Formal definition of the noisy leakage model 70\u003c\/p\u003e \u003cp\u003e4.5.2. Limitations 70\u003c\/p\u003e \u003cp\u003e4.5.3. Reduction to the probing model 71\u003c\/p\u003e \u003cp\u003e4.5.4. Formal definition of the random probing model 71\u003c\/p\u003e \u003cp\u003e4.5.5. Proofs in the random probing model 72\u003c\/p\u003e \u003cp\u003e4.5.6. Extension to handle physical defaults 73\u003c\/p\u003e \u003cp\u003e4.6. Composition 74\u003c\/p\u003e \u003cp\u003e4.6.1. Composition in the probing model 74\u003c\/p\u003e \u003cp\u003e4.6.2. Composition in the random probing model 77\u003c\/p\u003e \u003cp\u003e4.7. Conclusion 81\u003c\/p\u003e \u003cp\u003e4.8. Notes and further references 81\u003c\/p\u003e \u003cp\u003e4.9. References 81\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 5 Masking Verification 83\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eAbdul Rahman TALEB\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e5.1. Introduction 83\u003c\/p\u003e \u003cp\u003e5.2. General procedure 84\u003c\/p\u003e \u003cp\u003e5.3. Verify: verification mechanisms for a set of variables 87\u003c\/p\u003e \u003cp\u003e5.3.1 Distribution-based Verify 87\u003c\/p\u003e \u003cp\u003e5.3.2 Simulation-based Verify 90\u003c\/p\u003e \u003cp\u003e5.4. Explore: exploration mechanisms for all sets of variables 97\u003c\/p\u003e \u003cp\u003e5.4.1. Probing model 98\u003c\/p\u003e \u003cp\u003e5.4.2. Random probing model 102\u003c\/p\u003e \u003cp\u003e5.4.3. Handling physical defaults 107\u003c\/p\u003e \u003cp\u003e5.5. Conclusion 108\u003c\/p\u003e \u003cp\u003e5.6. Notes and further references 109\u003c\/p\u003e \u003cp\u003e5.7. Solution to Exercise 5.1 109\u003c\/p\u003e \u003cp\u003e5.8. References 111\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart 2 Cryptographic Implementations 113\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 6. Hardware Acceleration of Cryptographic Algorithms 115\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eLejla BATINA, Pedro Maat COSTA MASSOLINO and Nele MENTENS\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e6.1. Introduction 115\u003c\/p\u003e \u003cp\u003e6.2. Hardware optimization of symmetric-key cryptography 116\u003c\/p\u003e \u003cp\u003e6.2.1. Hardware implementation of the AES S-box 117\u003c\/p\u003e \u003cp\u003e6.2.2. Composite field based implementation of the AES S-box 117\u003c\/p\u003e \u003cp\u003e6.3. Modular arithmetic for hardware implementations 118\u003c\/p\u003e \u003cp\u003e6.3.1. Montgomery’s arithmetic 119\u003c\/p\u003e \u003cp\u003e6.3.2. Barret reduction 120\u003c\/p\u003e \u003cp\u003e6.3.3. Implementations using residue number system 122\u003c\/p\u003e \u003cp\u003e6.4. RSA implementations 123\u003c\/p\u003e \u003cp\u003e6.4.1. Previous works on RSA implementations 123\u003c\/p\u003e \u003cp\u003e6.4.2. ECC implementations over prime fields 124\u003c\/p\u003e \u003cp\u003e6.5. Post-quantum cryptography 125\u003c\/p\u003e \u003cp\u003e6.6. Conclusion 126\u003c\/p\u003e \u003cp\u003e6.7. Notes and further references 127\u003c\/p\u003e \u003cp\u003e6.8. References 128\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 7 Constant-Time Implementations 133\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eThomas PORNIN\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e7.1. What does constant-time mean? 133\u003c\/p\u003e \u003cp\u003e7.1.1. Timing attacks 133\u003c\/p\u003e \u003cp\u003e7.1.2. Applicability and importance 134\u003c\/p\u003e \u003cp\u003e7.1.3. Example: rejection sampling 135\u003c\/p\u003e \u003cp\u003e7.2. Low-level issues 138\u003c\/p\u003e \u003cp\u003e7.2.1. CPU execution pipeline 138\u003c\/p\u003e \u003cp\u003e7.2.2. Variable time instructions 140\u003c\/p\u003e \u003cp\u003e7.2.3. Memory and caches 143\u003c\/p\u003e \u003cp\u003e7.2.4. Jumps and jump prediction 145\u003c\/p\u003e \u003cp\u003e7.3. Primitive implementation techniques 146\u003c\/p\u003e \u003cp\u003e7.3.1. Compiler issues and Booleans 146\u003c\/p\u003e \u003cp\u003e7.3.2. Bitwise Boolean logic 150\u003c\/p\u003e \u003cp\u003e7.4. Constant-time algorithms 163\u003c\/p\u003e \u003cp\u003e7.4.1. Modular integers 163\u003c\/p\u003e \u003cp\u003e7.4.2. Modular exponentiation 166\u003c\/p\u003e \u003cp\u003e7.4.3. Modular inversion 168\u003c\/p\u003e \u003cp\u003e7.4.4. Elliptic curves 171\u003c\/p\u003e \u003cp\u003e7.5. References 175\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 8 Protected AES Implementations 177\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eFranck RONDEPIERRE\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e8.1. Generic countermeasures 178\u003c\/p\u003e \u003cp\u003e8.1.1. 1 among N 178\u003c\/p\u003e \u003cp\u003e8.1.2. Integrity 179\u003c\/p\u003e \u003cp\u003e8.2. Secure evaluation of the SubByte function 180\u003c\/p\u003e \u003cp\u003e8.2.1. S-box and inverse S-box 181\u003c\/p\u003e \u003cp\u003e8.2.2. Security 182\u003c\/p\u003e \u003cp\u003e8.2.3. Secure table lookup 183\u003c\/p\u003e \u003cp\u003e8.2.4 Evaluation in F 2 8 184\u003c\/p\u003e \u003cp\u003e8.2.5. Tower field 187\u003c\/p\u003e \u003cp\u003e8.2.6. Bitslice S-box 188\u003c\/p\u003e \u003cp\u003e8.2.7. How to select the S-box implementation 189\u003c\/p\u003e \u003cp\u003e8.3. Other functions of AES 192\u003c\/p\u003e \u003cp\u003e8.3.1. State 192\u003c\/p\u003e \u003cp\u003e8.3.2. ShiftRow 192\u003c\/p\u003e \u003cp\u003e8.3.3. MixColumn 192\u003c\/p\u003e \u003cp\u003e8.3.4. KeyScheduling 193\u003c\/p\u003e \u003cp\u003e8.3.5. AES inverse function 194\u003c\/p\u003e \u003cp\u003e8.3.6. Key generation 194\u003c\/p\u003e \u003cp\u003e8.3.7. Interface 195\u003c\/p\u003e \u003cp\u003e8.3.8. Bitsliced state example 195\u003c\/p\u003e \u003cp\u003e8.4. Notes and further references 197\u003c\/p\u003e \u003cp\u003e8.5. References 198\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 9 Protected RSA Implementations 201\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eMylène ROUSSELLET, Yannick TEGLIA and David VIGILANT\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e9.1. Introduction 201\u003c\/p\u003e \u003cp\u003e9.1.1. The RSA cryptosystem 201\u003c\/p\u003e \u003cp\u003e9.1.2. RSA and security recommendations 201\u003c\/p\u003e \u003cp\u003e9.1.3. RSA-CRT and straightforward mode 202\u003c\/p\u003e \u003cp\u003e9.1.4. Toward a device product embedding RSA-CRT 203\u003c\/p\u003e \u003cp\u003e9.2. Building a protected RSA implementation step by step 203\u003c\/p\u003e \u003cp\u003e9.2.1. Loading RSA-CRT key parameter – Step 1 204\u003c\/p\u003e \u003cp\u003e9.2.2. Message reductions – Step 2 205\u003c\/p\u003e \u003cp\u003e9.2.3. Exponentiations – Step 3 206\u003c\/p\u003e \u003cp\u003e9.2.4. Recombination – Step 4 211\u003c\/p\u003e \u003cp\u003e9.2.5. Return S 212\u003c\/p\u003e \u003cp\u003e9.2.6. Protected RSA-CRT pseudo-code 212\u003c\/p\u003e \u003cp\u003e9.3. Remarks and open discussion 213\u003c\/p\u003e \u003cp\u003e9.3.1. Security resistance consideration 213\u003c\/p\u003e \u003cp\u003e9.4. Notes and further references 214\u003c\/p\u003e \u003cp\u003e9.5. References 220\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 10 Protected ECC Implementations 225\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eŁukasz CHMIELEWSKI and Louiza PAPACHRISTODOULOU\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e10.1. Introduction 225\u003c\/p\u003e \u003cp\u003e10.2. Protecting ECC implementations and countermeasures 226\u003c\/p\u003e \u003cp\u003e10.2.1. Unified arithmetic and complete formulae 227\u003c\/p\u003e \u003cp\u003e10.2.2. Constant-time scalar multiplication 228\u003c\/p\u003e \u003cp\u003e10.2.3. Elimination of if-statements even dummy ones 230\u003c\/p\u003e \u003cp\u003e10.2.4. Scalar randomization 234\u003c\/p\u003e \u003cp\u003e10.2.5. Coordinate and point randomizations 236\u003c\/p\u003e \u003cp\u003e10.2.6. Protection against address-bit side-channel attacks 238\u003c\/p\u003e \u003cp\u003e10.2.7. Additional fault injection protections 241\u003c\/p\u003e \u003cp\u003e10.3. Conclusion 242\u003c\/p\u003e \u003cp\u003e10.4. Notes and further references 242\u003c\/p\u003e \u003cp\u003e10.5. References 245\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 11 Post-Quantum Implementations 249\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eMatthias J. KANNWISCHER, Ruben NIEDERHAGEN, Francisco RODRÍGUEZ-HENRÍQUEZ and Peter\u003c\/i\u003e \u003ci\u003eSCHWABE\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e11.1. Introduction 249\u003c\/p\u003e \u003cp\u003e11.2. Post-quantum encryption and key encapsulation 251\u003c\/p\u003e \u003cp\u003e11.2.1. Lattice-based KEMs – Kyber 251\u003c\/p\u003e \u003cp\u003e11.2.2. Code-based KEMs – Classic McEliece 256\u003c\/p\u003e \u003cp\u003e11.2.3. Isogeny-based KEMs 259\u003c\/p\u003e \u003cp\u003e11.2.4. IND-CCA2 security 263\u003c\/p\u003e \u003cp\u003e11.3. Post-quantum signatures 265\u003c\/p\u003e \u003cp\u003e11.3.1. Lattice-based signatures – Dilithium 266\u003c\/p\u003e \u003cp\u003e11.3.2. Multivariate-quadratic-based signatures – UOV 269\u003c\/p\u003e \u003cp\u003e11.3.3 Hash-based signatures – XMSS and SPHINCS + 272\u003c\/p\u003e \u003cp\u003e11.4. Notes and further references 275\u003c\/p\u003e \u003cp\u003e11.5. References 278\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart 3 Hardware Security 289\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 12 Hardware Reverse Engineering and Invasive Attacks 291\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eSergei SKOROBOGATOV\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e12.1. Introduction 291\u003c\/p\u003e \u003cp\u003e12.2. Preparation for hardware attacks 291\u003c\/p\u003e \u003cp\u003e12.2.1. Preparation at PCB level 292\u003c\/p\u003e \u003cp\u003e12.2.2. Preparation at component level 295\u003c\/p\u003e \u003cp\u003e12.2.3. Preparation at silicon level 299\u003c\/p\u003e \u003cp\u003e12.3. Probing attacks 300\u003c\/p\u003e \u003cp\u003e12.4. Delayering and reverse engineering 303\u003c\/p\u003e \u003cp\u003e12.4.1. Chemical deprocessing 303\u003c\/p\u003e \u003cp\u003e12.4.2. Mechanical deprocessing 304\u003c\/p\u003e \u003cp\u003e12.4.3. Chemical–mechanical polishing (CMP) deprocessing 305\u003c\/p\u003e \u003cp\u003e12.4.4. Plasma, RIE and FIB deprocessing 305\u003c\/p\u003e \u003cp\u003e12.4.5. Staining techniques 306\u003c\/p\u003e \u003cp\u003e12.4.6. From images to netlist 307\u003c\/p\u003e \u003cp\u003e12.5. Memory dump and hardware cloning 309\u003c\/p\u003e \u003cp\u003e12.6. Conclusion 311\u003c\/p\u003e \u003cp\u003e12.7. Notes and further references 311\u003c\/p\u003e \u003cp\u003e12.8. References 312\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 13 Gate-Level Protection 315\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eSylvain GUILLEY and Jean-Luc DANGER\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e13.1. Introduction 315\u003c\/p\u003e \u003cp\u003e13.2. DPL principle, built-in DFA resistance, and latent side-channel vulnerabilities 316\u003c\/p\u003e \u003cp\u003e13.2.1. Information hiding rationale 316\u003c\/p\u003e \u003cp\u003e13.2.2. DPL built-in DFA resistance 317\u003c\/p\u003e \u003cp\u003e13.2.3. Vulnerabilities with respect to side-channel attacks 317\u003c\/p\u003e \u003cp\u003e13.3. DPL families based on standard cells 318\u003c\/p\u003e \u003cp\u003e13.3.1. WDDL 318\u003c\/p\u003e \u003cp\u003e13.3.2. MDPL 319\u003c\/p\u003e \u003cp\u003e13.3.3. DRSL 319\u003c\/p\u003e \u003cp\u003e13.3.4. STTL 323\u003c\/p\u003e \u003cp\u003e13.3.5. BCDL 323\u003c\/p\u003e \u003cp\u003e13.3.6. WDDL variants 323\u003c\/p\u003e \u003cp\u003e13.4. Technological specific DPL styles 328\u003c\/p\u003e \u003cp\u003e13.4.1. Full custom optimizations 328\u003c\/p\u003e \u003cp\u003e13.4.2. Asynchronous logic 330\u003c\/p\u003e \u003cp\u003e13.4.3. Reversible differential logic 330\u003c\/p\u003e \u003cp\u003e13.5. DPL styles comparison 331\u003c\/p\u003e \u003cp\u003e13.6. Conclusion 331\u003c\/p\u003e \u003cp\u003e13.7. Notes and further references 332\u003c\/p\u003e \u003cp\u003e13.8. References 334\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 14 Physically Unclonable Functions 339\u003cbr\u003e \u003c\/b\u003e\u003ci\u003eJean-Luc DANGER, Sylvain GUILLEY, Debdeep MUKHOPADHYAY and Ulrich RUHRMAIR\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e14.1. Introduction 339\u003c\/p\u003e \u003cp\u003e14.1.1. Principle 339\u003c\/p\u003e \u003cp\u003e14.1.2. The twin nature of PUFs 341\u003c\/p\u003e \u003cp\u003e14.1.3. Properties 342\u003c\/p\u003e \u003cp\u003e14.1.4. Two broad classification of PUFs 344\u003c\/p\u003e \u003cp\u003e14.1.5. Necessity of enrollment 345\u003c\/p\u003e \u003cp\u003e14.1.6. Use-cases 346\u003c\/p\u003e \u003cp\u003e14.2. PUF architectures 347\u003c\/p\u003e \u003cp\u003e14.2.1. Weak PUFs 347\u003c\/p\u003e \u003cp\u003e14.2.2. Strong PUFs 350\u003c\/p\u003e \u003cp\u003e14.2.3. Big picture of PUF architectures 353\u003c\/p\u003e \u003cp\u003e14.3. Reliability enhancement 353\u003c\/p\u003e \u003cp\u003e14.3.1. Use of error correcting codes 354\u003c\/p\u003e \u003cp\u003e14.3.2. Discarding unreliable bits 356\u003c\/p\u003e \u003cp\u003e14.3.3. Stochastic model of reliability 357\u003c\/p\u003e \u003cp\u003e14.4. Entropy assessment 358\u003c\/p\u003e \u003cp\u003e14.4.1. Stochastic model of the entropy 358\u003c\/p\u003e \u003cp\u003e14.4.2. Entropy loss due to helper data 359\u003c\/p\u003e \u003cp\u003e14.5. Resistance to attacks 361\u003c\/p\u003e \u003cp\u003e14.5.1. Non-invasive attacks 361\u003c\/p\u003e \u003cp\u003e14.5.2. Semi-invasive attacks 363\u003c\/p\u003e \u003cp\u003e14.5.3. Invasive attacks 364\u003c\/p\u003e \u003cp\u003e14.6. Characterizations 364\u003c\/p\u003e \u003cp\u003e14.6.1. Reliability–aging 364\u003c\/p\u003e \u003cp\u003e14.6.2. Machine learning attacks on challenge–response protocol 365\u003c\/p\u003e \u003cp\u003e14.7. Standardization 365\u003c\/p\u003e \u003cp\u003e14.7.1. International standards 365\u003c\/p\u003e \u003cp\u003e14.7.2. Standards requiring PUF 366\u003c\/p\u003e \u003cp\u003e14.8. Notes and further references 366\u003c\/p\u003e \u003cp\u003e14.9. References 368\u003c\/p\u003e \u003cp\u003eList of Authors 375\u003c\/p\u003e \u003cp\u003eIndex 379\u003c\/p\u003e \u003cp\u003eSummary of Volume 1 385\u003c\/p\u003e \u003cp\u003eSummary of Volume 3 393\u003c\/p\u003e\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematics [\u003ca title=\"See our other books on Mathematics\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematics%20%5BPB%5D%22\"\u003ePB\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":52446825120024,"sku":"9781789452143","price":109.99,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9781789452143.jpg?v=1785114850","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/embedded-cryptography-2-hardback-9781789452143","provider":"Freshly Printed Books","version":"1.0","type":"link"}