Discrete Mathematics With Cryptographic Applications
A Self-Teaching Introduction
Paid access
|Oct 2021
Table of contents
Frontmatter
Contents
Preface
Chapter 1: A Brief Survey of Elementary Functions
Chapter 2: Propositional Algebra
Chapter 3: Naïve and Formal (Axiomatic) Set Theory
Chapter 4: Groups, Rings, and Fields
Chapter 5: Predicates and Quantifiers—Algebraic Theory
Chapter 6: Binary Relations and Relational Databases
Chapter 7: Combinatorics
Chapter 8: Elements of Number Theory
Chapter 9: Boolean Functions
Chapter 10: Hashing Functions and Cryptographic Maps
Chapter 11: Generating Polynomials and Inversion Formulas
Chapter 12: Systems of Representatives
Chapter 13: Boolean Algebras
Chapter 14: Combinatorial Circuits
Chapter 15: Complete Systems of Boolean Functions and Bases
Chapter 16: Introductory Graph Theory, Euler’s Formula, and Unbreakable Ciphers
Chapter 17: Trees and Digraphs
Chapter 18: Computations and Algorithms
Chapter 19: Finite Automata
Chapter 20: Introduction to Game Theory
Chapter 21: Information Theory and Coding
Chapter 22: Probability Theory with a Finite Sample Space and the Birthday Problem
Chapter 23: Turing Machines, P and NP Classes, and Other Models of Computation
Chapter 24: Answers and Solutions to Selected Exercises
Bibliography
Index
29 chapters available
PDF ISBN: 978-1-68392-762-4 | E-Pub ISBN: 978-1-68392-761-7 | Hardback ISBN: 978-1-68392-763-1 | DOI: 10.1515/9781683927624
Publisher: Mercury Learning and Information
Copyright owner: © 2021 Walter de Gruyter GmbH, Berlin/Boston
Publication date: 2021
Language: English
Pages: 375
Keywords
Related subjects: