book

Practical Cryptography

by Saiful Azad, Al-Sakib Khan Pathan

November 2014

Intermediate to advanced

365 pages

6h 56m

English

Auerbach Publications

Read now

Unlock full access

Cover Page
Title Page
Copyright Page
Preface
Acknowledgments
About the Editors
Contributors
Chapter 1: Basics of Security and Cryptography
1.1 The Perimeter of Cryptography in Practice1.2 Things That Cryptographic Technologies Cannot Do
Chapter 2: Classical Cryptographic Algorithms
2.1 Caesar Cipher2.1.1 Algorithm2.1.2 Implementation2.1.3 Limitations2.2 Monoalphabetic Cipher2.2.1 Algorithm2.2.2 Implementation2.2.3 Limitations2.3 Playfair Cipher2.3.1 Algorithm2.3.2 Implementation2.3.3 Limitations2.4 Polyalphabetic Cipher2.4.1 Algorithm2.4.2 Implementation2.4.3 Limitations
Chapter 3: Rotor Machine
3.1 Background3.2 Basic Concept3.3 Systematization3.4 Algorithm3.5 Implementation3.6 LimitationsReference

Chapter 4: Block Cipher
4.1 Block Cipher Principles4.2 The Feistel Block Structure4.3 Block Cipher Modes4.3.1 Electronic Codebook (ECB) Mode4.3.2 Cipher Block Chaining (CBC)4.3.3 Cipher Feedback (CFB) Mode4.3.4 Output Feedback (OFB) Mode4.3.5 Counter (CTR) ModeReferences
Chapter 5: Data Encryption Standard
5.1 Primitive Operations5.1.1 Operations for Encryption/Decryption5.1.2 Operations for Subkey Generation5.2 Basic Structure5.3 DES Encryption Algorithm5.4 DES Decryption Algorithm5.5 Implementation5.5.1 C++ Library Headers5.5.2 The DES Class5.5.3 Introducing the Member Variables of DES Class5.5.4 Introducing the Member Functions of DES Class5.5.5 The Keygen() Function5.5.6 The PermChoice1() Function5.5.7 The Split_Key() Function5.5.8 The PermChoice2() Function5.5.9 The Encrypt(char *) Function5.5.10 The IP() Function5.5.11 The Expansion() Function5.5.12 The xor_oneE(int round) Function5.5.13 The Substitution() Function5.5.14 The Permutation() Function5.5.15 The xor_two() Function5.5.16 The Decrypt(char *) Function5.5.17 The Main() Function
Chapter 6: Advanced Encryption Standard
6.1 Overview6.2 History6.3 Design Consideration6.4 Primitive Operations of AES6.5 Structure of AES6.6 Overview of Key Expansion6.7 Key Expansion Example6.8 Encryption6.9 An Encryption Example6.10 Decryption6.11 Limitations6.12 Pros and Cons of AES6.13 Implementation6.14 Conclusion
Chapter 7: Asymmetric Key Algorithms
7.1 Basic Concept7.2 Applications of Asymmetric Key Algorithms7.2.1 Encryption/Decryption7.2.2 Digital Signature7.2.3 Encryption and Digital Signature
Chapter 8: The RSA Algorithm
8.1 The Concept8.2 Operations8.2.1 Key Generation8.2.2 Encryption8.2.3 Decryption8.3 Applications of the RSA Algorithm8.4 Implementation Code
Chapter 9: Elliptic Curve Cryptography
9.1 Introduction9.2 Elliptic Curves over R9.3 Elliptic Curves over ZP9.3.1 Adding Points in Elliptic Curves over ZP9.3.2 Scalar Multiplication9.4 Discrete Logarithm Problem9.5 Elliptic Curve Cryptography9.5.1 Elliptic Curve Diffie–Hellman Key Exchange9.5.2 Key Exchange Example9.5.3 Elliptic Curve Encryption/Decryption9.5.4 Encryption/Decryption Example9.6 Implementation 19.7 Implementation 2References
Chapter 10: Message Digest Algorithm 5
10.1 General Properties and Vulnerabilities10.2 Design Principle10.3 Algorithm Description10.3.1 Add Padding Bits behind the Input Message10.3.2 Add a 64-Bit Binary String That Is the Representation of the Message’s Length10.3.3 Initialize Four 32-Bit Values10.3.4 Compress Every 512-Bit Block10.3.5 Generate the 128-Bit Output10.4 An Example10.5 Implementation 110.6 Implementation 210.7 ConclusionReferences
Chapter 11: Secure Hash Algorithm
11.1 Basic Hash Function Concept11.2 Applications11.3 Steps of SHA-111.3.1 Appending Original Message Lengths and Padding11.3.2 Initialization11.3.3 Message Processing11.3.4 Output11.4 An Example11.5 Implementation11.6 Conclusion
Chapter 12: Fundamentals of Identity Based Cryptography
12.1 Introduction to Cryptography12.1.1 Symmetric Cryptography12.1.2 Asymmetric Cryptography12.1.3 Diffie–Hellman (DH) Algorithms12.1.4 Rivest, Shamir, and Adleman (RSA) Algorithms12.1.5 Elliptic Curve Cryptography (ECC)12.1.5.1 ECC Key Generation12.1.5.2 Elliptic Curve Digital Signature Algorithm12.2 ID-Based Cryptography12.2.1 ID-Based Key Construction12.2.2 Pairing Functions12.2.3 Examples of ID-Based Encryption Schemes12.2.3.1 Boneh and Franklin Encryption Scheme12.2.3.2 Boneh and Boyen Encryption Schemes12.2.3.3 Chen et al. Encryption Scheme12.2.4 Examples of ID-Based Signature Algorithms12.2.4.1 Paterson Signature Scheme12.2.4.2 Hess Signature Scheme12.2.4.3 Barreto et al. Signature Scheme12.2.5 Arguments in Favor of IBC12.2.6 Use of IBC in Network Security12.3 ConclusionReferences
Chapter 13: Symmetric Key Encryption Acceleration on Heterogeneous Many Core Architectures
13.1 Introduction13.2 Modern Heterogeneous Many-Core Architectures13.3 The OpenCL Programming Model13.3.1 OpenCL Parallel Execution Model13.3.2 OpenCL Memory Model13.3.3 First OpenCL Example13.4 Implementing AES in OpenCL13.4.1 The AES Block Cipher13.4.2 Modes of Operation13.4.3 AES Kernels13.4.4 AES Host Library13.4.5 Putting It All Together13.5 Implementation13.6 Concluding RemarksReferences
Chapter 14: Methods and Algorithms for Fast Hashing in Data Streaming
14.1 Introduction and Practical Situations14.2 Terminology14.3 The Data Streaming Problem14.3.1 Related Information Theory and Formulations14.3.2 Practical Applications and Designs14.3.3 Current Research Topics14.4 Simple 32-Bit Fast Hashing14.4.1 Hashing and Blooming Basics14.4.2 Traditional Hashing Methods14.4.3 Hashing by Bit Manipulation14.4.4 Quality Evaluation of Hash Functions14.4.5 Example Designs for Fast Hashing14.5 Practical Data Streaming14.5.1 Distributions in Practice14.5.2 Bloom Filters: Store, Lookup, and Efficiency14.5.3 Unconventional Bloom Filter Designs for Data Streams14.5.4 Practical Data Streaming Targets14.5.5 Higher-Complexity Data Streaming Targets14.6 Practical Fast Hashing and Blooming14.6.1 Arbitrary Bit Length Hashing14.6.2 Arbitrary Length Bloom Filters14.6.3 Hardware Implementation14.7 Practical Example: High-Speed Packet Traffic Processor14.7.1 Example Data Streaming Target14.7.2 Design for Hashing and Data Structures14.8 SummaryReferences
Footnotes
Chapter 8: The RSA AlgorithmChapter 13: Symmetric Key Encryption Acceleration on Heterogeneous Many-Core Architectures
Cryptography / Information Security

Content preview from Practical Cryptography

11SECURE HASH ALGORITHM

SADDAM HOSSAIN MUKTA AND SAIFUL AZAD

Contents

Keywords

11.1 Basic Hash Function Concept

11.2 Applications

11.3 Steps of SHA-1

11.3.1 Appending Original Message Lengths and Padding

11.3.2 Initialization

11.3.3 Message Processing

Keywords

Authentication check

Hash function

Integrity check

Secure Hash Algorithm

SHA-1

In 1990, Ron Rivest invented an algorithm utilizing the concept of hash function, called Message Digest 4 (MD4). He extended that algorithm in 1992, and named it Message Digest 5 (MD5). Later in 1993, the National Institute of Standards and Technology (NIST) developed and published an algorithm as a Federal Information Processing Standard (FIPS ...

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

Publisher Resources

ISBN: 9781482228892

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Practical Cryptography

by Saiful Azad, Al-Sakib Khan Pathan

11SECURE HASH ALGORITHM