PKCHD: Towards a Probabilistic Knapsack Public-Key Cryptosystem with High Density
By introducing an easy knapsack-type problem, a probabilistic knapsack-type public key cryptosystem (PKCHD) is proposed. It uses a Chinese remainder theorem to disguise the easy knapsack sequence. Thence, to recover the trapdoor information, the implicit attacker has to solve at least two hard numbe...
Main Authors: | Yuan Ping, Baocang Wang, Shengli Tian, Jingxian Zhou, Hui Ma |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-02-01
|
Series: | Information |
Subjects: | |
Online Access: | https://www.mdpi.com/2078-2489/10/2/75 |
Similar Items
-
An Improved Attack on the Basic Merkle–Hellman Knapsack Cryptosystem
by: Jiayang Liu, et al.
Published: (2019-01-01) -
Enhancements of the Non-linear Knapsack Cryptosystem
by: Tu, Zhiqi
Published: (2008) -
The Knapsack Problem, Cryptography, and the Presidential Election
by: McMillen, Brandon
Published: (2012) -
NTRU-Like Random Congruential Public-Key Cryptosystem for Wireless Sensor Networks
by: Anas Ibrahim, et al.
Published: (2020-08-01) -
Evolution of Knapsack Ciphersystems
by: Georgii Ivanovich Borzunov, et al.
Published: (2015-03-01)