Public-key cryptographic system based on generalized satisfiability problem

DOI10.1007/S10958-011-0217-XzbMATH Open1223.94018OpenAlexW2107670495MaRDI QIDQ549468FDOQ549468

Authors: E. A. Potseluevskaya 

Publication date: 18 July 2011

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-011-0217-x

Recommendations

• Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem
• A generalization of the ElGamal public-key cryptosystem
• scientific article; zbMATH DE number 1024032
• Generalized public-key cryptography with tight security
• A PUBLIC KEY CRYPTOSYSTEM BASED ON COMPLEMENTING SETS
• A public key cryptosystem based on three new provable problems
• A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem
• A public key cryptosystem based on a subgroup membership problem
• scientific article; zbMATH DE number 2080707

zbMATH Keywords

NP-completenesssatisfiability problempublic-key cryptosystemasymmetric cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• The complexity of satisfiability problems

Cited In (2)

• NP completeness of relocation cipher
• A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem

This page was built for publication: Public-key cryptographic system based on generalized satisfiability problem

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