دانلود کتاب رمزنگاری: چگونه ریاضیات از دنیای دیجیتال ما محافظت می‌کند

Every day, people ask computers to keep secrets, check messages and recognize the right person or service. A medical report should reach the intended patient. A payment instruction should arrive without an unnoticed change. A software update should come from a source we have a reason to trust. These situations involve different questions, even when one application handles them together. Cryptography provides mathematical methods for answering some of those questions. Its value extends from a single stored document to communication among people who have never met. Each setting needs a clear account of what is protected and which decisions still depend on the surrounding system. To understand the methods, we first need to understand the problem, the evidence a receiver examines and the power we allow an attacker. This book is written for readers who want that understanding without already knowing the subject. Our route begins with familiar messages and the research that changed secret writing into a mathematical science. We then build the tools needed to explain modern systems: bits and bytes, remainders, prime numbers, groups, probability and randomness. Each idea appears with a reason for learning it. Small calculations help us understand general formulas, and the surrounding words explain what their symbols mean. These foundations lead to secret-key encryption, message authentication, password protection, public keys and digital signatures. We ask what each construction achieves, where its assumptions enter the argument and what changes when those assumptions no longer hold. That gives a practical purpose to the mathematics instead of making it a separate obstacle. The aim is to understand how the pieces work together, including the conditions under which a valid calculation gives a useful security guarantee. An equation belongs in the discussion when it makes a real step of that reasoning clearer. The later chapters connect these ideas to key management, secure internet connections, private messages and the behavior of actual software. We examine failures as well as successful constructions, because a good mathematical design still depends on correct use and implementation. Optional examples let readers reproduce selected results with established libraries. The final part introduces quantum threats and methods for proving or computing with private data. Throughout the book, we distinguish an assumption, a proved result, an experiment and a proposed application. Sources allow readers to follow the evidence further. You should finish with the ability to ask precise questions about a cryptographic claim, follow its main explanation and recognize the limits of what has been established.