LEADER 03731nam  22005413  450 
001 9910826507003321
005 20230629222718.0
010   $a1-68392-761-3
010   $a1-68392-762-1
035   $a(CKB)4100000012050014
035   $a(MiAaPQ)EBC6741210
035   $a(Au-PeEL)EBL6741210
035   $a(OCoLC)1273668618
035   $a(DE-B1597)654037
035   $a(DE-B1597)9781683927624
035   $a(BIP)081646298
035   $a(FR-PaCSA)88949168
035   $a(EXLCZ)994100000012050014
100   $a20211214d2021      uy         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aDiscrete Mathematics with Cryptographic Applications $eA Self-Teaching Introduction
210  1$aBloomfield :$cMercury Learning & Information,$d2021.
210  4$d©2021.
215   $a1 online resource (382 pages)
311   $a1-68392-763-X 
327   $tFrontmatter -- $tContents -- $tPreface -- $tChapter 1: A Brief Survey of Elementary Functions -- $tChapter 2: Propositional Algebra -- $tChapter 3: Naïve and Formal (Axiomatic) Set Theory -- $tChapter 4: Groups, Rings, and Fields -- $tChapter 5: Predicates and Quantifiers?Algebraic Theory -- $tChapter 6: Binary Relations and Relational Databases -- $tChapter 7: Combinatorics -- $tChapter 8: Elements of Number Theory -- $tChapter 9: Boolean Functions -- $tChapter 10: Hashing Functions and Cryptographic Maps -- $tChapter 11: Generating Polynomials and Inversion Formulas -- $tChapter 12: Systems of Representatives -- $tChapter 13: Boolean Algebras -- $tChapter 14: Combinatorial Circuits -- $tChapter 15: Complete Systems of Boolean Functions and Bases -- $tChapter 16: Introductory Graph Theory, Euler?s Formula, and Unbreakable Ciphers -- $tChapter 17: Trees and Digraphs -- $tChapter 18: Computations and Algorithms -- $tChapter 19: Finite Automata -- $tChapter 20: Introduction to Game Theory -- $tChapter 21: Information Theory and Coding -- $tChapter 22: Probability Theory with a Finite Sample Space and the Birthday Problem -- $tChapter 23: Turing Machines, P and NP Classes, and Other Models of Computation -- $tChapter 24: Answers and Solutions to Selected Exercises -- $tBibliography -- $tIndex
330   $aThis book covers discrete mathematics both as it has been established after its emergence since the middle of the last century and as its elementary applications to cryptography. It can be used by any individual studying discrete mathematics, finite mathematics, and similar subjects. Any necessary prerequisites are explained and illustrated in the book. As a background of cryptography, the textbook gives an introduction into number theory, coding theory, information theory, that obviously have discrete nature. FEATURES: Designed in a ?self-teaching? format, the book includes about 600 problems (with and without solutions) and numerous examples of cryptographyCovers cryptography topics such as CRT, affine ciphers, hashing functions, substitution ciphers, unbreakable ciphers, Discrete Logarithm Problem (DLP), and more.
517   $aDiscrete Mathematics with Cryptographic Applications 
606   $aCOMPUTERS / Security / Cryptography$2bisacsh
610   $acomputer science.
610   $acryptography.
610   $adiscrete math.
610   $afinite.
610   $amathematics.
615  7$aCOMPUTERS / Security / Cryptography.
676   $a510
700   $aKheyfits$b Alexander I$01603551
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910826507003321
996   $aDiscrete Mathematics with Cryptographic Applications$93927961
997   $aUNINA