The aim of this book is to provide a comprehensive introduction to cryptography without using complex mathematical constructions. The themes are conveyed in a form that only requires a basic knowledge of mathematics, but the methods are described in sufficient detail to enable their computer implementation. The book describes the main techniques and facilities of contemporary cryptography, proving key results along the way. The contents of the first five chapters can be used for one-semester course.
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
Let us begin the study of cryptography with the classical problem of transmitting secret messages from a sender A to a receiver B. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
round key schedule, index calculus algorithm, inverse cipher, unicity distance, contemporary cryptography, hash function value, exhaustive key search, public parameters, discrete logarithm problem, memoryless source, computing discrete logarithms, block ciphers, perfect secrecy, signed message, transmitted over the channel, cryptographic applications, corresponding public key, cryptographic methods, signature generation Key Phrases - Capitalized Phrases (CAPs): (learn more)
Let Alice, Suppose Alice, User Private New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Let us begin the study of cryptography with the classical problem of transmitting secret messages from a sender A to a receiver B. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
round key schedule, index calculus algorithm, inverse cipher, unicity distance, contemporary cryptography, hash function value, exhaustive key search, public parameters, discrete logarithm problem, memoryless source, computing discrete logarithms, block ciphers, perfect secrecy, signed message, transmitted over the channel, cryptographic applications, corresponding public key, cryptographic methods, signature generation Key Phrases - Capitalized Phrases (CAPs): (learn more)
Let Alice, Suppose Alice, User Private New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 14
books:
See all 14 books this book cites
- Elliptic Curves in Cryptography (London Mathematical Society Lecture Note Series) by I. Blake in Back Matter
- The Arithmetic of Elliptic Curves (Graduate Texts in Mathematics) (v. 106) by Joseph H. Silverman in Back Matter
- Computational Complexity by Christos H. Papadimitriou in Back Matter
- Codes and Cryptography by Dominic Welsh in Back Matter
- Elliptic Curve Public Key Cryptosystems (The Springer International Series in Engineering and Computer Science) by Alfred J. Menezes in Back Matter
See all 14 books this book cites
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
