Cryptography is a key technology in electronic key systems. It is used to keep data secret, digitally sign documents, access control, and so forth. Users therefore should not only know how its techniques work, but they must also be able to estimate their efficiency and security. Based on courses taught by the author, this book explains the basic methods of modern cryptography. It is written for readers with only basic mathematical knowledge who are interested in modern cryptographic algorithms and their mathematical foundation. Several exercises are included following each chapter. This revised and extended edition includes new material on the AES encryption algorithm, the SHA-1 Hash algorithm, on secret sharing, as well as updates in the chapters on factoring and discrete logarithms.
"synopsis" may belong to another edition of this title.
Johannes A. Buchmann is Professor of Computer Science and Mathematics at the Technical University of Darmstadt, and an Associate Editor of the Journal of Cryptology. In 1985, he received a Feodor Lynen Fellowship of the Alexander von Humboldt Foundation. He has also received the most prestigious award in science in Germany, the Leibniz Award of the German Science Foundation (Deutsche Forschungsgemeinschaft).
Cryptography is a key technology in electronic key systems. It is used to keep data secret, digitally sign documents, access control, etc. Therefore, users should not only know how its techniques work, but they must also be able to estimate their efficiency and security. For this new edition, the author has updated the discussion of the security of encryption and signature schemes and recent advances in factoring and computing discrete logarithms. He has also added descriptions of time-memory trade of attacks and algebraic attacks on block ciphers, the Advanced Encryption Standard, the Secure Hash Algorithm, secret sharing schemes, and undeniable and blind signatures.
Johannes A. Buchmann is a Professor of Computer Science and Mathematics at the Technical University of Darmstadt, and the Associate Editor of the Journal of Cryptology. In 1985, he received the Feodor Lynen Fellowship of the Alexander von Humboldt Foundation. Furthermore, he has received the most prestigious award in science in Germany, the Leibniz Award of the German Science Foundation.
About the first edition:
It is amazing how much Buchmann is able to do in under 300 pages: self-contained explanations of the relevant mathematics (with proofs); a systematic introduction to symmetric cryptosystems, including a detailed description and discussion of DES; a good treatment of primality testing, integer factorization, and algorithms for discrete logarithms; clearly written sections describing most of the major types of cryptosystems....This book is an excellent reference, and I believe it would also be a good textbook for a course for mathematics or computer science majors..."
-Neal Koblitz, The American Mathematical Monthly
"About this title" may belong to another edition of this title.
£ 5.84 shipping from U.S.A. to United Kingdom
Destination, rates & speedsSeller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Seller Inventory # 51319887-6
Quantity: 1 available
Seller: MyLibraryMarket, Waynesville, OH, U.S.A.
hardcover. Condition: Very Good. ***Please Read*** No marks on text - My shelf location - 41-a-7*. Seller Inventory # 240409041
Quantity: 1 available
Seller: Mispah books, Redhill, SURRE, United Kingdom
Hardcover. Condition: Like New. Like New. book. Seller Inventory # ERICA758038721156X5
Quantity: 1 available