Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
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.
Content Level »Research
Keywords »Shannon - Symbol - algorithms - coding theory - communication - computer - cryptography - data compression - finite field - information - number theory
Preface. 1. Introduction. 2. Classical Cryptosystems. 3. Shift Register Sequences. 4. Block Ciphers. 5. Shannon Theory. 6. Data Compression Techniques. 7. Public-Key Cryptography. 8. Discrete Logarithm Based Systems. 9. RSA Based Systems. 10. Elliptic Curves Based Systems. 11. Coding Theory Based Systems. 12. Knapsack Based Systems. 13. Hash Codes & Authentication Techniques. 14. Zero Knowledge Protocols. 15. Secret Sharing Systems. A. Elementary Number Theory. B. Finite Fields. C. Relevant Famous Mathematicians. D. New Functions. References. Symbols and Notations. Index.