scientific article; zbMATH DE number 3930877
This book has two parts: Foundations of cryptography and Applications of cryptography. The primary purpose of the book is to survey traditional cryptographic systems used by governments to encode text messages and then to contrast these methods to the Data Encryption Standard (DES) used to encode computer internal information. The book makes use of probability, linear algebra, group theory, and complexity theory in development of the traditional cryptosystems. It contains a summary of these branches of mathematics for readers not familiar with them. In the theoretical discussion, the author uses an arbitrary alphabet: \(Z_ m=\{0,1,...,m-1\}\). For his examples he uses English: \(\{\) A,B,...,Z\(\}\). Topics included in Part I are arranged in order of increasing complexity and security. The simplest system is Caesar substitution, a cyclic shift of the alphabet. The most complex is the DES. As the cryptosystems increase in complexity, the amount of information an opponent is assumed to know about the cryptosystems increases. There is no uniform measure of the complexity and ease of cryptoanalysis for all the cryptosystems discussed. Perhaps the complexity of the notation used to describe a cryptosystem is a good indication of its place in this continuum of techniques. The notation is often hard to understand. Part II begins with examples of data processing applications where security is critical. It then continues with a survey of systems where public keys are combined with secret keys to guarantee that messages between users can only be interpreted by the desired receiver and can be validated as originated by the indicated sender. These systems are built upon three traditional NP-complete mathematical problems. The book concludes with a discussion of DES hardware and software available from IBM, the author's employer. This testifies to IBM's well documented interest in data security, but excludes anything from other companies. \{The reviewer found this book to be an interesting introduction to cryptography, a discipline in the intersection of the domains of applied mathematics and computer science.\}
- Group theoretic properties of Rijndael-like ciphers
- Estimating the number of good permutations by a modified fast simulation method
- Über die minimale Fixpunktanzahl von Dickson-Permutationen auf Galoisfeldern. (On the minimum number of fixed points of Dickson permutations over Galois fields)
- An analysis of a class of algorithms for S-box construction
- Easy weighted majority games
- Cryptographic systems
- Understanding Cryptography
- scientific article; zbMATH DE number 3937099 (Why is no real title available?)
- scientific article; zbMATH DE number 4006146 (Why is no real title available?)
- scientific article; zbMATH DE number 41062 (Why is no real title available?)
- scientific article; zbMATH DE number 1179120 (Why is no real title available?)
- A note on quantum related-key attacks
- Analysis and design of affine and Hill cipher
- A layered broadcast cryptographic system
- Analytical characteristics of the DES
- On the security of compressed encodings
- Some results on the information theoretic analysis of cryptosystems
- Cryptographic Primitives in Blockchain Technology
- A Cryptography Primer
- Verschlüsseln, Signieren, Angreifen
- Randomness measures related to subset occurrence
- scientific article; zbMATH DE number 2221548 (Why is no real title available?)
- Nondegenerate functions and permutations
- On the concealability of messages by the Williams public-key encryption scheme
- Applying fast simulation to find the number of good permutations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3705340)