Open AccessAttacking the Knapsack Public-key Cryptosystem
Author(s) -
Rifaat Z. Khalaf,
Hamza B. Habib,
Thakwan Akram Jawad
Publication year - 2022
Publication title -
webology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.259
H-Index - 18
ISSN - 1735-188X
DOI - 10.14704/web/v19i1/web19356
Subject(s) - knapsack problem , cryptosystem , hybrid cryptosystem , goldwasser–micali cryptosystem , public key cryptography , threshold cryptosystem , plaintext aware encryption , paillier cryptosystem , deterministic encryption , key (lock) , public key cryptosystem , encryption , computer science , theoretical computer science , mathematics , computer security , algorithm
Merkle–Hellman knapsack cryptosystem is a public-key cryptosystem, which means, two keys are used, a public key for the encryption and a private key for the decryption. This cryptosystem is not secure against the cryptosystem attacks, such as LLL Algorithm. In this paper, we introduce a new study to attack the knapsack problem. This study is based on discussing certain facts regarding the public key to extract the multiplier. Also, based on some facts we can find the modulus that is used in the cryptosystem. Therefore, the experimental outcome shows that this method is easier and faster to attack the knapsack cryptosystem.