Cryptography and Network Security: Principles and Practice (8版)

類似書籍推薦給您

【原文書】 書名：Cryptography and Network Security: Principles and Practice, Global Edition, 8/E 作者：STALLINGS 出版社：PEARSON 出版日期：2022/00/00 ISBN：9781292437484 目錄 1.Computer and Network Security Concepts 2.Introduction to Number Theory 3.Classical Encryption Techniques 4.Block Ciphers and the Data Encryption Standard 5.Finite Fields 6.Advanced Encryption Standard 7.Block Cipher Operation 8.Random Bit Generation and Stream Ciphers 9.Public-Key Cryptography and RSA 10.Other Public-Key Cryptosystems 11.Cryptographic Hash Functions 12.Message Authentication Codes 13.Digital Signatures 14.Lightweight Cryptography and Post-Quantum Cryptography 15.Key Management and Distribution 16.User Authentication Protocols 17.Transport-Level Security 18.Wireless Network Security 19.Electronic Mail Security 20.IP Security 21.Network Endpoint Security 22.Cloud Security 23.Internet of Things (IoT) Security Appendix A. Basic Concepts from Linear Algebra Appendix B. Measures of Security and Secrecy Appendix C. Data Encryption Standard (DES) Appendix D. Simplified AES Appendix E. Mathematical Basis of the Birthday Attack

Computational Cryptography

類似書籍推薦給您

The area of computational cryptography is dedicated to the development of effective methods in algorithmic number theory that improve implementation of cryptosystems or further their cryptanalysis. This book is a tribute to Arjen K. Lenstra, one of the key contributors to the field, on the occasion of his 65th birthday, covering his best-known scientific achievements in the field. Students and security engineers will appreciate this no-nonsense introduction to the hard mathematical problems used in cryptography and on which cybersecurity is built, as well as the overview of recent advances on how to solve these problems from both theoretical and practical applied perspectives. Beginning with polynomials, the book moves on to the celebrated Lenstra–Lenstra–Lovász lattice reduction algorithm, and then progresses to integer factorization and the impact of these methods to the selection of strong cryptographic keys for usage in widely used standards. Featuring contributions by the leading experts in the field, this text covers the various hard mathematical problems used in cryptography and the asymptotically best algorithms to solve these problems Presents 20 algorithms with in-depth descriptions on their utility in solving hard problems Teaches students what problems are actually used as the foundation to secure all our digital assets, and about the security assessment used in cryptography and how it relates to selecting key-sizes in practice Advises security engineers how to avoid common pitfalls when deploying security solutions Written in tribute to the scientific research career of Professor Arjen K. Lenstra, on the occasion of his 65th birthday