Cryptology for Engineers

Cryptology is increasingly becoming one of the most essential topics of interest in everyday life. Digital communication happens by transferring data between at least two participants — But do we want to disclose private information while executing a sensitive bank transfer? How about allowing third-party entities to eavesdrop on private calls while performing an important secret business discussion? Do we want to allow ambient communication concerning us to be manipulated while control software is driving our autonomous car along a steep slope? Questions like these make it clear why issues of security are a great concern in our increasingly augmented world.

Cryptology for Engineers is a study of digital security in communications systems. The book covers the cryptographical functionalities of ciphering, hash generation, digital signature generation, key management and random number generation, with a clear sense of the mathematical background on the one hand and engineers' requirements on the other. Numerous examples computable by hand or with a small additional cost in most cases are provided inside.
Contents: Basics on Number Theory and Probability TheorySecurity in Communication SystemsBasics on AlgebraClassical Private-Key CipheringTheoretical Bounds for Secure CipheringModern Private-Key CipheringComponents of Public-Key CryptosystemsPublic-Key CipheringMessage DigestsDigital SignaturesPrimality Tests and Pseudo Random Numbers
Readership: This book is suitable for advanced undergraduate and graduate students, researchers and practitioners in the fields of cryptology, mathematics and engineering.Cryptology;Cryptography;Cryptanalysis;Mathematics;Probability;Algebra;Private-Key Cryptography;Public-Key Cryptography;Digital Security;Cipher;Cryptosystem;Message Digest;Hash Function;Digital Signature;Key Management;Random Number;Pseudo Random Number;Primality;Security Goals;Communication;Shannon-Entropy;AES;DES;RSA;El-Gamal;Elliptic Curve;Message Detection Code;Message Authentication Code;HMAC;Discrete Logarithm;Factorization;Finite Field;Relatively Prime Residue Class;Chinese Remainder Theorem;Euclidean Algorithm;Euclid's Fundamental Theorem of Arithmetic00