Abstract
The design and implementation of a public-key cryptosystem based on the matrix cover NP-complete problem is described. Section 1 explains the problem, provides the necessary background to understand the implementation and serves to establish the terminology used. The implementation is described in detail in section 2. Section 3 contains further comments on the system and also examines its signature capability. The system borrows quite a few ideas from the Merkle-Hellman scheme [3] and a very brief comparison between the two systems appears in section 4.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer Science+Business Media New York
About this paper
Cite this paper
Janardan, R., Lakshmanan, K.B. (1983). A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-0602-4_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-0602-4_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-0604-8
Online ISBN: 978-1-4757-0602-4
eBook Packages: Springer Book Archive