Algorithmic Strategies for Solving Complex Problems in Cryptography

Algorithmic Strategies for Solving Complex Problems in Cryptography

Kannan Balasubramanian, M. Rajakani

Copyright: © 2018 |Pages: 302

ISBN13: 9781522529156|ISBN10: 1522529152|EISBN13: 9781522529163

DOI: 10.4018/978-1-5225-2915-6

Cite Book Cite Book

MLA

Balasubramanian, Kannan, and M. Rajakani, editors. Algorithmic Strategies for Solving Complex Problems in Cryptography. IGI Global, 2018. https://doi.org/10.4018/978-1-5225-2915-6

APA

Balasubramanian, K. & Rajakani, M. (Eds.). (2018). Algorithmic Strategies for Solving Complex Problems in Cryptography. IGI Global. https://doi.org/10.4018/978-1-5225-2915-6

Chicago

Balasubramanian, Kannan, and M. Rajakani, eds. Algorithmic Strategies for Solving Complex Problems in Cryptography. Hershey, PA: IGI Global, 2018. https://doi.org/10.4018/978-1-5225-2915-6

Export Reference

Favorite Full-Book Download

Cryptography is a field that is constantly advancing, due to exponential growth in new technologies within the past few decades. Applying strategic algorithms to cryptic issues can help save time and energy in solving the expanding problems within this field.

Algorithmic Strategies for Solving Complex Problems in Cryptography is an essential reference source that discusses the evolution and current trends in cryptology, and it offers new insight into how to use strategic algorithms to aid in solving intricate difficulties within this domain. Featuring relevant topics such as hash functions, homomorphic encryption schemes, two party computation, and integer factoring, this publication is ideal for academicians, graduate students, engineers, professionals, and researchers interested in expanding their knowledge of current trends and techniques within the cryptology field.

Table of Contents

Reset

Front Materials

Title Page

Copyright Page

Advances in Information Security, Privacy, and Ethics (AISPE) Book Series

Preface

Acknowledgment

Chapters

Chapter 1

Recent Developments in Cryptography: A Survey (pages 1-22)

Kannan Balasubramanian

The field of cryptography has seen enormous changes ever since the invention of Public Key Cryptography by Diffie and Hellman. The algorithms for complex problems like integer factorization, Discrete Logarithms and Elliptic Curve...

Chapter 2

Problems in Cryptography and Cryptanalysis (pages 23-39)

Kannan Balasubramanian, Rajakani M.

The integer factorization problem used in the RSA cryptosystem, the discrete logarithm problem used in Diffie-Hellman Key Exchange protocol and the Elliptic Curve Discrete Logarithm problem used in Elliptic Curve Cryptography are...

Chapter 3

Variants of the Diffie-Hellman Problem (pages 40-54)

Kannan Balasubramanian

Many variations of the Diffie-Hellman problem exist that can be shown to be equivalent to one another. We consider following variations of Diffie-Hellman problem: square computational and Square decisional Diffie-Hellman problem...

Chapter 4

Secure Group Key Agreement Protocols (pages 55-65)

Kannan Balasubramanian, Mala K.

This chapter focusses on Secure Key Exchange protocols executed among a group of parties, called group key exchange (GKE) protocols. Authentication and Key Establishment are very important in any secure communication. Authentication...

Chapter 5

Hash Functions and Their Applications (pages 66-77)

Kannan Balasubramanian

Cryptographic Hash Functions are used to achieve a number of Security goals like Message Authentication, Message Integrity, and are also used to implement Digital Signatures (Non-repudiation), and Entity Authentication. This chapter...

Chapter 6

Efficient Implementation of Digital Signature Algorithms (pages 78-86)

Sumathi Doraikannan

Digital Signature is considered as an authentication tool of electronic records. The main benefits of the digital signature are cost, security, time stamping, non-repudiation and speed. Digital signature can be particularly useful...

Chapter 7

Attacks on Implementation of Cryptographic Algorithms (pages 87-96)

Kannan Balasubramanian, M. Rajakani

This chapter investigates the implementation attacks on cryptographic algorithms. The implementation attacks can be defined as invasive or non-invasive. The major attack types are Probing attacks, Fault Induction attacks, timing...

Chapter 8

Homomorphic Encryption Schemes: A Survey (pages 97-110)

Kannan Balasubramanian, Jayanthi Mathanan

Homomorphic encryption is a technique that enables mathematical operations to be performed on encrypted data. This type of encryption can be used to perform operations on encrypted data by a server without having to provide the key....

Chapter 9

Zero Knowledge Proofs: A Survey (pages 111-123)

Kannan Balasubramanian, Mala K.

Zero knowledge protocols provide a way of proving that a statement is true without revealing anything other than the correctness of the claim. Zero knowledge protocols have practical applications in cryptography and are used in many...

Chapter 10

Cryptographic Voting Protocols (pages 124-133)

Kannan Balasubramanian, Jayanthi Mathanan

Most of the voting protocols proposed so far can be categorized into two main types based on the approach taken: schemes using blind signatures and schemes using homomorphic encryption. In the schemes using blind signatures, the...

Chapter 11

Securing Public Key Encryption Against Adaptive Chosen Ciphertext Attacks (pages 134-144)

Kannan Balasubramanian

To deal with active attacks in public key encryptions, the notion of security against an adaptive chosen ciphertext attack has been defined by Researchers. If an adversary can inject messages into a network, these messages may be...

Chapter 12

Secure Two Party Computation (pages 145-153)

Kannan Balasubramanian

The goal of secure two-party computation is to enable two parties to cooperatively evaluate a function that takes private data from both parties as input without exposing any of the private data. At the end of the computation, the...

Chapter 13

Secure Multiparty Computation (pages 154-166)

Kannan Balasubramanian, M. Rajakani

The Secure Multiparty computation is characterized by computation by a set of multiple parties each participating using the private input they have. There are different types of models for Secure Multiparty computation based on...

Chapter 14

Secure Bootstrapping Using the Trusted Platform Module (pages 167-185)

Kannan Balasubramanian, Ahmed Mahmoud Abbas

The protection of Computer Hardware and Software using Cryptographic algorithms has assumed importance in the recent years. The Trusted Computing Group (TCG) has put forward certain conditions to be met by the computer hardware...

Chapter 15

Experiments with the Cryptool Software (pages 186-194)

Kannan Balasubramanian

Researchers have developed many different types of software for implementing Cryptography algorithms. One such software is Cryptool. This software can be used to demonstrate many Classical Cryptosystems and symmetric-Key...

Chapter 16

A Software Library for Multi Precision Arithmetic (pages 195-227)

Kannan Balasubramanian, Ahmed Mahmoud Abbas

The most prevalent need for multiple precision arithmetic, often referred to as “bignum” math, is within the implementation of public key cryptography algorithms. Algorithms such as RSA and Diffie-Hellman require integers of...

Chapter 17

Integer Factoring Algorithms (pages 228-240)

Kannan Balasubramanian, Ahmed Mahmoud Abbas

Most cryptographic systems are based on an underlying difficult problem. The RSA cryptosystem and many other cryptosystems rely on the fact that factoring a large composite number into two prime numbers is a hard problem. The are...

Chapter 18

The Quadratic Sieve Algorithm for Integer Factoring (pages 241-252)

Kannan Balasubramanian, M. Rajakani

At the time when RSA was invented in 1977, factoring integers with as few as 80 decimal digits was intractable. The first major breakthrough was quadratic sieve, a relatively simple factoring algorithm invented by Carl Pomerance in...

Back Materials

Related References

Compilation of References

About the Contributors

Index

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.

Username or email: *

Password: *

Forgot individual login password?

Create individual account