The protection of sensitive information against unauthorized access or fraudulent changes has been of prime concern throughout the centuries. Modern communication techniques, using computers connected through networks, make all data even more vulnerable for these threats. Also, new issues have come up that were not relevant before, e. g. how to add a (digital) signature to an electronic document in such a way that the signer can not deny later on that the document was signed by him/her. Cryptology addresses the above issues. It is at the foundation of all information security. The techniques employed to this end have become increasingly mathematical of nature. This book serves as an introduction to modern cryptographic methods. After a brief survey of classical cryptosystems, it concentrates on three main areas. First of all, stream ciphers and block ciphers are discussed. These systems have extremely fast implementations, but sender and receiver have to share a secret key. Public key cryptosystems (the second main area) make it possible to protect data without a prearranged key. Their security is based on intractable mathematical problems, like the factorization of large numbers. The remaining chapters cover a variety of topics, such as zero-knowledge proofs, secret sharing schemes and authentication codes. Two appendices explain all mathematical prerequisites in great detail. One is on elementary number theory (Euclid's Algorithm, the Chinese Remainder Theorem, quadratic residues, inversion formulas, and continued fractions). The other appendix gives a thorough introduction to finite fields and their algebraic structure.
This book presents a rigorous and systematic treatment of the foundational issues: defining cryptographic tasks and solving new cryptographic problems using existing tools.
This text covers the algorithmic foundations and is complemented by core mathematics and arithmetic. Cryptography, as done in this century, is heavily mathematical. But it also has roots in what is computationally feasible.
Doyle. Among cryptologists, the best known Sherlock Holmes story is “The Adventure of the Dancing Men” (1903).26 In this story, the cipher messages that Holmes attempts to crack have the letters replaced by dancing men; hence, ...
C. Harpes, G.G. Kramer, J.L. Massey, A generalization of linear cryptanalysis and the applicability of Matsui's piling-up lemma, 24–38. W.-A. Jackson, K.M. Martin, C.M. O'Keefe, Efficient secret sharing without a mutually trusted ...
Now the most used texbook for introductory cryptography courses in both mathematics and computer science, the Third Edition builds upon previous editions by offering several new sections, topics, and exercises.
Fundamentals of cryptology Software and hardware implementation of cryptographic algorithms Security of data, systems and applications Digital forensics Network security Cloud and big data security Pervasive systems security Information ...
This new book introduces cryptography in a unique and non-mathematical style. Cryptology Unlocked explains encryption, crypto analysis (classic and modern algorithms), cryptographic protocols, digital standards and much more.
Fundamentals. of. Cryptology. This chapter introduces the basic concepts of cryptology [Sim94a, Riv90]. The first section starts with a definition of the general terms cryptology, cryptography and cryptanalysis. Section 2.2 follows with ...
Lemke, Paar, and Wolf collect in this volume a state-of-the-art overview on all aspects relevant for IT security in automotive applications.
Praise for Applied Cryptography "This book should be on the shelf of any computer professional involved in the use or implementation of cryptography.