---

＜電子ブック＞
Introduction to Cryptography / by Johannes Buchmann
(Undergraduate Texts in Mathematics. ISSN:21975604)

版	2nd ed. 2004.
出版者	New York, NY : Springer New York : Imprint: Springer
出版年	2004
本文言語	英語
大きさ	XVI, 338 p : online resource
冊子体	Introduction to cryptography / Johannes Buchmann ; : pbk,: hbk
著者標目	*Buchmann, Johannes author SpringerLink (Online service)
件　名	LCSH:Number theory LCSH:Data structures (Computer science) LCSH:Information theory FREE:Number Theory FREE:Data Structures and Information Theory
一般注記	1 Integers -- 2 Congruences and Residue Class Rings -- 3 Encryption -- 4 Probability and Perfect Secrecy -- 5 DES -- 6 AES -- 7 Prime Number Generation -- 8 Public-Key Encryption -- 9 Factoring -- 10 Discrete Logarithms -- 11 Cryptographic Hash Functions -- 12 Digital Signatures -- 13 Other Systems -- 14 Identification -- 15 Secret Sharing -- 16 Public-Key Infrastructures -- Solutions of the exercises -- References 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 Accessibility summary: This PDF is not accessible. It is based on scanned pages and does not support features such as screen reader compatibility or described non-text content (images, graphs etc). However, it likely supports searchable and selectable text based on OCR (Optical Character Recognition). Users with accessibility needs may not be able to use this content effectively. Please contact us at accessibilitysupport@springernature.com if you require assistance or an alternative format Inaccessible, or known limited accessibility No reading system accessibility options actively disabled Publisher contact for further accessibility information: accessibilitysupport@springernature.com HTTP:URL=https://doi.org/10.1007/978-1-4419-9003-7

 類似資料