No label defined (Q3705340)
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 3930877
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3930877 |
Statements
1981
0 references
traditional cryptographic systems
0 references
Data Encryption Standard
0 references
complexity
0 references
cryptosystems
0 references
data processing applications
0 references
NP-complete
0 references
data security
0 references
0.8299689888954163
0 references
0.8299689888954163
0 references
0.8284151554107666
0 references
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.\}
0 references