Referenced Items are not available for this document.
It is required to invent the public-key cryptosystem(PKC) that is based on an NP-hard problem so that the quantum computer might be realized. The knapsack PKC is based on the subset sum problem which is NP-hard. In this paper, we propose a construction method of knapsack PKC using a linear transformation of the secret sequences over integer ring with the Chinese remainder theorem as the trapdoor. The proposed scheme is secure against Shamir's attack and Adleman's attack and invulnerable to the low-density attack.
Published in:
Information Theory and its Applications (ISITA), 2010 International Symposium on
Date of Conference: 17-20 Oct. 2010
- Page(s):
- 433 - 436
- E-ISBN :
- 978-1-4244-6017-5
- Print ISBN:
- 978-1-4244-6016-8
- INSPEC Accession Number:
- 11732753
- Conference Location :
- Taichung
- Digital Object Identifier :
- 10.1109/ISITA.2010.5649316
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
