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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R.J. Bayardo Jr., R. Schrag. Using CSP look-back techniques to solve exceptionnally hard SAT instances. Proceedings of 2nd Int. conference on Principles and Practice of constraint Programming, 1996, pp. 46–60.
D. Bayer. The division algorithm and the Hilbert scheme. PhD. Thesis, Harvard University, Cambridge, Massachussets, 1982.
T. Becker and V. Weispfenning. Gröbner Bases A Computational Approach to Commutative Algebra. In cooperation with Heinz Kredel. Graduate Texts in Mathematics, 141. Springer-Verlag, New York, 1993.
S. Cocco, R. Monasson. Statistical physics analysis of the computational complexity of solving random satisfiability problems using backtrack algorithms. The European Physical Journal B 22, 2001, pp. 505–531.
S.A. Cook. D.G. Mitchell. Finding hard instances of the satisfiability problem: a survey. DIMACS Series in discrete mathematics and theoretical computer science, 1997.
M. Davis, G. Logemann, D. Loveland. A machine program for theorem proving. Communications of the ACM, 5, 1962, pp. 394–397.
O. Dubois, Y. Boufkhad. From very hard doubly balanced SAT formulae to easy unbalanced SAT formulae, variations of the satisfiability threshold. Proceedings of the DIMACS workshop on the satisfiability problem: theory and applications, March 1996.
J.-C. Faugère. A new efficient algorithm for computing Gröbner basis: F4. Journal of pure and applied algebra, vol. 139, 1999, pp. 61–68.
M. Fellows, N. Koblitz. Combinatorial cryptosystems galore ! Proceedings of the second international conference on “Finite Fields: theory, applications and algorithms”, Las Vegas 1993, Contemporary Mathematics, vol. 168, 1994, pp. 51–61.
W. Geiselmann, R. Steinwandt. Some cracks in Polly Cracker. Europäisches In-stitut für Systemsicherheit, Universität Karlsruhe, Tech. Report 01/01, 2001.
E. Hirsch. http://logic.pdmi.ras.ru/~hirsch/ /~hirsch/
D. Hofheinz and R. Steinwandt. A “Differential” Attack on Polly Cracker. Proceedings of 2002 IEEE International Symposium on Information Theory ISIT 2002, extended abstract, p. 211, 2002.
R. Impagliazzo, L. Levin, M. Luby . Pseudo-random number generation from one- way functions. Proceedings of 21st STOC, 1989, pp. 12–24.
N. Koblitz. Algebraic aspects of cryptograhy. Algorithms and Computation in Mathematics, 3. Springer-Verlag 1998.
L. Van Ly. Polly Two - a public-key cryptosystem based on Polly Cracker. Thèse de l’université de Bochum, Faculté de Mathématiques, Décembre 2002.
A. Odlyzko. The rise and fall of knapsack cryptosystems. Cryptology and computational number theory, Proceedings of Symposium on Applied Mathematics 42, AMS 1990, pp. 75–88.
T. Okamoto, D. Pointcheval. REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform. CT-RSA 2001: 159–175
http://www.satlive.org/SATCompetition /SATCompetition
B. Selman, H. Kautz, B. Cohen. Noise strategies for improving local search. Proceedings of AAAI-94, 1994, pp. 337–343.
A. Shamir. A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem. IEEE Transactions on Information Theory IT-30, 1984, pp. 699–704.
R. Steinwandt and W. Geiselmann. Cryptanalysis of Polly Cracker. IEEE Transactions on Information Theory 48(11): 2990–2991, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Basel AG
About this paper
Cite this paper
Levy-dit-Vehel, F., Perret, L. (2004). A Polly Cracker System Based on Satisfiability. In: Feng, K., Niederreiter, H., Xing, C. (eds) Coding, Cryptography and Combinatorics. Progress in Computer Science and Applied Logic, vol 23. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7865-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-0348-7865-4_11
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9602-3
Online ISBN: 978-3-0348-7865-4
eBook Packages: Springer Book Archive