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

DOI10.1007/978-1-4757-0602-4_3MaRDI QIDQ3664979zbMATH OpenOpenAlexFDO

Authors Ravi Janardan, K. Lakshmanan

Publication date 1983

Published in Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4757-0602-4_3

zbMATH Keywords

designimplementationMerkle-Hellman schemeNP-complete problempublic-key cryptosystem

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Public-key cryptographic system based on generalized satisfiability problem
• scientific article; zbMATH DE number 691465
• scientific article; zbMATH DE number 3898760
• Cryptocomplexity and NP-completeness
• scientific article; zbMATH DE number 3877077

Cited in

(4)

• A knapsack-based probabilistic encryption scheme
• Public-key cryptosystems from the worst-case shortest vector problem
• Public-key cryptographic system based on generalized satisfiability problem
• Quadratic compact knapsack public-key cryptosystem

This page was built for publication: A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3664979)