Cryptography Theory and Practice, 4th Edition

所需积分/C币:2 2019-02-01 10:44:03 22.06MB PDF

密码学原理:理论与实践英文版第四版,Cryptography Theory and Practice, 4th Edition,By 作者: Douglas Robert Stinson
Textbooks in mathematics Series editors: Al Boggess and Ken rosen MATHEMATICAL MODELING FOR BUSINESS ANALYTICS Willia p fox ELEMENTARY LINEAR ALGEBRA James R. Kirkwood and Bessie H. Kirkwood APPLIed FUNCTIONAL ANALYSIS, THIRD EDITION J. Tinsley Oden and Leszek demkowicz AN INTRODUCTION TO NUMBER THEORY WITH CRYPTOGRAPHY, SECOND EDITION James R Kraft and lawrence washington MATHEMATICAL MODELING: BRANCHING BEYOND CALCULUS Crista Arangala, Nicolas S. Luke and Karen A. Yokley ELEMENTARY DIFFERENTIAL EQUATIONS, SECOND EDITION Charles roberts ELEMENTARY INTRODUCTION TO THE LEBESGUE INTEGRAL Steven g. Krantz LINEAR METHODS FOR THE LIBERAL ARTS David necker and stephen andrilli CRYPTOGRAPHY: THEORY AND PRACTICE, FOURTH EDITION Douglas r Stinson and Maura B. paterson DISCRETE MATHEMATICS WITH DUCKS SECOND EDITION Sarah-Marie belcastro BUSINESS PROCESS MODELING, SIMULATION AND DESIGN, THIRD EDITION Manual laguna and Johan Marklund GRAPH THEORY AND ITS APPLICATIONS, THIRD EDITION Jonathan L. Gross, Jay Yellen and Mark anderson typography C y g pl y Theory and practice Fourth edition Douglas Stinson Maura b. paterson (CRC) CRC Press Taylor& Francis Group Boca raton landon New york CRC Press is an imprint of the Taylor Francis Group, an informa business CRC Press Taylor Fr 6000 Broken Sound Parkway Nw, Suite 300 Boca raton Fl 33487-2742 2019 by Taylor Francis Group, LLC CRC Press is an imprint of Taylor Francis Group, an Informa business No claim to original U.S. Government works Printed on acid-frcc papc Version date: 20180724 International Standard Book Number-13: 978-1-1381-9701-5 (Hardback) This book contains information obtaincd from authentic and highly regarded sources. Rcasonable cfforts have bccn made to publish reliable data and information, but the author and publisher cannot assume responsibility for the validity of all materials or the consequences of their use. The authors and publishers have attempted to trace the copyright holders of all material reproduced in this publication and apologize to copyright holders if permission to publish in this form has not been obtained. If any copyright material has not been acknowledged please write and let us know so we may tify in any future reprint. Except as permitted U.S. Copyright Law, no part of this book may be reprinted, reproduced, transmitted, or utilized in any form by any electronic, mechanical, or other means, now known or hereafter invented including photocopying, microfilming, and recording, or in any information storage or retrieval system, without written permission from the publishers Forpermissiontophotocopyorusematerialelectronicallyfromthisworkpleaseaccesswww.copyright.com (http://www.copyright.com/)orcontacttheCopyrightClearanceCenter,Inc.(ccc),222RosewooddrIve,Danvers, MA 01923, 978-750-8400. CCC is a not-for-profit organization that provides licenses and registration for a variety of users. For organizations that have been granted a photocopy license by the CCC, a separate system of payment has been arranged. Trademark Notice: Product or cor porate names may be trademarks or registered trademarks, and are used only for identification and explanation without intent to infringe Library of Congress Cataloging-in-Publication Data Names: Stinson, Douglas R(Douglas Robert), 1956-author. Paterson, Maura Title: Cryptography: theory and practice/ Douglas R Stinson and Maura B Paterson Description: Fourth edition. Boca Raton: CRC Press, Taylor Francis Group, 2018. Identifiers: LCCN 2018018724 ISBN 9781138197015 Subjects: LCSH: Coding theory. Cryptography Classification: LCC QA268 S75 2018 DDC 005.8/2--dc23 Lcrecordavailableathttps://lccn.loc.gov2018018724 Visit the taylor francis Web site at http://www.taylorandfrancis.com and the CrC Press Web site at http://www.crcpress.com To my children, michela and Aiden DRS To my father, Hamish MBP Contents Preface 1 Introduction to Cryptography 1. 1 Cryptosystems and Basic Cryptographic Tools 1.1.1 Secret-key Cryptosystems 1. 1.2 Public-key Cryptosystems 1.1.3 Block and Stream Ciphers.............. 1. 1.4 Hybrid Cryptography 1.2 Message Integrity 1.2.1 Message Authentication Codes 垂 1112334667 1.2.2 Signature Schemes 1.2.3N diatto 1.2.4 Certificates 1. 2.5 Hash Functions 1.3C ypt tographic protocols 1.4 Security 10 1.5 Notes and References 2 Classical Cryptography 15 2.1 Introduction: Some Simple Cryptosystems 15 2.1.1 The Shift Cipher 2.1.2 The Substitution Cipher 20 2.1.3 The Affine Cipher 22 2.1.4 The Vigenere Cipher 2.1.5 The Hill Cipher 27 2.1.6 The Permutation Cipher 32 2.1.7 Stream Ciphers 34 2 Cryptanalysis 38 2.2.1 Cryptanalysis of the Affine Cipher 40 2.2.2 Cryptanalysis of th stitution Cipher 42 2.2.3 Cryptanalysis of the Vigenere Cipher 45 2.2.4 Cryptanalysis of the Hill Cipher 2.2.5 Cryptanalysis of thc LFSR Strcam Cipher 49 2.3 Notes and References Exercises 51 3 Shannon's Theory perfect secrecy, and the one-Time pad 61 3.1 Introduction 3.2 Elementary probability theory 62 3.3 Perfect Secrecy 64 3.4 Entropy 70 3.4.1 Properties of Entropy 3.5 Spurious Keys and Unicity distance 3.6 Notes and References Exercises 4 Block Ciphers and Stream Ciphers 83 4.1 Introduction 4.2 Substitution-Permutation Networks 84 4.3 Linear Cryptanalysis 89 4.3.1 The piling-up lemma 4.3.2 Linear Approximations of S-boxes 91 4.3.3 A Lincar Attack on an spn 94 4.4 Differential cryptanalysis 4.5 The Data Encryption Standard 105 4.5.1 Description of des 105 4.5.2 Analysis of dES 107 4.6 The advanccd encryption standard 109 4.6.1 Description of aes 110 4.6.2 Analysis of aES ········ 115 4.7 Modes of Operation 116 4.7.1 Padding Oracle Attack on CBC Mode 120 4.8 Strcam Ciphers 122 4.8.1 Correlation attack on a combination generator 123 4.8.2 Algebraic Attack on a Filter generator 127 4.8.3 Trivium 130 4.9 Notes and references 131 Exercises 131 5 Hash Functions and Message Authentication 137 5.1 Hash Functions and Data Integrity 137 5.2 Security of Hash Functions 139 5.2.1 The Random Oracle model 140 5.2.2 Algorithms in the random Oracle Model 142 5.2.3 Comparison of Security Criteria 146 5.3 Iterated Hash functions 148 5.3.1 The merkle-Damgard construction 151 5.3.2 Some Examples of Iterated Hash Functions 156 5.4 The Sponge Construction 157 54.1SHA-3 160 5.5 Message Authentication Codes 161 5.5.1 Nested MAcs and hmac 5.5.2 CBC-MAC 5.5.3 Authenticated Encryption 167 5.6 Unconditionally Secure MAcs 170 5.6. 1 Strongly Universal Hash Families 173 5.6.2 Optimality of Deception Probabilities 175 5.7 Notes and references Exercises 178 6 The RSA Cryptosystem and Factoring Integers 185 6.1 Introduction to Public-key Cryptography 185 6.2 More number thcory 188 6.2.1 The Euclidean algorithm 188 6.2.2 The Chinese remainder theorem 191 6.2.3 Other Useful facts 194 6.3 The RSA Cryptosystem 196 631 Implementing rs∧ 198 6.4 Primality Testing 200 6.4.1 Legendre and Jacobi Symbols 6.4.2 The Solovay-Strassen algorithm 205 6.4.3 The Miller-Rabin algorithm 6.5 Square roots modulo n 210 6.6 Factoring Algorithms 6.6.1 The Pollard p-1 Algorithm 212 6.6.3 Dixons Random Squares algorith 6.6.2 The Pollard rho algorithm 213 216 6.6.4 Factoring Algorithms in Practicc 6.7 Other Attacks on rsa 6.7. 1 Computing (n) 223 6.7.2 The Decryption Exponent 223 6.7.3 Wiener's Low Decryption Exponent Attack 72 8 6.8 The Rabin Cryptosystem 232 6.8.1 Security of the Rabin Cryptosystem 234 6.9 Semantic Security of rsa 236 6. 9.1 Partial Information Concerning Plaintext Bits 237 6.9.2 Obtaining Semantic Security 239 6.10 Notes and rcfcrcnccs 245 Exercise 246 7 Public-Key Cryptography and Discrete Logarithms 255 7.1 Introduction 255 7.1.1 The ElGamal Cryptosystem 256 7.2 Algorithms for the Discrete Logarithm Problem 258 7.2.1 Shanks algorithm 7.2.2 The Pollard Rho Discrete Logarithm Algorithm C ontents 7. 2.3 The Pohlig-Hellman algorithm 263 7.2.4 The Index calculus method 266 7. 3 Lower bounds on the complexity of generic algorithms 268 7. 4 Finite Fields 7.4.1 Joux's Index calculus 276 7.5 Elliptic curves 278 7.5.1 Elliptic Curves over the reals 278 7.5.2 Elliptic Curves modulo a prime 281 7.5.3 Elliptic Curves over Finite Fields 284 7.5.4 Properties of Elliptic Curves 285 7.5.5 Pairings on elliptic curves 286 7.5.6 ElGamal Cryptosystems on Elliptic curves 7.5.7 Computing Point Multiples on Elliptic Curves 292 7.6 Discrete Logarithm Algorithms in Practice 294 7.7 Security of elgamal Systems 296 7.7.1 Bit Security of discrete logarithms 296 7.7.2 Semantic Security of elgamal Systems 7.7.3 The Diffie-Hellman problems 300 7. 8 Notes and references Exercises 302 8 Signature Schemes 309 8.1 Introduction 8.1.1 RSA Signature Scheme 310 8.2 Security Requirements for Signature Schemes 312 8.2.1 Signatures and Hash Functions 8. 3 The ElGamal Signature Schemc 314 8.3.1 Security of the ElGamal Signature Scheme 317 8.4 Variants of the elgamal signature Scheme 320 8.4.1 The Schnorr Signature Scheme 320 8.4.2 The Digital Signature Algorithm 322 8.4.3 The Elliptic CurVe dsa 325 8.5 Full Domain hash 326 8.6 Certificates 330 8.7 Signing and Encrypting 331 8.8 Notes and re eferences 333 Exercises 334 9 Post-Quantum Cryptography 341 9.1 Introduction 9.2 Lattice-based Cryptography 344 9.2.1 NTRU 344 9. 2.2 Lattices and the Security of NTRU 348 9.2.3 Learning With errors 351 9.3 Code-based Cryptography and the McEliece Cryptosystem 353

...展开详情
img
Jerrien_Lu
  • GitHub

    绑定GitHub第三方账户获取

关注 私信 TA的资源

上传资源赚积分,得勋章
最新资源