Public-key cryptographic system based on generalized satisfiability problem
type: Item
instance of: scholarly article
title: Public-key cryptographic system based on generalized satisfiability problem
zbMATH Open document ID: 1223.94018
author: E. A. Potseluevskaya
published in: Journal of Mathematical Sciences (New York)
publication date: 2011-07-18T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5924739
zbMATH Keywords: NP-completeness
zbMATH Keywords: public-key cryptosystem
zbMATH Keywords: asymmetric cryptosystem
zbMATH Keywords: satisfiability problem
MaRDI profile type: MaRDI publication profile
full work available at URL: s10958-011-0217-x
OpenAlex ID: W2107670495
cites work: The complexity of satisfiability problems
DOI: 10.1007/S10958-011-0217-X
Recommended article: Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem
Recommended article: A generalization of the ElGamal public-key cryptosystem
Recommended article: Q4341716
Recommended article: Generalized public-key cryptography with tight security
Recommended article: A PUBLIC KEY CRYPTOSYSTEM BASED ON COMPLEMENTING SETS
Recommended article: A public key cryptosystem based on three new provable problems
Recommended article: A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem
Recommended article: A public key cryptosystem based on a subgroup membership problem
Recommended article: Q4473618
description: scientific article; zbMATH DE number 5924739