Cryptography Made Simple

In this introductory textbook the author explains the key topics in cryptography. He takes a modern approach, where defining what is meant by "secure" is as important as creating something that achieves that goal, and security definitions are central to the discussion throughout. The chapters in Part 1 offer a brief introduction to the mathematical foundations: modular arithmetic, groups, finite fields, and probability; primality testing and factoring; discrete logarithms; elliptic curves; and lattices. Part 2 of the book shows how historical ciphers were broken, thus motivating the design of modern cryptosystems since the 1960s; this part also includes a chapter on information-theoretic security. Part 3 covers the core aspects of modern cryptography: the definition of security; modern stream ciphers; block ciphers and modes of operation; hash functions, message authentication codes, and key derivation functions; the "naive" RSA algorithm; public key encryption and signature algorithms; cryptography based on computational complexity; and certificates, key transport and key agreement. Finally, Part 4 addresses advanced prot ocols, where the parties may have different or even conflicting security goals: secret sharing schemes; commitments and oblivious transfer; zero-knowledge proofs; and secure multi-party computation. The author balances a largely non-rigorous style - many proofs are sketched only - with appropriate formality and depth. For example, he uses the terminology of groups and finite fields so that the reader can understand both the latest academic research and "real-world" documents such as application programming interface descriptions and cryptographic standards. The text employs colour to distinguish between public and private information, and all chapters include summaries and suggestions for further reading.This is a suitable textbook for advanced undergraduate and graduate students in computer science, mathematics and engineering, and for self-study by professionals in information security. While the appendix summarizes most of the basic algebra and notation required, it is assumed that the reader has a basic knowledge of discrete mathematics, probability, and elementary calculus.

Auteur

Nigel P. Smart is a professor of computer science in the University of Bristol. He is a leading cryptographer, with particular expertise in elliptic curve cryptography, pairing-based cryptography, and multi-party computation. Among his achievements and recognition, he received a Royal Society Wolfson Research Merit Award, he is currently the Vice President of the International Association for Cryptologic Research (IACR), and he has chaired the most important academic conferences in this discipline. Beyond his academic experience he also worked in industry (HP Laboratories), and he has cofounded a number of startups, most recently Dyadic Security, a company that deploys distributed cryptographic solutions based on multi-party computations. Prof. Smart was made a Fellow of the IACR in 2016 for essential contributions to the theory and practice of real-world cryptography and outstanding service to the association.

Contenu

Modular Arithmetic, Groups, Finite Fields and Probability.- Elliptic Curves.- Historical Ciphers.- The Enigma Machine.- Information Theoretic Security.- Historical Stream Ciphers.- Modern Stream Ciphers.- Block Ciphers.- Symmetric Key Distribution.- Hash Functions and Message Authentication Codes.- Basic Public Key Encryption Algorithms.- Primality Testing and Factoring.- Discrete Logarithms.- Key Exchange and Signature Schemes.- Implementation Issues.- Obtaining Authentic Public Keys.- Attacks on Public Key Schemes.- Definitions of Security.- Complexity Theoretic Approaches.- Provable Security: With Random Oracles.- Hybrid Encryption.- Provable Security: Without Random Oracles.- Secret Sharing Schemes.- Commitments and Oblivious Transfer.- Zero-Knowledge Proofs.- Secure Multiparty Computation.