Fundamentals of cryptology :a professional reference and interactive tutorial
- 作者: Tilborg, Henk C. A. van,
- 其他作者: Tilborg, Henk C. A. van,
- 出版: New York : Kluwer Academic Publishers ©2002.
- 稽核項: 1 online resource (xiv, 490 pages) :illustrations.
- 叢書名: The Kluwer international series in engineering and computer science ;SECS 528
- 標題: Computers , COMPUTERS Internet -- Security. , NetworkingSecurity. , COMPUTERS , InternetSecurity. , SecurityGeneral. , COMPUTERS Networking -- Security. , Computers Access control. , Electronic books. , Access control. , Cryptography. , COMPUTERS Security -- General.
- ISBN: 0306470535 , 9780306470530
- 試查全文@TNUA:
- 附註: Updated and improved version of An introduction to cryptology. 1988. Includes bibliographical references (pages 461-468). A.
- 摘要: The protection of sensitive information against unauthorized access or fraudulent changes has been of prime concern throughout the centuries. Modern communication techniques, using computers connected through networks, make all data even more vulnerable to these threats. In addition, new issues have surfaced that did not exist previously, e.g. adding a signature to an electronic document. Cryptology addresses the above issues - it is at the foundation of all information security. The techniques employed to this end have become increasingly mathematical in nature. Fundamentals of Cryptology serves as an introduction to modern cryptographic methods. After a brief survey of classical cryptosystems, it concentrates on three main areas. First, stream ciphers and block ciphers are discussed. These systems have extremely fast implementations, but sender and receiver must share a secret key. Second, the book presents public key cryptosystems, which make it possible to protect data without a prearranged key. Their security is based on intractable mathematical problems, such as the factorization of large numbers. The remaining chapters cover a variety of topics, including zero-knowledge proofs, secret sharing schemes and authentication codes. Two appendices explain all mathematical prerequisites in detail: one presents elementary number theory (Euclid's Algorithm, the Chinese Remainder Theorem, quadratic residues, inversion formulas, and continued fractions) and the other introduces finite fields and their algebraic structure. Fundamentals of Cryptology is an updated and improved version of An Introduction to Cryptology, originally published in 1988. Apart from a revision of the existing material, there are many new sections, and two new chapters on elliptic curves and authentication codes, respectively. Fundamentals of Cryptology will be of interest to computer scientists, mathematicians, and researchers, students, and practitioners in the area of cryptography.
- 電子資源: https://dbs.tnua.edu.tw/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=69523
- 系統號: 005297930
- 資料類型: 電子書
- 讀者標籤: 需登入
- 引用網址: 複製連結
The protection of sensitive information against unauthorized access or fraudulent changes has been of prime concern throughout the centuries. Modern communication techniques, using computers connected through networks, make all data even more vulnerable for these threats. Also, new issues have come up that were not relevant before, e. g. how to add a (digital) signature to an electronic document in such a way that the signer can not deny later on that the document was signed by him/her. Cryptology addresses the above issues. It is at the foundation of all information security. The techniques employed to this end have become increasingly mathematical of nature. This book serves as an introduction to modern cryptographic methods. After a brief survey of classical cryptosystems, it concentrates on three main areas. First of all, stream ciphers and block ciphers are discussed. These systems have extremely fast implementations, but sender and receiver have to share a secret key. Public key cryptosystems (the second main area) make it possible to protect data without a prearranged key. Their security is based on intractable mathematical problems, like the factorization of large numbers. The remaining chapters cover a variety of topics, such as zero-knowledge proofs, secret sharing schemes and authentication codes. Two appendices explain all mathematical prerequisites in great detail. One is on elementary number theory (Euclid's Algorithm, the Chinese Remainder Theorem, quadratic residues, inversion formulas, and continued fractions). The other appendix gives a thorough introduction to finite fields and their algebraic structure.
來源: Google Book
來源: Google Book
評分