Discrete Mathematics With Cryptographic Applications: A Self-Teaching Guide to Unlocking the Power of Advanced Concepts and Computational Techniques

This book offers a comprehensive guide to discrete mathematics and its applications to cryptography. It is designed for students and professionals in fields such as discrete mathematics and finite mathematics, with all necessary prerequisites clearly explained and illustrated. The text introduces key concepts in number theory, coding theory, and information theory, which are essential for understanding cryptography. Understanding discrete mathematics is crucial for anyone working in cryptography and related fields. The book begins with a survey of elementary functions and moves on to propositional algebra, set theory, and algebraic structures like groups, rings, and fields. It covers binary relations, combinatorics, and elements of number theory, which are fundamental to cryptographic methods. Readers will explore topics such as Boolean functions, hashing functions, cryptographic maps, combinatorial circuits, and graph theory. The book also delves into advanced areas like finite automata, game theory, and Turing machines. Through numerous examples, problems, and solutions, readers will gain a solid foundation in discrete mathematics and its cryptographic applications.

© 2024 Packt Publishing (eBook): 9781836646921

Data wydania

eBook: 2 sierpnia 2024