A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem

  • Ravi Janardan
  • K. B. Lakshmanan
Conference paper

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.

Keywords

Binary String Characteristic Difference Positive Power Data Expansion Decryption Procedure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1983

Authors and Affiliations

  • Ravi Janardan
    • 1
  • K. B. Lakshmanan
    • 1
  1. 1.Purdue University and Indian Institute of TechnologyMadrasIndia

Personalised recommendations