Название: Cryptography: Algorithms, Protocols, and Standards for Computer Security
Автор: Zoubir Mammeri
Издательство: Wiley
Год: 2024
Страниц: 616
Язык: английский
Формат: pdf (true)
Размер: 39.8 MB

An introduction to one of the backbones of the digital world.

Cryptography is one of the most important aspects of information technology security, central to the protection of digital assets and the mitigation of risks that come with increased global connectivity. The digital world is wholly reliant on secure algorithms and protocols for establishing identity, protecting user data, and more. Groundbreaking recent developments in network communication and a changing digital landscape have been accompanied by similar advances in cryptography, which is more central to digital life than ever before. Cryptography is the discipline at the intersection of Computer Science and mathematics. It provides algorithms for guaranteeing confidentiality, integrity, authentication, and non-repudiation for parties that share data or exchange messages to perform operations and transactions in cyberspace.

This book constitutes a comprehensive yet accessible introduction to the algorithms, protocols, and standards which protect the modern internet. Built around both foundational theories and hundreds of specific algorithms, it also incorporates the required skills in complex mathematics. The result is an indispensable introduction to the protocols and systems which should define cryptography for decades to come.

Readers will also find:

Over 450 problems with accompanying solutions to reinforce key concepts and test retention
Detailed discussion of topics including symmetric and asymmetric algorithms, random number generation, user authentication, and many more
Over 200 figures and tables that provide rich detail to the content

Chapter 1: This chapter introduces aims at introducing the main issues and notions of security in computer-based systems. The main properties of security (namely confidentiality, integrity, authenticity, and non-repudiation) are introduced. A taxonomy of attacks on digital assets is provided. Multiple components and practices, required to address from different perspectives the security of computer-based systems, are introduced in this chapter. The main technical components of security include cryptography, which is the focus of the remainder of the book.

Chapter 2: Cryptography has developed and improved over time. Chapter 2 aims at providing a brief history of cryptography and presenting its main notions and techniques. Breaking cryptographic codes is a very ancient activity to disclose secrets. An overall categorization of attacks on modern cryptographic algorithms is discussed in this chapter. There exist two main categories of cryptographic systems: symmetric and asymmetric (also called public-key) cryptosystems. The design differences between both categories are briefly discussed. Message digest, digital signature, and digital certificate are of prime importance to establish trust between parties that share data and exchange messages. These notions are introduced in Chapter 2.

Chapter 3: This chapter aims at reviewing and presenting, with examples and exercises, the mathematical background
useful to address cryptography algorithms.

Chapter 4: Shift and substitution ciphers have been used in written text transmission; and dominated the art of secretwriting for at least two millenniums. The most known historical ciphers in this category include Caesar’s, Vigenere’s, Affine, One Time Pad, and Enigma ciphers. All those ciphers are original inventions, with ideas and principles that inspired authors of modern cryptographic algorithms.

Chapter 5: This chapter introduces three notions of cryptography: hash functions, message authentication codes, and digital signature. All of them are of paramount importance for providing integrity and authentication guarantees. Hash functions produce digital fingerprints, also called message tags, which are mainly used to verify the integrity of messages and files, to generate and verify digital signatures, and to generate random numbers.
...
Chapter 16: Modern cryptography is fundamentally based on large random and prime numbers. In particular, keys should be generated using large random numbers; and RSA keys are generated using large prime numbers. Any weakness (in term of randomness) in a selected key may result in damage of data and messages protected by that weak key. Chapter 16 addresses algorithms and methods recommended to generate random and prime numbers. True random numbers are hard to produce by computer. In consequence, deterministic random number generators (DRNGs) are of
common use in cryptography.

Cryptography: Algorithms, Protocols, and Standards for Computer Security is ideal for undergraduate and graduate students in cryptography and information technology subjects, as well as for researchers looking for a working reference on existing cryptographic algorithms and protocols.




ОТСУТСТВУЕТ ССЫЛКА/ НЕ РАБОЧАЯ ССЫЛКА ЕСТЬ РЕШЕНИЕ, ПИШИМ СЮДА!