MARC Record from harvard_bibliographic_metadata

LEADER: 03015nam a22004215a 4500
001 013840964-1
005 20131206202041.0
008 121227s2001 xxu| s ||0| 0|eng d
020 $a9781468404968
020 $a9781468404968
020 $a9781468404982
024 7 $a10.1007/978-1-4684-0496-8$2doi
035 $a(Springer)9781468404968
040 $aSpringer
050 4 $aQA241-247.5
072 7 $aPBH$2bicssc
072 7 $aMAT022000$2bisacsh
082 04 $a512.7$223
100 1 $aBuchmann, Johannes A.,$eauthor.
245 10 $aIntroduction to Cryptography /$cby Johannes A. Buchmann.
264 1 $aNew York, NY :$bSpringer US,$c2001.
300 $aXI, 281p. 7 illus.$bonline resource.
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
347 $atext file$bPDF$2rda
490 1 $aUndergraduate Texts in Mathematics,$x0172-6056
520 $aCryptography 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
650 20 $aNumber theory.
650 10 $aMathematics.
650 0 $aData structures (Computer science)
650 0 $aMathematics.
650 0 $aNumber theory.
650 24 $aData Structures, Cryptology and Information Theory.
776 08 $iPrinted edition:$z9781468404982
830 0 $aUndergraduate Texts in Mathematics.
988 $a20131119
906 $0VEN