book

Cryptography and Network Security

Name: Cryptography and Network Security
ISBN: 9789332579125

by Ajay Kumar, S. Bose

March 2016

Intermediate to advanced

544 pages

14h 59m

English

Pearson Education India

Read now

Unlock full access

Cover
Title Page
Contents
Foreword - 1
Foreword - 2
Preface
Acknowledgements
CHAPTER 1 Cryptography
1.1 Overview of Cryptography1.2 Security Trends1.3 The Open Systems Interconnection Security Architecture1.4 Security Attacks1.4.1 Passive Attacks1.4.2 Active Attacks1.5 Security Services1.5.1 Authentication1.5.2 Access Control1.5.3 Data Confidentiality1.5.4 Non-repudiation1.5.5 Data IntegrityKey TermsSummarySummaryReferences
CHAPTER 2 Mathematics of Modern Cryptography
2.1 Basic Number Theory2.1.1 Basic Notations2.1.2 Congruence2.1.3 Modular Exponentiation2.1.4 Greatest Common Divisor Computation2.2 Chinese Remainder Theorem2.2.1 Secure Multicasting using CRT2.2.2 Implementation of CRT in JAVA2.3 Fermat’s and Euler’s Theorem2.4 Algebraic Structure2.4.1 Group2.4.2 Ring2.4.3 Field2.4.4 Galois Fields2.4.5 Legendre and Jacobi Symbols2.4.6 Continued Fraction2.5 Primality Testing Methods2.5.1 Naive Algorithm2.5.2 Sieve of Eratosthenes Method2.5.3 Fermat’s Primality Test2.5.4 Miller–Rabin Primality Test2.6 Factorization2.6.1 Prime Factorization Method2.6.2 Trial Division Method2.6.3 Fermat’s Factorization Method2.6.4 Pollard’s rho MethodKey TermsSummarySummary
CHAPTER 3 Classical Encryption Techniques
3.1 Conventional Encryption3.1.1 The Conventional Encryption Model3.1.2 Types of Attacks3.2 Substitution Techniques3.2.1 Caesar Cipher (Z+n)743.2.2 Affine Cipher (Z*n)763.2.3 Playfair Cipher3.2.4 Vigenere Cipher3.2.5 Vernam One-Time Pad Cipher3.2.6 Hill Cipher (Z*n)833.3 Transposition Techniques3.3.1 Rail Fence Cipher3.3.2 Column Transposition3.4 Steganography3.4.1 Modern Steganography Techniques3.4.2 Attacks on Steganography3.4.3 Applications3.5 Linear Feedback Shift Registers3.5.1 Linear Recurrence Relation3.5.2 LFSR OperationKey TermsSummarySummary

CHAPTER 4 Data Encryption Standard
4.1 Simplified Data Encryption Standard4.1.1 S-DES Encryption4.1.2 Key Expansion Process4.1.3 S-DES Decryption4.2 Data Encryption Standard4.2.1 DES Encryption and Decryption4.2.2 DES Key Expansion4.2.3 DES Decryption4.3 Strength of DES4.3.1 Brute-force Attack4.3.2 Differential Cryptanalysis4.3.3 Linear Cryptanalysis4.4 Modes of Operation4.4.1 Electronic Code Book Mode4.4.2 Cipher Block Chaining Mode4.4.3 Cipher Feedback Mode4.4.4 Output Feedback Mode4.4.5 Counter ModeKey TermsSummarySummaryReferences
Chapter 5 Secure Block Cipher and Stream Cipher Technique
5.1 Need for Double DES and Triple DES5.2 Double DES5.2.1 Meet-in-the-Middle Attack5.2.2 Attacking Scenario5.3 Triple DES5.4 Pseudo Random Number Generator5.4.1 Linear Congruential Generator5.4.2 Blum Blum Shub Generator5.5 RC5.5.1 Principle of RC5.5.2 The Key-scheduling Algorithm5.5.3 The Pseudo Random Generation Algorithm5.5.4 Encryption and Decryption5.6 RC5.6.1 Principles of RC5.6.2 RC5 Key Expansion5.6.3 RC5 Encryption5.6.4 RC5 Decryption5.7 International Data Encryption Algorithm5.7.1 Principles of IDEA5.7.2 Key Expansion5.7.3 IDEA Encryption and Decryption5.8 Blowfish Encryption5.8.1 Principles of Blowfish5.8.2 Key Expansion5.8.3 Encryption and Decryption5.9 CAST-1281725.9.1 CAST-128 Algorithm5.9.2 Strength of CAST5.10 RC5.10.1 Key Expansion Process5.10.2 Encryption Algorithm5.10.3 Decryption OperationKey TermsSummarySummaryReferences
Chapter 6 Advanced Encryption Standard (AES)187
6.1 AES Introduction (GF(2n))1876.2 Working Principle of the AES6.3 AES Encryption and Decryption6.4 AES Key Expansion Algorithm6.5 AES Exercises Based on GF (28)197Key TermsSummarySummaryReferences
Chapter 7 Public Key Cryptosystem
7.1 Introduction to Public-Key Cryptosystem7.2 RSA Algorithm7.3 Attacks on RSA7.3.1 Brute-Force Attack7.3.2 Mathematical Attack7.3.3 Timing Attack7.4 JAVA Implementation of RSA7.5 Knapsack Cryptosystem7.5.1 Definition7.5.2 Superincreasing Knapsack7.5.3 Encryption and Decryption Algorithm for Knapsack Cryptosystem7.5.4 Secret Communication using KnapsackKey TermsSummarySummaryReferences
Chapter 8 Key Management and Key Distribution
8.1 Introduction to Key Management8.2 Centralized vs Distributed Key Management8.2.1 Key Generation8.2.2 Key Distribution8.2.3 Key Updating8.3 Diffie–Hellman Key Exchange8.3.1 Diffie–Hellman Key Exchange Algorithm8.3.2 Discrete Logarithms8.4 Computing Discrete Logarithms8.4.1 Baby Step, Giant Step8.4.2 Index Calculus8.5 Man-In-The-Middle Attack8.6 JAVA Implementation of Diffie–HellmanKey Exchange Algorithm8.7 Secure Multicast Communication Based onDiffie–Hellman Key Exchange8.7.1 Introduction8.7.2 Key Computation Protocol8.8 Computation-Efficient Secure Multicast KeyManagement Based on Greatest Common Divisor8.8.1 Introduction8.8.2 Clustered Tree-based Key ManagementScheme8.9 JAVA Implementation of Secure Multicast KeyManagement Based on GCDKey TermsSummarySummaryReferences
Chapter 9 Elliptic Curve Cryptography
9.1 Introduction9.2 ECC Arithmetic9.2.1 Elliptic Curve Operations9.2.2 Geometric Description of Addition9.2.3 Arithmetic Description of Point Addition9.2.4 Point Multiplication9.2.5 Elliptic Curve Over Zp2619.3 Diffie–Hellman Key Exchange using Elliptic Curves9.4 Elgamal Cryptosystem using Elliptic Curves9.5 ECC-Based Elgamal Digital SignatureKey TermsSummarySummaryReferences
Chapter 10 Authentication Techniques
10.1 Message Authentication10.1.1 Message AuthenticationRequirements10.1.2 Message Authentication Functions10.2 Hash Functions10.2.1 Requirements of Hash Functions10.2.2 Security of Hash Functions10.3 Message Authentication Code10.3.1 Requirements of MAC10.3.2 Security of MAC10.4 Authentication Algorithms10.4.1 MD10.4.2 Secure Hash Algorithms10.4.3 Birthday Attacks10.4.4 RIPEMD-16028210.4.5 Hash Message Authentication Code10.4.6 WhirlpoolKey TermsSummarySummary
Chapter 11 Digital Signature
11.1 Introduction to Digital Signature11.1.1 Uses of Digital Signature11.1.2 Comparison of Digital Signature withDigital Certificate11.1.3 Digital Signature Standard11.2 Digital Signature Schemes11.2.1 ElGamal Signature Scheme29911.2.2 DSA Signature Scheme11.2.3 RSA Signature Scheme11.2.4 Fiat–Shamir Signature Scheme11.2.5 Lamport Signature Scheme11.2.6 Chaum–Antwerpen Undeniable Signature Scheme11.2.7 Chaum’s Blind Signature Scheme11.2.8 Ong–Schnorr–Shamir Subliminal ChannelSignature Scheme11.2.9 Heyst–Pedersen Signature Scheme11.2.10 Probabilistic Signature Scheme11.3 Batch Digital Signature Algorithm11.3.1 Naccache et al. Batch Verification Algorithm11.3.2 Lim and Lee’s Attack11.4 Attacks On Digital Signature11.4.1 Problem11.4.2 Attacks11.5 Merits and Demerits of Digital Signature Schemes11.6 Java Implementation of DSA11.6.1 History11.6.2 DSA Implementation using JCA11.6.3 Security Considerations while ImplementingDigital Signature11.6.4 Simple Batch Processing of DSAKey TermsSummarySummary
Chapter 12 Authentication Applications
12.1 Kerberos12.1.1 Kerberos Terminologies12.1.2 Kerberos Version 432812.1.3 Kerberos Version 533012.2 X.509 Authentication Services12.2.1 X.509 Formats12.2.2 Version 3 X.509 Certificates12.3 Public Key Infrastructure12.3.1 PKI Management Model12.3.2 PKI Management OperationsKey TermsSummarySummary
Chapter 13 Application Layer Security
13.1 Web Security13.1.1 Web Security Threats and Countermeasures13.2 Secure Electronic Transaction13.2.1 Actors in SET13.2.2 Functionality of SET13.2.3 SET Algorithms13.3 E-Mail Security13.3.1 Pretty Good Privacy13.3.2 Secure/Multipurpose Internet Mail Extensions 34913.4 Case Study13.4.1 Case Study of PGP13.4.2 Case Study of S/MIME13.5 Secure Hypertext Transfer ProtocolKey TermsSummarySummary
Chapter 14 Transport Layer Security
14.1 Secure Socket Layer14.1.1 SSL Architecture14.1.2 Working of SSL14.1.3 SSL Applications14.1.4 Issues in SSL14.2 Wired TLS 36214.2.1 TLS Architecture14.2.2 Working of TLS14.2.3 TLS Applications14.2.4 Issues in TLS14.3 Wireless Transport Layer Security14.3.1 WTLS Architecture14.3.2 Working of the WTLS14.3.3 WTLS Applications 36614.3.4 Issues in the WTLS14.4 Comparison of SSL and TLS 367Key TermsSummarySummary
Chapter 15 IP Security
15.1 IP Security15.1.1 IP Security Overview15.2 IP Security Architecture15.2.1 IP Security Policy15.3 IP Datagram15.4 IPsec Authentication Header15.4.1 AH Format15.4.2 AH Datagram Placement and Linking15.5 IPsec Encapsulating Security Payload15.5.1 ESP Format15.5.2 ESP Field Calculation and Placement15.6 Applications of IPsec15.7 Security Issues with IPsecKey TermsSummarySummary
Chapter 16 System Security
16.1 Password16.1.1 Password Management16.1.2 Password Usage16.1.3 Password Management System 38416.2 Program Security16.2.1 Malware16.2.2 Malware Propagation 38516.2.3 Malware Detection 38616.2.4 Viruses16.2.5 Case Study16.3 OS Security16.3.1 Operating System16.3.2 Trusted OSs16.3.3 Security Policies16.3.4 Features of Trusted OS16.3.5 The Attacks on the System16.3.6 Models of Security16.3.7 Design of a Trusted OS16.4 Network Security16.4.1 Intrusion Detection System16.4.2 Firewall16.4.3 Types of Firewall 39816.5 Database Security16.5.1 DB Security Requirements16.5.2 DB Vulnerabilities and Attacks16.5.3 SQL Injection16.5.4 SQL Injection CountermeasuresKey TermsSummarySummary
Appendix: Frequently Asked University Questions with Solutions

Content preview from Cryptography and Network Security

Chapter 2 Mathematics of Modern Cryptography

2.1 Basic Number Theory

Number theory is the process of learning the integers and the properties of objects made out of integers (for example, rational numbers) or generalizations of the integers. Number theory plays a vital role in the field of security, memory management, authentication and coding theory. Because, in many cryptographic algorithms used in the field of security, authentication and coding theory, the messages are represented as integer numbers. These integer numbers are converted into some other format before sending it to receiver side. Fermat’s theorem provides a good example of the importance of the number theory. Fermat asked a question that, can prime p be written as the sum ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Express Learning: Cryptography and Network Security

Publisher Resources

ISBN: 9789332579125

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Cryptography and Network Security

by Ajay Kumar, S. Bose

Chapter 2