A Polly Cracker System Based on Satisfiability

Abstract : This paper presents a public-key cryptosystem based on a subclass of the well-known satisfiability problem from propositional logic, namely the doubly-balanced 3-SAT problem. We describe the construction of an instance of our system - which is a modified Polly Cracker scheme - starting from such a 3-SAT formula. Then we discuss security issues: this is achieved on the one hand by exploring best methods to date for solving this particular problem, and on the other hand by studying (systems of multivariate) polynomial equation solving algorithms in this particular setting. The main feature of our system is the resistance to intelligent linear algebra attacks.
Document type :
Book sections
Complete list of metadatas

https://hal-ensta-paris.archives-ouvertes.fr//hal-00988797
Contributor : Aurélien Arnoux <>
Submitted on : Friday, May 9, 2014 - 10:34:38 AM
Last modification on : Wednesday, July 3, 2019 - 10:48:04 AM

Links full text

Identifiers

Collections

Citation

Françoise Levy-Dit-Vehel, Ludovic Perret. A Polly Cracker System Based on Satisfiability. Progress in Computer Science and Applied Logic Volume 23, 23, Springer, pp.177-192, 2004, 978-3-0348-9602-3. ⟨10.1007/978-3-0348-7865-4_11⟩. ⟨hal-00988797⟩

Share

Metrics

Record views

121