{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":16,"n_cols":5,"rows_kept":16,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[13,2,13,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910826507003321"]
[null,null,"Autore",null,"Kheyfits Alexander I"]
[null,null,"Titolo",null,"Discrete Mathematics with Cryptographic Applications : A Self-Teaching Introduction"]
[null,null,"Pubbl/distr/stampa",null,"Bloomfield : , : Mercury Learning & Information, , 2021"]
[{"$nulls":4},"©2021"]
[null,null,"ISBN",null,"1-68392-761-3"]
[{"$nulls":4},"1-68392-762-1"]
[null,null,"Descrizione fisica",null,"1 online resource (382 pages)"]
[null,null,"Disciplina",null,"510"]
[null,null,"Soggetti",null,"COMPUTERS / Security / Cryptography"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"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"]
[null,null,null,"Sommario/riassunto","This 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 "]
[{"$nulls":4},"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."]