TY - BOOK AU - Kościelny,Czesław AU - Kurkowski,Mirosław AU - Srebrny,Marian ED - SpringerLink (Online service) TI - Modern Cryptography Primer: Theoretical Foundations and Practical Applications SN - 9783642413865 AV - QA76.9.D35 U1 - 005.74 23 PY - 2013/// CY - Berlin, Heidelberg PB - Springer Berlin Heidelberg, Imprint: Springer KW - Computer science KW - Computer network architectures KW - Data protection KW - Data structures (Computer science) KW - Computer Science KW - Data Structures, Cryptology and Information Theory KW - Systems and Data Security KW - e-Commerce/e-business KW - Computer Systems Organization and Communication Networks N1 - Chap. 1 Basic Concepts and Historical Overview -- Chap. 2 Mathematical Foundations of Cryptography -- Chap. 3 Foundations of Symmetric Cryptography -- Chap. 4 Foundations of Asymmetric Cryptography -- Chap. 5 An Electronic Signature and Hash Functions -- Chap. 6 PGP Systems and True Crypt -- Chap. 7 Public Key Infrastructure -- Chap. 8 Cryptographic Protocols -- Chap. 9 Cryptography Application for Data Security -- References -- Index N2 - Cryptography has experienced rapid development, with major advances recently in both secret and public key ciphers, cryptographic hash functions, cryptographic algorithms and multiparty protocols, including their software engineering correctness verification, and various methods of cryptanalysis. This textbook introduces the reader to these areas, offering an understanding of the essential, most important, and most interesting ideas, based on the authors' teaching and research experience.  After introducing the basic mathematical and computational complexity concepts, and some historical context, including the story of Enigma, the authors explain symmetric and asymmetric cryptography, electronic signatures and hash functions, PGP systems, public key infrastructures, cryptographic protocols, and applications in network security. In each case the text presents the key technologies, algorithms, and protocols, along with methods of design and analysis, while the content is characterized by a visual style and all algorithms are presented in readable pseudocode or using simple graphics and diagrams. The book is suitable for undergraduate and graduate courses in computer science and engineering, particularly in the area of networking, and it is also a suitable reference text for self-study by practitioners and researchers. The authors assume only basic elementary mathematical experience, the text covers the foundational mathematics and computational complexity theory UR - http://dx.doi.org/10.1007/978-3-642-41386-5 ER -