A Note on Security of Public-Key Cryptosystem Provably as Secure as Subset Sum Problem

2014 ◽  
Vol E97.A (1) ◽  
pp. 298-299 ◽  
Author(s):  
Shinsuke HAMASHO ◽  
Yasuyuki MURAKAMI
Keyword(s):  
Public Key ◽  
Public Key Cryptosystem ◽  
Subset Sum Problem ◽  
Subset Sum

An Extended Knapsack Public Key Cryptosystem

2013 ◽  
Vol 441 ◽  
pp. 678-681
Author(s):  
Xiao Ping Ji ◽  
Hai Bin Zhang ◽  
Bo Ying Wu ◽  
Guang Yu Li
Keyword(s):  
High Density ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Low Density ◽  
Subset Sum Problem ◽  
Encryption And Decryption ◽  
Subset Sum

We analyzed a typical cryptosystem and an easy extended knapsack subset sum problem is proposed. The solution is not chosen from any longer but from. Based on the problem, we construct a public key cryptosystem in which the plaintext is divided into some groups and each group has bits, so that the encryption and decryption can be very fast. The possible attacks are analyzed. Our cryptosystem not only can resist Shamir's attack but also can resist the low density attack, because of its high density. The number of the sequence is also much shorter than before with the same density.

scholarly journals PKCHD: Towards A Probabilistic Knapsack Public-Key Cryptosystem with High Density

Information ◽  
2019 ◽  
Vol 10 (2) ◽  
pp. 75 ◽  
Author(s):  
Yuan Ping ◽  
Baocang Wang ◽  
Shengli Tian ◽  
Jingxian Zhou ◽  
Hui Ma
Keyword(s):  
Chinese Remainder Theorem ◽  
Success Probability ◽  
High Density ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
The Public ◽  
Attack Model ◽  
Simultaneous Diophantine Approximation ◽  
Subset Sum ◽  
Linearization Attack

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 number-theoretic problems, namely integer factorization and simultaneous Diophantine approximation problems. In PKCHD, the encryption function is nonlinear about the message vector. Under the re-linearization attack model, PKCHD obtains a high density and is secure against the low-density subset sum attacks, and the success probability for an attacker to recover the message vector with a single call to a lattice oracle is negligible. The infeasibilities of other attacks on the proposed PKCHD are also investigated. Meanwhile, it can use the hardest knapsack vector as the public key if its density evaluates the hardness of a knapsack instance. Furthermore, PKCHD only performs quadratic bit operations which confirms the efficiency of encrypting a message and deciphering a given cipher-text.

An Efficient Key Generation of ZHFE Public Key Cryptosystem

2018 ◽  
Vol E101.A (1) ◽  
pp. 29-38
Author(s):  
Yasuhiko IKEMATSU ◽  
Dung Hoang DUONG ◽  
Albrecht PETZOLDT ◽  
Tsuyoshi TAKAGI
Keyword(s):  
Public Key ◽  
Public Key Cryptosystem ◽  
Key Generation

scholarly journals Undirected Complete Graph to Design New Public Key Cryptosystem

2021 ◽  
Vol 1897 (1) ◽  
pp. 012045
Author(s):  
Karrar Taher R. Aljamaly ◽  
Ruma Kareem K. Ajeena
Keyword(s):  
Complete Graph ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
New Public

An Algorithm Using Modular Arithmetic for the Subset Sum Problem

1990 ◽  
Vol 21 (2) ◽  
pp. 1-10
Author(s):  
Toshiro Tachibana ◽  
Hideo Nakano ◽  
Yoshiro Nakanishi ◽  
Mitsuru Nakao
Keyword(s):  
Modular Arithmetic ◽  
Subset Sum Problem ◽  
Subset Sum

Cryptanalysis of the MST 3 public key cryptosystem

2009 ◽  
Vol 3 (4) ◽  
Author(s):  
Simon R. Blackburn ◽  
Carlos Cid ◽  
Ciaran Mullan
Keyword(s):  
Public Key ◽  
Public Key Cryptosystem
Sign in / Sign up

Export Citation Format

Share Document