Javascript must be enabled to continue!
A New Cryptosystem Based on Three Knapsacks with Plaintext Encoding
View through CrossRef
In this paper, we propose a transformed knapsack cryptosystem by using three knapsacks with plaintext encoding to enhance the security of Knapsack cryptosystem. In our approach we try to encode a plaintext before encrypting. The benefits are that using plaintext encoding method can not only increase the density of the knapsack, but also reduce decrypt time substantially. The ciphertext is composed by multiplying two non-superincreasing knapsacks and then add to a superincreasing knapsack. Our propose scheme can be secure against the low density attack because the plaintext encoding the density can be made as large as our desire.
Title: A New Cryptosystem Based on Three Knapsacks with Plaintext Encoding
Description:
In this paper, we propose a transformed knapsack cryptosystem by using three knapsacks with plaintext encoding to enhance the security of Knapsack cryptosystem.
In our approach we try to encode a plaintext before encrypting.
The benefits are that using plaintext encoding method can not only increase the density of the knapsack, but also reduce decrypt time substantially.
The ciphertext is composed by multiplying two non-superincreasing knapsacks and then add to a superincreasing knapsack.
Our propose scheme can be secure against the low density attack because the plaintext encoding the density can be made as large as our desire.
Related Results
Composite Discrete Logarithm Problem and a Reconstituted ElGamal Cryptosystem Based on the Problem
Composite Discrete Logarithm Problem and a Reconstituted ElGamal Cryptosystem Based on the Problem
In this chapter, the authors have defined a new ElGamal cryptosystem by using the power Fibonacci sequence module m. Then they have defined a new sequence module m and the other El...
Cryptanalysis of McEliece cryptosystem variants based on quasi‐cyclic low‐density parity check codes
Cryptanalysis of McEliece cryptosystem variants based on quasi‐cyclic low‐density parity check codes
One of the approaches to modify the McEliece cryptosystem to overcome its large key size is replacing binary Goppa codes with a new structured code. However, this modification make...
Identification of Fake Messages Using Two PKCs
Identification of Fake Messages Using Two PKCs
Abstract
In this paper, two public key cryptosystems are presented and analyzed. The first cryptosystem is an improvement of the RSA public key c...
Identification of Fake Messages Using Two PKCs
Identification of Fake Messages Using Two PKCs
Abstract
In this paper, two public key cryptosystems are presented and analyzed. The first cryptosystem is an improvement of RSA public key cryptosystem. The second...
Modified Playfair cryptosystem for improved data security
Modified Playfair cryptosystem for improved data security
Playfair is the earliest known classical block cipher which is capable of taking two characters as a unit in the process of encryption and decryption. However, the cipher is suffer...
A GENERALIZED MODEL OF FREDHOLM'S CRYPTOSYSTEM
A GENERALIZED MODEL OF FREDHOLM'S CRYPTOSYSTEM
The problem of cyber security in the era of the creation of quantum computers is of particular relevance. Specifically, the data are at risk which are confidential or whose value d...
Secure PUF-Based Authentication Systems
Secure PUF-Based Authentication Systems
The Internet of Things faces significant security challenges, particularly in device authentication. Traditional methods of PUF-based authentication protocols do not fully address ...
Perancangan Kriptografi Block Cipher berbasis Pola Dribbling Practice
Perancangan Kriptografi Block Cipher berbasis Pola Dribbling Practice
Block cipher merupakan salah satu teknik dalam kriptografi modern yang digunakan untuk melakukan enkripsi/dekripsi pada data digital dengan membagi pesan menjadi blok-blok data dan...

