NDLI: Equivalent key attack against a public-key cryptosystem based on subset sum problem

Content Provider	IET Digital Library
Author	Liu, Jiayang Bi, Jingguo
Abstract	The decisional version and computational version of the subset sum problem are known to be NP-complete and NP-hard. At International Symposium on Information Theory and its Applications 2012, Yasuyuki Murakami, Shinsuke Hamasho and Masao Kasahara presented a knapsack scheme based on the decisional version of the odd order subset sum problem. They claimed that the public sequence is indistinguishable from uniformly distributed sequences. In this study, the authors present an equivalent key attack against this scheme. More precisely, they firstly observe that there are many groups of equivalent keys, which satisfy several necessary conditions. Subsequently, they show that one can recover a group of equivalent keys by using the orthogonal lattice technique. The feasibility of the attack is validated by the experimental data when the bit length of secret keys is not too large. Hence, the security of the proposed scheme is overestimated.
Starting Page	498
Ending Page	501
Page Count	4
ISSN	17518709
Volume Number	12
e-ISSN	17518717
Issue Number	Issue 6, Nov (2018)
Alternate Webpage(s)	https://digital-library.theiet.org/content/journals/iet-ifs/12/6
Alternate Webpage(s)	https://digital-library.theiet.org/content/journals/10.1049/iet-ifs.2018.0041
Journal	IET Information Security
Publisher Date	2018-04-27
Access Restriction	Open
Rights Holder	© The Institution of Engineering and Technology
Subject Keyword	Computational Complexity Computational Version Subset Sum Problem Cryptography Data Security Decisional Version Subset Sum Problem Equivalent Key Attack Knapsack Problem Knapsack Scheme Odd Order Subset Sum Problem Private Key Cryptography Public Key Cryptosystem Public Sequence Secret Keys Uniformly Distributed Sequence
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Information Systems Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A NEW VARIANT OF SUBSET-SUM CRYPTOSYSTEM OVER RSA

Analysis of two knapsack public key cryptosystems

Knapsack Public-Key Cryptosystem Using Chinese Remainder Theorem

RSA algorithm using modified subset sum cryptosystem

Security of Double-Sequence Knapsack PKC and Single-Sequence Knapsack PKC against Low-Density Attack

New trapdoor sequences in modular knapsack cryptosystem

Construction of A New Class of Product-Sum Type Public Key Cryptosystem

Generalizing Cryptosystems Based on the Subset Sum Problem

Decryption method for differential knapsack PKC

Equivalent key attack against a public-key cryptosystem based on subset sum problem

Similar Documents

A NEW VARIANT OF SUBSET-SUM CRYPTOSYSTEM OVER RSA

Analysis of two knapsack public key cryptosystems

Knapsack Public-Key Cryptosystem Using Chinese Remainder Theorem

RSA algorithm using modified subset sum cryptosystem

Security of Double-Sequence Knapsack PKC and Single-Sequence Knapsack PKC against Low-Density Attack

New trapdoor sequences in modular knapsack cryptosystem

Construction of A New Class of Product-Sum Type Public Key Cryptosystem

Generalizing Cryptosystems Based on the Subset Sum Problem

Decryption method for differential knapsack PKC

Equivalent key attack against a public-key cryptosystem based on subset sum problem