Problems in Cryptography and Cryptanalysis

View Sample PDF

Author(s): Kannan Balasubramanian (Mepco Schlenk Engineering College, India)and Rajakani M. (Mepco Schlenk Engineering College, India)
Copyright: 2021
Pages: 17
Source title: Research Anthology on Blockchain Technology in Business, Healthcare, Education, and Government
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-7998-5351-0.ch048

Keywords: Data Management / Data Mining and Databases / Information Science Reference / Knowledge Management and Library Science

Purchase

View Problems in Cryptography and Cryptanalysis on the publisher's website for pricing and purchasing information.

Abstract

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 traditionally considered the difficult problems and used extensively in the design of cryptographic algorithms. We provide a number of other computationally difficult problems in the areas of Cryptography and Cryptanalysis. A class of problems called the Search problems, Group membership problems, and the Discrete Optimization problems are examples of such problems. A number of computationally difficult problems in Cryptanalysis have also been identified including the Cryptanalysis of Block ciphers, Pseudo-Random Number Generators and Hash functions.

The IRMA Community

Research IRM

Problems in Cryptography and Cryptanalysis

Purchase

Abstract

Related Content

IRMA Sponsors