Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Cryptography and network security : principles and practice / / William Stallings ; contributions by Mohit P. Tahiliani
| Cryptography and network security : principles and practice / / William Stallings ; contributions by Mohit P. Tahiliani |
| Autore | Stallings William |
| Edizione | [Sixth edition.] |
| Pubbl/distr/stampa | Boston, [Massachusetts] : , : Pearson, , 2014 |
| Descrizione fisica | 1 online resource (755 pages) : illustrations |
| Disciplina | 005.8 |
| Collana | Always Learning |
| Soggetto topico |
Computer networks - Security measures
Data encryption (Computer science) Coding theory |
| ISBN |
9781488682957
9780273793359 1-4886-8295-X 0-273-79376-4 |
| Formato | Multimedia  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Cover -- Contents -- Notation -- Preface -- Chapter 0 Guide for Readers and Instructors -- 0.1 Outline of This Book -- 0.2 A Roadmap for Readers and Instructors -- 0.3 Internet and Web Resources -- 0.4 Standards -- Chapter 1 Overview -- 1.1 Computer Security Concepts -- 1.2 The OSI Security Architecture -- 1.3 Security Attacks -- 1.4 Security Services -- 1.5 Security Mechanisms -- 1.6 A Model for Network Security -- 1.7 Recommended Reading -- 1.8 Key Terms, Review Questions, and Problems -- PART ONE: SYMMETRIC CIPHERS -- Chapter 2 Classical Encryption Techniques -- 2.1 Symmetric Cipher Model -- 2.2 Substitution Techniques -- 2.3 Transposition Techniques -- 2.4 Rotor Machines -- 2.5 Steganography -- 2.6 Recommended Reading -- 2.7 Key Terms, Review Questions, and Problems -- Chapter 3 Block Ciphers and the Data Encryption Standard -- 3.1 Traditional Block Cipher Structure -- 3.2 The Data Encryption Standard -- 3.3 A DES Example -- 3.4 The Strength of DES -- 3.5 Block Cipher Design Principles -- 3.6 Recommended Reading -- 3.7 Key Terms, Review Questions, and Problems -- Chapter 4 Basic Concepts in Number Theory and Finite Fields -- 4.1 Divisibility and the Division Algorithm -- 4.2 The Euclidean Algorithm -- 4.3 Modular Arithmetic -- 4.4 Groups, Rings, and Fields -- 4.5 Finite Fields of the Form GF(p) -- 4.6 Polynomial Arithmetic -- 4.7 Finite Fields of the Form GF(2(Sup[n])) -- 4.8 Recommended Reading -- 4.9 Key Terms, Review Questions, and Problems -- Appendix 4A The Meaning of mod -- Chapter 5 Advanced Encryption Standard -- 5.1 Finite Field Arithmetic -- 5.2 AES Structure -- 5.3 AES Transformation Functions -- 5.4 AES Key Expansion -- 5.5 An AES Example -- 5.6 AES Implementation -- 5.7 Recommended Reading -- 5.8 Key Terms, Review Questions, and Problems -- Appendix 5A Polynomials with Coefficients in GF(2(Sup[8])) -- Appendix 5B Simplified AES.
Chapter 6 Block Cipher Operation -- 6.1 Multiple Encryption and Triple DES -- 6.2 Electronic Code book -- 6.3 Cipher Block Chaining Mode -- 6.4 Cipher Feedback Mode -- 6.5 Output Feedback Mode -- 6.6 Counter Mode -- 6.7 XTS-AES Mode for Block-Oriented Storage Devices -- 6.8 Recommended Reading -- 6.9 Key Terms, Review Questions, and Problems -- Chapter 7 Pseudorandom Number Generation and Stream Ciphers -- 7.1 Principles of Pseudorandom Number Generation -- 7.2 Pseudorandom Number Generators -- 7.3 Pseudorandom Number Generation Using a Block Cipher -- 7.4 Stream Ciphers -- 7.5 RC4 -- 7.6 True Random Number Generators -- 7.7 Recommended Reading -- 7.8 Key Terms, Review Questions, and Problems -- PART TWO: ASYMMETRIC CIPHERS -- Chapter 8 More Number Theory -- 8.1 Prime Numbers -- 8.2 Fermat's and Euler's Theorems -- 8.3 Testing for Primality -- 8.4 The Chinese Remainder Theorem -- 8.5 Discrete Logarithms -- 8.6 Recommended Reading -- 8.7 Key Terms, Review Questions, and Problems -- Chapter 9 Public-Key Cryptography and RSA -- 9.1 Principles of Public-Key Cryptosystems -- 9.2 The RSA Algorithm -- 9.3 Recommended Reading -- 9.4 Key Terms, Review Questions, and Problems -- Appendix 9A The Complexity of Algorithms -- Chapter 10 Other Public-Key Cryptosystems -- 10.1 Diffie-Hellman Key Exchange -- 10.2 Elgamal Cryptographic System -- 10.3 Elliptic Curve Arithmetic -- 10.4 Elliptic Curve Cryptography -- 10.5 Pseudorandom Number Generation Based on an Asymmetric Cipher -- 10.6 Recommended Reading -- 10.7 Key Terms, Review Questions, and Problems -- PART THREE: CRYPTOGRAPHIC DATA INTEGRITY ALGORITHMS -- Chapter 11 Cryptographic Hash Functions -- 11.1 Applications of Cryptographic Hash Functions -- 11.2 Two Simple Hash Functions -- 11.3 Requirements and Security -- 11.4 Hash Functions Based on Cipher Block Chaining -- 11.5 Secure Hash Algorithm (SHA). 11.6 SHA-3 -- 11.7 Recommended Reading -- 11.8 Key Terms, Review Questions, and Problems -- Chapter 12 Message Authentication Codes -- 12.1 Message Authentication Requirements -- 12.2 Message Authentication Functions -- 12.3 Requirements for Message Authentication Codes -- 12.4 Security of MACs -- 12.5 MACs Based on Hash Functions: HMAC -- 12.6 MACs Based on Block Ciphers: DAA and CMAC -- 12.7 Authenticated Encryption: CCM and GCM -- 12.8 Key Wrapping -- 12.9 Pseudorandom Number Generation using Hash Functions and MACs -- 12.10 Recommended Reading -- 12.11 Key Terms, Review Questions, and Problems -- Chapter 13 Digital Signatures -- 13.1 Digital Signatures -- 13.2 Elgamal Digital Signature Scheme -- 13.3 Schnorr Digital Signature Scheme -- 13.4 NIST Digital Signature Algorithm -- 13.5 Elliptic Curve Digital Signature Algorithm -- 13.6 RSA-PSS Digital Signature Algorithm -- 13.7 Recommended Reading -- 13.8 Key Terms, Review Questions, and Problems -- PART FOUR: MUTUAL TRUST -- Chapter 14 Key Management and Distribution -- 14.1 Symmetric Key Distribution Using Symmetric Encryption -- 14.2 Symmetric Key Distribution Using Asymmetric Encryption -- 14.3 Distribution of Public Keys -- 14.4 X.509 Certificates -- 14.5 Public-Key Infrastructure -- 14.6 Recommended Reading -- 14.7 Key Terms, Review Questions, and Problems -- Chapter 15 User Authentication -- 15.1 Remote User-Authentication Principles -- 15.2 Remote User-Authentication Using Symmetric Encryption -- 15.3 Kerberos -- 15.4 Remote User Authentication Using Asymmetric Encryption -- 15.5 Federated Identity Management -- 15.6 Personal Identity Verification -- 15.7 Recommended Reading -- 15.8 Key Terms, Review Questions, and Problems -- PART FIVE: NETWORK AND INTERNET SECURITY -- Chapter 16 Network Access Control and Cloud Security -- 16.1 Network Access Control. 16.2 Extensible Authentication Protocol -- 16.3 IEEE 802.1X Port-Based Network Access Control -- 16.4 Cloud Computing -- 16.5 Cloud Security Risks and Countermeasures -- 16.6 Data Protection in the Cloud -- 16.7 Cloud Security as a Service -- 16.8 Recommended Reading -- 16.9 Key Terms, Review Questions, and Problems -- Chapter 17 Transport-Level Security -- 17.1 Web Security Considerations -- 17.2 Secure Sockets Layer -- 17.3 Transport Layer Security -- 17.4 HTTPS -- 17.5 Secure Shell (SSH) -- 17.6 Recommended Reading -- 17.7 Key Terms, Review Questions, and Problems -- Chapter 18 Wireless Network Security -- 18.1 Wireless Security -- 18.2 Mobile Device Security -- 18.3 IEEE 802.11 Wireless LAN Overview -- 18.4 IEEE 802.11i Wireless LAN Security -- 18.5 Recommended Reading -- 18.6 Key Terms, Review Questions, and Problems -- Chapter 19 Electronic Mail Security -- 19.1 Pretty Good Privacy -- 19.2 S/MIME -- 19.3 DomainKeys Identified Mail -- 19.4 Recommended Reading -- 19.5 Key Terms, Review Questions, and Problems -- Appendix 19A Radix-64 Conversion -- Chapter 20 IP Security -- 20.1 IP Security Overview -- 20.2 IP Security Policy -- 20.3 Encapsulating Security Payload -- 20.4 Combining Security Associations -- 20.5 Internet Key Exchange -- 20.6 Cryptographic Suites -- 20.7 Recommended Reading -- 20.8 Key Terms, Review Questions, and Problems -- APPENDICES -- Appendix A Projects for Teaching Cryptography and Network Security -- A.1 Sage Computer Algebra Projects -- A.2 Hacking Project -- A.3 Block Cipher Projects -- A.4 Laboratory Exercises -- A.5 Research Projects -- A.6 Programming Projects -- A.7 Practical Security Assessments -- A.8 Firewall Projects -- A.9 Case Studies -- A.10 Writing Assignments -- A.11 Reading/Report Assignments -- A.12 Discussion Topics -- Appendix B Sage Examples -- B.1 Linear Algebra and Matrix Functionality. B.2 Chapter 2: Classical Encryption -- B.3 Chapter 3: Block Ciphers and the Data Encryption Standard -- B.4 Chapter 4: Basic Concepts in Number Theory and Finite Fields -- B.5 Chapter 5: Advanced Encryption Standard -- B.6 Chapter 6: Pseudorandom Number Generation and Stream Ciphers -- B.7 Chapter 8: Number Theory -- B.8 Chapter 9: Public-Key Cryptography and RSA -- B.9 Chapter 10: Other Public-Key Cryptosystems -- B.10 Chapter 11: Cryptographic Hash Functions -- B.11 Chapter 13: Digital Signatures -- References -- Credits -- Index. |
| Record Nr. | UNINA-9910151655203321 |
Stallings William
|
||
| Boston, [Massachusetts] : , : Pearson, , 2014 | ||
| Multimedia | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Data structures and abstractions with Java / / Frank M. Carrano, Timothy M. Henry ; global edition by Mohit P. Tahiliani
| Data structures and abstractions with Java / / Frank M. Carrano, Timothy M. Henry ; global edition by Mohit P. Tahiliani |
| Autore | Carrano Frank M. |
| Edizione | [Fourth, global edition.] |
| Pubbl/distr/stampa | Boston : , : Pearson, , [2016] |
| Descrizione fisica | 1 online resource (938 pages) : illustrations |
| Disciplina | 005.133 |
| Collana | Always Learning |
| Soggetto topico | Java (Computer program language) |
| ISBN | 1-292-07719-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910154767503321 |
|
Carrano Frank M.
|
||
| Boston : , : Pearson, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Introduction to programming with C++ / / Y. Daniel Liang ; international edition contributions by Mohit P. Tahiliani, NITK Surathkal
| Introduction to programming with C++ / / Y. Daniel Liang ; international edition contributions by Mohit P. Tahiliani, NITK Surathkal |
| Autore | Liang Y. Daniel |
| Edizione | [Third edition, International edition.] |
| Pubbl/distr/stampa | Upper Saddle River : , : Pearson, , [2014] |
| Descrizione fisica | 1 online resource (714 pages) |
| Disciplina | 001.6424 |
| Collana | Always learning |
| Soggetto topico | C (Computer program language) |
| ISBN | 0-273-79419-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Cover -- CONTENTS -- Chapter 1 Introduction to Computers, Programs, and C++ -- 1.1 Introduction -- 1.2 What Is a Computer? -- 1.3 Programming Languages -- 1.4 Operating Systems -- 1.5 History of C++ -- 1.6 A Simple C++ Program -- 1.7 C++ Program-Development Cycle -- 1.8 Programming Style and Documentation -- 1.9 Programming Errors -- Chapter 2 elementary Programming -- 2.1 Introduction -- 2.2 Writing a Simple Program -- 2.3 Reading Input from the Keyboard -- 2.4 Identifiers -- 2.5 Variables -- 2.6 Assignment Statements and Assignment Expressions -- 2.7 Named Constants -- 2.8 Numeric Data Types and Operations -- 2.9 Evaluating Expressions and Operator Precedence -- 2.10 Case Study: Displaying the Current Time -- 2.11 Augmented Assignment Operators -- 2.12 Increment and Decrement Operators -- 2.13 Numeric Type Conversions -- 2.14 Software Development Process -- 2.15 Case Study: Counting Monetary Units -- 2.16 Common Errors -- Chapter 3 Selections -- 3.1 Introduction -- 3.2 The bool Data Type -- 3.3 if Statements -- 3.4 Two-Way if-else Statements -- 3.5 Nested if and Multi-Way if-else Statements -- 3.6 Common Errors and Pitfalls -- 3.7 Case Study: Computing Body Mass Index -- 3.8 Case Study: Computing Taxes -- 3.9 Generating Random Numbers -- 3.10 Logical Operators -- 3.11 Case Study: Determining Leap Year -- 3.12 Case Study: Lottery -- 3.13 Switch Statements -- 3.14 Conditional Expressions -- 3.15 Operator Precedence and Associativity -- 3.16 Debugging -- Chapter 4 Mathematical Functions, Characters, and Strings -- 4.1 Introduction -- 4.2 Mathematical Functions -- 4.3 Character Data Type and Operations -- 4.4 Case Study: Generating Random Characters -- 4.5 Case Study: Guessing Birthdays -- 4.6 Character Functions -- 4.7 Case Study: Converting a Hexadecimal Digit to a Decimal Value -- 4.8 The string Type.
4.9 Case Study: Revising the Lottery Program Using Strings -- 4.10 Formatting Console Output -- 4.11 Simple File Input and Output -- Chapter 5 Loops -- 5.1 Introduction -- 5.2 The while Loop -- 5.3 The do-while Loop -- 5.4 The for Loop -- 5.5 Which Loop to Use? -- 5.6 Nested Loops -- 5.7 Minimizing Numeric Errors -- 5.8 Case Studies -- 5.9 Keywords break and continue -- 5.10 Case Study: Checking Palindromes -- 5.11 Case Study: Displaying Prime Numbers -- Chapter 6 Functions -- 6.1 Introduction -- 6.2 Defining a Function -- 6.3 Calling a Function -- 6.4 void Functions -- 6.5 Passing Arguments by Value -- 6.6 Modularizing Code -- 6.7 Overloading Functions -- 6.8 Function Prototypes -- 6.9 Default Arguments -- 6.10 Inline Functions -- 6.11 Local, Global, and Static Local Variables -- 6.12 Passing Arguments by Reference -- 6.13 Constant Reference Parameters -- 6.14 Case Study: Converting Hexadecimals to Decimals -- 6.15 Function Abstraction and Stepwise Refinement -- Chapter 7 Single-Dimensional Arrays and C-Strings -- 7.1 Introduction -- 7.2 Array Basics -- 7.3 Problem: Lotto Numbers -- 7.4 Problem: Deck of Cards -- 7.5 Passing Arrays to Functions -- 7.6 Preventing Changes of Array Arguments in Functions -- 7.7 Returning Arrays from Functions -- 7.8 Problem: Counting the Occurrences of Each Letter -- 7.9 Searching Arrays -- 7.10 Sorting Arrays -- 7.11 C-Strings -- Chapter 8 Multidimensional Arrays -- 8.1 Introduction -- 8.2 Declaring Two-Dimensional Arrays -- 8.3 Processing Two-Dimensional Arrays -- 8.4 Passing Two-Dimensional Arrays to Functions -- 8.5 Problem: Grading a Multiple-Choice Test -- 8.6 Problem: Finding a Closest Pair -- 8.7 Problem: Sudoku -- 8.8 Multidimensional Arrays -- Chapter 9 Objects and Classes -- 9.1 Introduction -- 9.2 Defining Classes for Objects -- 9.3 Example: Defining Classes and Creating Objects -- 9.4 Constructors. 9.5 Constructing and Using Objects -- 9.6 Separating Class Definition from Implementation -- 9.7 Preventing Multiple Inclusions -- 9.8 Inline Functions in Classes -- 9.9 Data Field Encapsulation -- 9.10 The Scope of Variables -- 9.11 Class Abstraction and Encapsulation -- Chapter 10 Object-Oriented Thinking -- 10.1 Introduction -- 10.2 The string Class -- 10.3 Passing Objects to Functions -- 10.4 Array of Objects -- 10.5 Instance and Static Members -- 10.6 Constant Member Functions -- 10.7 Thinking in Objects -- 10.8 Object Composition -- 10.9 Case Study: The StackOfIntegers Class -- 10.10 Class Design Guidelines -- Chapter 11 Pointers and Dynamic Memory Management -- 11.1 Introduction -- 11.2 Pointer Basics -- 11.3 Defining Synonymous Types Using the typedef Keyword -- 11.4 Using const with Pointers -- 11.5 Arrays and Pointers -- 11.6 Passing Pointer Arguments in a Function Call -- 11.7 Returning a Pointer from Functions -- 11.8 Useful Array Functions -- 11.9 Dynamic Persistent Memory Allocation -- 11.10 Creating and Accessing Dynamic Objects -- 11.11 The this Pointer -- 11.12 Destructors -- 11.13 Case Study: The Course Class -- 11.14 Copy Constructors -- 11.15 Customizing Copy Constructors -- Chapter 12 Templates, Vectors, and Stacks -- 12.1 Introduction -- 12.2 Templates Basics -- 12.3 Example: A Generic Sort -- 12.4 Class Templates -- 12.5 Improving the Stack Class -- 12.6 The C++ vector Class -- 12.7 Replacing Arrays Using the vector Class -- 12.8 Case Study: Evaluating Expressions -- Chapter 13 File Input and Output -- 13.1 Introduction -- 13.2 Text I/O -- 13.3 Formatting Output -- 13.4 Functions: getline, get, and put -- 13.5 fstream and File Open Modes -- 13.6 Testing Stream States -- 13.7 Binary I/O -- 13.8 Random Access File -- 13.9 Updating Files -- Chapter 14 Operator Overloading -- 14.1 Introduction -- 14.2 The Rational Class. 14.3 Operator Functions -- 14.4 Overloading the Subscript Operator [] -- 14.5 Overloading Augmented Assignment Operators -- 14.6 Overloading the Unary Operators -- 14.7 Overloading the ++ and -- Operators -- 14.8 friend Functions and friend Classes -- 14.9 Overloading the < -- < -- and > -- > -- Operators -- 14.10 Automatic Type Conversions -- 14.11 Defining Nonmember Functions for Overloading Operators -- 14.12 The Rational Class with Overloaded Function Operators -- 14.13 Overloading the = Operators -- Chapter 15 Inheritance and Polymorphism -- 15.1 Introduction -- 15.2 Base Classes and Derived Classes -- 15.3 Generic Programming -- 15.4 Constructors and Destructors -- 15.5 Redefining Functions -- 15.6 Polymorphism -- 15.7 Virtual Functions and Dynamic Binding -- 15.8 The protected Keyword -- 15.9 Abstract Classes and Pure Virtual Functions -- 15.10 Casting: static_cast versus dynamic_cast -- Chapter 16 Exception Handling -- 16.1 Introduction -- 16.2 Exception-Handling Overview -- 16.3 Exception-Handling Advantages -- 16.4 Exception Classes -- 16.5 Custom Exception Classes -- 16.6 Multiple Catches -- 16.7 Exception Propagation -- 16.8 Rethrowing Exceptions -- 16.9 Exception Specification -- 16.10 When to Use Exceptions -- Chapter 17 Recursion -- 17.1 Introduction -- 17.2 Example: Factorials -- 17.3 Case Study: Fibonacci Numbers -- 17.4 Problem Solving Using Recursion -- 17.5 Recursive Helper Functions -- 17.6 Towers of Hanoi -- 17.7 Eight Queens -- 17.8 Recursion versus Iteration -- 17.9 Tail Recursion -- APPENDIXES -- Appendix A: C++ Keywords -- Appendix B: The ASCII Character Set -- Appendix C: Operator Precedence Chart -- Appendix D: Number Systems -- Appendix E: Bitwise Operations -- INDEX -- CREDIT. |
| Record Nr. | UNINA-9910151658103321 |
|
Liang Y. Daniel
|
||
| Upper Saddle River : , : Pearson, , [2014] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||