Public key cryptography and the zero-one knapsack problem
Public Deposited
- Resource Type
- Creator
- Abstract
This paper reviews several popular symmetric cryptosystems, monoalphabetic and polyalphabetic. Their susceptibility to cryptanalysis is examined. Asymmetric cryptosystems are introduced through public key cryptography. The Rivest-Shamir-Adelman cryptosystem is explained. Then the Merkle-Hellman system based on the zero-one knapsack problem is presented. Standard attacks on the zero-one knapsack problem are rejected as too time-consuming. Herlestam's proposed attack is discussed in detail. The results of theoretical examination and computer tests show that it is not quick, as claimed. The recent polynomial time algorithm of A. Shamir solving most instances of the Merkle-Hellman system is studied in detail.
- Subject
- Language
- Publisher
- Thesis Degree Level
- Thesis Degree Name
- Thesis Degree Discipline
- Identifier
- Access Rights
This work is available on request. You can request a copy at https://library.carleton.ca/forms/request-pdf-copy-thesis
- Rights Notes
Copyright © 1983 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, research, scholarship, and teaching. Theses may only be shared by linking to Carleton University Institutional Repository and no part may be used without proper attribution to the author. No part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner.
- Date Created
- 1983
Relations
- In Collection: