E-Book, Englisch, 704 Seiten
Mollin Codes
Erscheinungsjahr 2005
ISBN: 978-1-4200-3508-7
Verlag: Taylor & Francis
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)
The Guide to Secrecy From Ancient to Modern Times
E-Book, Englisch, 704 Seiten
Reihe: Discrete Mathematics and Its Applications
ISBN: 978-1-4200-3508-7
Verlag: Taylor & Francis
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)
From the Rosetta Stone to public-key cryptography, the art and science of cryptology has been used to unlock the vivid history of ancient cultures, to turn the tide of warfare, and to thwart potential hackers from attacking computer systems. Codes: The Guide to Secrecy from Ancient to Modern Times explores the depth and breadth of the field, remaining accessible to the uninitiated while retaining enough rigor for the seasoned cryptologist.
The book begins by tracing the development of cryptology from that of an arcane practice used, for example, to conceal alchemic recipes, to the modern scientific method that is studied and employed today. The remainder of the book explores the modern aspects and applications of cryptography, covering symmetric- and public-key cryptography, cryptographic protocols, key management, message authentication, e-mail and Internet security, and advanced applications such as wireless security, smart cards, biometrics, and quantum cryptography. The author also includes non-cryptographic security issues and a chapter devoted to information theory and coding. Nearly 200 diagrams, examples, figures, and tables along with abundant references and exercises complement the discussion.
Written by leading authority and best-selling author on the subject Richard A. Mollin, Codes: The Guide to Secrecy from Ancient to Modern Times is the essential reference for anyone interested in this exciting and fascinating field, from novice to veteran practitioner.
Zielgruppe
Mathematicians, computer scientists, electrical engineers, and students, researchers, and professionals in cryptology, security and audit control, algorithms and computation, applied computing, MIS, data management, discrete math, combinatorics, information theory, and security and privacy. Additionally, non-professionals interested in cryptography and cryptanalysis will find much of the material to be of interest. This includes the history-minded reader, the amateur mathematician, and the merely curious.
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
Preface
FROM THE RIDDLES OF ANCIENT EGYPT TO CRYPTOGRAPHY IN THE RENAISSANCE-3,500 YEARS IN THE MAKING
Antiquity-From Phaistos
Cryptography in Classical Literature
The Middle Ages
Cryptology and the Arabs
Rise of the West
FROM SIXTEENTH-CENTURY CRYPTOGRAPHY TO THE NEW MILLENNIUM-THE LAST 500 YEARS
Three Post-Renaissance Centuries
The American Colonies
Nineteenth-Century Cryptography
Two World Wars
The Post War Era and the Future
SYMMETRIC-KEY CRYPTOGRAPHY
Block Ciphers and DES
S-DES and DES
Modes of Operation
Blowfish
The Advanced Encryption Standard
Stream Ciphers
RC4
PUBLIC-KEY CRYPTOGRAPHY
The Ideas Behind PKC
RSA
Digital Signatures
ElGamal
CRYPTOGRAPHIC PROTOCOLS
Introduction
Keys
Identification
Commitment
Secret Sharing
Electronic Voting
Protocol Layers and SSL
Digital Cash Schemes
KEY MANAGEMENT
Authentication, Exchange, and Distribution
Public-Key Infrastructure (PKI)
Secure Electronic Transaction (SET)
MESSAGE AUTHENTICATION
Authentication Functions
Message Authentication Codes
Encryption Functions
Authentication Applications
ELECTRONIC MAIL AND INTERNET SECURITY
Pretty Good Privacy (PGP)
S/MIME and PGP
IPSec
Internetworking and Security-Firewalls
Client-Server Model and Cookies
History of the Internet and the WWW
APPLICATIONS AND THE FUTURE
Login and Network Security
Wireless Security
Smart Cards
Biometrics
Quantum Cryptography
Nuclear Test Ban Treaty Compliance
NON-CRYPTOGRAPHIC SECURITY ISSUES
Cybercrime
Hackers
Viruses and Other Infections
Legal Matters and Controversy
INFORMATION THEORY AND CODING
Shannon
Entropy
Huffman Codes
Information Theory of Cryptosystems
Error-Correcting Codes
APPENDIX A: MATHEMATICAL FACTS
Sets, Relations, and Functions
Basic Arithmetic
Modular Arithmetic
Groups, Fields, Modules, and Rings
Vector Spaces
Basic Matrix Theory
Continued Fractions
Elliptic Curves
Complexity
APPENDIX B: PSEUDO-RANDOM NUMBER GENERATION
ANSI X9.17
The Blum-Blum-Shub-(BBS) PRNG
APPENDIX C: FACTORING LARGE INTEGERS
Classical Factorization Methods
The Continued Fraction Algorithm
Pollard's p-1 Algorithm
Pollard's Rho-Method
The Quadratic Sieve (QS)
Multipolynomial Quadratic Sieve (MPQS)
The Elliptic Curve Method (ECM)
The General Number Field Sieve
APPENDIX D: TECHNICAL AND ADVANCED DETAILS
AES
Silver-Pohlig-Hellman
Baby-Step Giant-Step Algorithm
Index-Calculus Algorithm
Brands' Digital Cash Scheme
Radix-64 Encoding
APPENDIX E: PROBABILITY THEORY
Basic Probability
Randomness, Expectation, and Variance
Binomial Distribution
The Law of Large Numbers
Probability and Error Detection
APPENDIX F: RECOGNIZING PRIMES
Primality and Compositeness Tests
Miller-Selfridge-Rabin
Primes is in P
Generation of Random Primes
Decision Problem or Primality Test?
APPENDIX G: EXERCISES
BIBLIOGRAPHY
LIST OF SYMBOLS
INDEX
