Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:3664979
Jump to:navigation, search

DOI10.1007/978-1-4757-0602-4_3zbMath0516.94012OpenAlexW1608463939MaRDI QIDQ3664979

K. B. Lakshmanan, Ravi Janardan

Publication date: 1983

Published in: Advances in Cryptology (Search for Journal in Brave)

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


zbMATH Keywords

designimplementationNP-complete problempublic-key cryptosystemMerkle-Hellman scheme


Mathematics Subject Classification ID

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


Related Items (2)

A knapsack-based probabilistic encryption scheme ⋮ Quadratic compact knapsack public-key cryptosystem






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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3664979&oldid=17123645"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 06:54.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki