Please use this identifier to cite or link to this item:
https://dspace.iiti.ac.in/handle/123456789/4789
| Title: | Polynomial solvability of satisfiability and its implication to hybrid cryptosystem security |
| Authors: | Thomas, Jaya Chaudhari, Narendra S. |
| Keywords: | Formal logic;Polynomial approximation;2SAT;3SAT;Computational results;Hybrid cryptosystem;NP Complete;Public keys;Satisfiability problems;Security threats;Cryptography |
| Issue Date: | 2011 |
| Publisher: | IEEE Computer Society |
| Citation: | Thomas, J., & Chaudhari, N. S. (2011). Polynomial solvability of satisfiability and its implication to hybrid cryptosystem security. Paper presented at the Proceedings of 2011 International Conference on Emerging Trends in Networks and Computer Communications, ETNCC2011, 52-54. doi:10.1109/ETNCC.2011.5958485 |
| Abstract: | In this paper we propose a methodology for breaking the hybrid cryptosystem[1] based on satisfiability problem. The hybrid cryptosystem use 3SAT, the NP Complete approach to perform the task of encryption. In this paper using the well formed computational result [2] showing the solvability of 3SAT in polynomial time, we illustrate the security threats existing on such cryptosystem. © 2011 IEEE. |
| URI: | https://doi.org/10.1109/ETNCC.2011.5958485 https://dspace.iiti.ac.in/handle/123456789/4789 |
| ISBN: | 9781424467938 |
| Type of Material: | Conference Paper |
| Appears in Collections: | Department of Computer Science and Engineering |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Altmetric Badge: