Abstract
Merkle and Hellman proposed the first knapsack cryptosystem. However, it was broken because the density is not sufficiently high. The knapsack scheme is expected to be one of the post quantum cryptosystems. In this paper, we describe the high-density knapsack PKCs with plaintext encoding over GF(2). We discuss the influence of the number of non-zero elements of the generator matrix on the security against the low-density attack. As the result, the scheme with plaintext encoding is secure against the low-density attack when the Hamming weight of the generator matrix is sufficiently large.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
