Cryptography and Network Security: Principles and Practice

Description

For one-semester, undergraduate- or graduate-level courses in Cryptography, Computer Security, and Network Security. The book is suitable for self-study and so provides a solid and up-to-date tutorial. The book is also a comprehensive treatment of cryptography and network security and so is suitable as a reference for a system engineer, programmer, system manager, network manager, product marketing personnel, or system support specialist. A practical survey of cryptography and network security with unmatched support for instructors and students In this age of universal electronic connectivity, viruses and hackers, electronic eavesdropping, and electronic fraud, security is paramount. This text provides a practical survey of both the principles and practice of cryptography and network security. First, the basic issues to be addressed by a network security capability are explored through a tutorial and survey of cryptography and network security technology. Then, the practice of network security is explored via practical applications that have been implemented and are in use today. An unparalleled support package for instructors and students ensures a successful teaching and learning experience.

Get the book

Amazon.com

Search the book

eBay.com

Search the book

Other editions

• 

  Cryptography and Network Security: Principles and Practice

  • 2011
  • 719 pages
  • Paperback
  • Prentice Hall
• 

  Cryptography and Network Security: Principles and Practice

  • 2006
  • 680 pages
  • Paperback
  • Prentice Hall
• 

  Cryptography and Network Security: Principles and Practice, Global Edition

  • 2022-05-24
  • 833 pages
  • Paperback
  • Pearson Higher Ed
• 

  Cryptography and Network Security: Demystifying the ideas of Network Security,...

  • 2021-09-22
  • 774 pages
  • Ebook
  • BPB Publications

Similar books

• 

  Algebraic Geometry Codes: Advanced Chapters

  By Michael Tsfasman, Serge Vlǎduţ, Dmitry Nogin

  p and for d one has the following Tsfasman–Serre-Sørensen bound: d > 0m - (rq”-1 +0m-2) F (q – T -- 1)4"-", which is an immediately corollary of the following fact. THEOREM 11.1.1. If P e Pro, \{0}, r < q+1, then the zero locus SP ={a e&nbsp;...

• 

  Rank Distance Bicodes and Their Generalization

  By W. B. Vasantha Kandasamy, Florentin Smarandache, N. Suresh Babu

  W. B. Vasantha Kandasamy, Florentin Smarandache, N. Suresh Babu, R.S. Selvaraj. Again, GF(2*) can be considered as a linear space of dimension 'N' over GF(2). Hence an element x e GF(2") has a representation as a N-tuple (oil, Ojo,&nbsp;...

• 

  Designing with Web Standards

  By Jeffrey Zeldman

  ... while you weren't looking , the result is what you see in Figure 16.10 . 16.10 The sidebar is filled at last . daily report glamorous classics about contact essentials pubs tour abc abc RAPPY COE stu WTRemix Go ! Toggle Externals .

• 

  高质量程序设计艺术

  By Diomidis Spinellis, 斯皮内利斯

  本书论述阅读与编写软件代码的方法,重点讨论软件代码的质量属性,包括了软件系统的可靠性、可移植性、可用性、互操作性、适应性、可信性以及可维护性等方面。

• 

  代码质量

  By Diomidis Spinellis

  本书重点讨论代码的非功能特性,深入讲述代码如何满足重要的非功能性需求,如可靠性、安全性、可移植性和可维护性,以及时间效率和空间效率。

• 

  信息研究论

  By 晓宾·卢

  东北师范大学图书出版基金项目

• 

  信息论与编码

  By 陈新, 陈运, 周亮

  本书系统介绍和论述了信息的基本概念;信息论的起源, 发展及研究内容;香农信息论的三个基本概念;信源熵, 信道容量和信息率失真函数, 以及与这三个概念相对应的三个编码定理 ...

• 

  信息论与编码

  By 陈新, 陈运, 周亮

  高等学校电子信息科学与工程专业教材