Introduction to Cryptography with Mathematical Foundations and Computer Implementations
Chapman & Hall/CRC (Verlag)
978-1-032-91787-0 (ISBN)
- Noch nicht erschienen (ca. Oktober 2024)
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
From the exciting history of its development in ancient times to the present day, Introduction to Cryptography with Mathematical Foundations and Computer Implementations provides a focused tour of the central concepts of cryptography. Rather than present an encyclopedic treatment of topics in cryptography, it delineates cryptographic concepts in chronological order, developing the mathematics as needed.
Written in an engaging yet rigorous style, each chapter introduces important concepts with clear definitions and theorems. Numerous examples explain key points while figures and tables help illustrate more difficult or subtle concepts. Each chapter is punctuated with "Exercises for the Reader;" complete solutions for these are included in an appendix. Carefully crafted exercise sets are also provided at the end of each chapter, and detailed solutions to most odd-numbered exercises can be found in a designated appendix. The computer implementation section at the end of every chapter guides students through the process of writing their own programs. A supporting website provides an extensive set of sample programs as well as downloadable platform-independent applet pages for some core programs and algorithms.
As the reliance on cryptography by business, government, and industry continues and new technologies for transferring data become available, cryptography plays a permanent, important role in day-to-day operations. This self-contained sophomore-level text traces the evolution of the field, from its origins through present-day cryptosystems, including public key cryptography and elliptic curve cryptography.
Alexander Stanoyevitch is a professor at California State University–Dominguez Hills. He completed his doctorate in mathematical analysis at the University of Michigan, Ann Arbor, and has held academic positions at the University of Hawaii and the University of Guam. Dr. Stanoyevitch has taught many upper-level classes to mathematics and computer science students, has published several articles in leading mathematical journals, and has been an invited speaker at numerous lectures and conferences in the United States, Europe, and Asia. His research interests include areas of both pure and applied mathematics.
An Overview of the Subject. Divisibility and Modular Arithmetic. The Evolution of Codemaking until the Computer Era. Matrices and the Hill Cryptosystem. The Evolution of Codebreaking until the Computer Era. Representation and Arithmetic of Integers in Different Bases. Block Cryptosystems and the Data Encryption Standard (DES). Some Number Theory and Algorithms. Public Key Cryptography. Finite Fields in General and GF(28) in Particular. The Advanced Encryption Standard (AES) Protocol. Elliptic Curve Cryptography. Appendices. References.
| Erscheint lt. Verlag | 14.10.2024 |
|---|---|
| Reihe/Serie | Discrete Mathematics and Its Applications |
| Zusatzinfo | 75 Illustrations, black and white |
| Sprache | englisch |
| Maße | 178 x 254 mm |
| Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| ISBN-10 | 1-032-91787-3 / 1032917873 |
| ISBN-13 | 978-1-032-91787-0 / 9781032917870 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
