No label defined (Q4786450)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1846035
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1846035

      Statements

      16 December 2002
      0 references
      number theory
      0 references
      cryptography
      0 references
      This book contains a nice introduction to modern cryptography, with emphasis laid on the ciphers based on computational number theory. The book is divided into three parts. Part I, entitled \textit{Mathematical Foundations of Cryptanalysis}, has fifteen chapters. Chapters 1 to 9 contain some basic facts on information theory and a thorough and detailed introduction to elementary number theory: divisibility, prime numbers, congruences and finite fields. From the very beginning these arithmetic topics are studied with computational aspects and the needs of cryptography in mind. The reader learns to deal with large numbers in a computer and to analyze the complexity of the most basic algorithms. The crypto-computational flavor is reflected in the concrete selection of topics too: there is a nice digression on the distribution of smooth numbers, but the quadratic reciprocity law is stated without proof and used only to obtain a fast algorithm to compute the Jacobi symbol. Once the number theoretical foundations are laid, chapters 10 to 15 deal with arithmetic problems that are relevant to cryptographic applications: factorization of integers, primality tests, computation of discrete logarithms in the multiplicative group of a prime field \(\mathbb{F}_p\), computation of discrete logarithms in the group of rational points of an elliptic curve over \(\mathbb{F}_p\) and random number generation. In this part the reader is not just confronted with a list of algorithms, but he/she is given the clues to assimilate the ideas behind the results and the ultimate aims one is pointing at. The treatment of elliptic curves is very sketchy, but for the other problems the author explains in a phylogenic style how a certain idea leads to an algorithm, the flaws of the algorithm, the new ideas that are required to achieve a better algorithm and how far the new algorithm is from the concrete aim under discussion. Part II, entitled \textit{The Cryptographic Algorithms}, has seven chapters. Chapter 16 analyzes Rijndael as a prototype of private key ciphers, and the other six chapters are devoted to describing the essential features of public key cryptography. Chapter 17 presents RSA, Massey-Omura, ElGamal and Rabin-Williams ciphers. Chapters 18 and 19 deal respectively with signature and key exchange algorithms. Chapter 20 describes some basic protocols as bit commitment, mental poker, oblivious transfer, zero-knowledge proofs, secret sharing and blind signatures. Chapter 21 discusses more complicated protocols for contract signing, secure elections and electronic cash. Chapter 22 analyzes some complete systems like Kerberos and Pretty Good Privacy. Part III, entitled \textit{Methods of Attack}, collects in three chapters some general methods of attack on the cryptographic algorithms of Part II and assesses their strengths and weaknesses. Potential pitfalls are listed, and it is explained how to avoid them when designing cryptosystems. Parts II and III of the book give copious references to the theorems in part I, so that the reader can see how the dialectic attack-defense of cryptosystems leads to new challenging mathematical problems. The book contains more than 200 interesting exercises that test the reader's understanding of the text.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references