A Polly Cracker system based on Satisfiability - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

A Polly Cracker system based on Satisfiability


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 first describe the construction of an instance of our system 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 result of our investigations is that both types of method fail to break our instances. We end the paper with some complexity considerations and implementation results.
Fichier principal
Vignette du fichier
RR-4698.pdf (264.6 Ko) Télécharger le fichier

Dates and versions

inria-00071888 , version 1 (23-05-2006)


  • HAL Id : inria-00071888 , version 1


Françoise Levy-Dit-Vehel, Ludovic Perret. A Polly Cracker system based on Satisfiability. [Research Report] RR-4698, INRIA. 2003. ⟨inria-00071888⟩
80 View
281 Download


Gmail Facebook Twitter LinkedIn More