- Series: Information Security and Cryptography
- Hardcover: 367 pages
- Publisher: Springer; 2nd edition (April 4, 2007)
- Language: English
- ISBN-10: 3540492437
- ISBN-13: 978-3540492436
- Product Dimensions: 6.1 x 0.9 x 9.2 inches
- Shipping Weight: 1.6 pounds
- Average Customer Review: 4.3 out of 5 stars See all reviews (3 customer reviews)
- Amazon Best Sellers Rank: #6,701,734 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Introduction to Cryptography: Principles and Applications (Information Security and Cryptography) 2nd Edition
Use the Amazon App to scan ISBNs and compare prices.
There is a newer edition of this item:
Customers who viewed this item also viewed
From the reviews:
"Introduction to Cryptography discusses basic and also some more advanced aspects of public-key cryptography. Two appendices provide necessary mathematical prerequisites. Appendix A covers necessary background in algebra and number theory, Appendix B in probability and information theory. The book provides a useful introduction to public-key cryptography with the exception of elliptic curve cryptography. It gives not only a standard informal description of the key structures, but presents also strict mathematical definitions and proofs of some cryptographic properties." (Lenka Fibikova, Zentralblatt MATH, Vol. 995 (20), 2002)
From the Back Cover
Due to the rapid growth of digital communication and electronic data exchange, information security has become a crucial issue in industry, business, and administration. Modern cryptography provides essential techniques for securing information and protecting data.
In the first part, this book covers the key concepts of cryptography on an undergraduate level, from encryption and digital signatures to cryptographic protocols. Essential techniques are demonstrated in protocols for key exchange, user identification, electronic elections and digital cash. In the second part, more advanced topics are addressed, such as the bit security of one-way functions and computationally perfect pseudorandom bit generators. The security of cryptographic schemes is a central topic. Typical examples of provably secure encryption and signature schemes and their security proofs are given. Though particular attention is given to the mathematical foundations, no special background in mathematics is presumed. The necessary algebra, number theory and probability theory are included in the appendix. Each chapter closes with a collection of exercises.
The second edition contains corrections, revisions and new material, including a complete description of the AES, an extended section on cryptographic hash functions, a new section on random oracle proofs, and a new section on public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks.
Browse award-winning titles. See more
If you are a seller for this product, would you like to suggest updates through seller support?
Top customer reviews
it is well suited as an introduction to modern cryptography,
as a basis for courses or for self-education.
Numerous exercises help the reader to deepen his learning of the concepts.
Although the presentation is compact, the algorithms are described with the necessary mathematical
precision. Because the mathematical background is developed in full in the appendix,
only a moderate level of mathematical knowledge is required.
Methods of asymmetrical encryption and the generation of electronic signatures
(RSA, EIGamal, DAS and Rabin) are presented in detail. In the section on cryptographic protocols,
you can learn, e.g., how to establish a secret key over a public channel, such as the Internet.
Bit commitments, zero-knowledge, the sharing of secrets, blind signatures and the use of these
techniques in electronic elections or digital cash are described.
The second part of the book is an introduction to basic security questions in cryptographic systems.
What is security? Which assumptions are made? What can we determine from these assumptions?
Starting with Shannon's classic definition of security,
important security features of modern cryptographic schemes are explained.
The theory of one-way functions,
hard-core bits, cryptographically secure pseudorandom sequences, provably secure encryption
algorithms, hash functions and
provably secure digital signatures are developed with illustrative examples.
The bad things however are:
(1) the imbalance between materials on symmetric-key and asymmetric-key cryptosystems;
(2) the omission of Elliptic Curve Cryptosystem.