Public-key cryptographic system based on generalized satisfiability problem

DOI10.1007/S10958-011-0217-XzbMath1223.94018OpenAlexW2107670495MaRDI QIDQ549468

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

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

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