1. IDR@IIT Indore
  2. IITI Scholarly Publications
  3. Department of Computer Science and Engineering
Please use this identifier to cite or link to this item: https://dspace.iiti.ac.in/handle/123456789/4789
Full metadata record
DC FieldValueLanguage
dc.contributor.authorThomas, Jayaen_US
dc.contributor.authorChaudhari, Narendra S.en_US
dc.date.accessioned2022-03-17T01:00:00Z-
dc.date.accessioned2022-03-17T15:35:30Z-
dc.date.available2022-03-17T01:00:00Z-
dc.date.available2022-03-17T15:35:30Z-
dc.date.issued2011-
dc.identifier.citationThomas, 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.5958485en_US
dc.identifier.isbn9781424467938-
dc.identifier.otherEID(2-s2.0-80051990314)-
dc.identifier.urihttps://doi.org/10.1109/ETNCC.2011.5958485-
dc.identifier.urihttps://dspace.iiti.ac.in/handle/123456789/4789-
dc.description.abstractIn 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.en_US
dc.language.isoenen_US
dc.publisherIEEE Computer Societyen_US
dc.sourceProceedings of 2011 International Conference on Emerging Trends in Networks and Computer Communications, ETNCC2011en_US
dc.subjectFormal logicen_US
dc.subjectPolynomial approximationen_US
dc.subject2SATen_US
dc.subject3SATen_US
dc.subjectComputational resultsen_US
dc.subjectHybrid cryptosystemen_US
dc.subjectNP Completeen_US
dc.subjectPublic keysen_US
dc.subjectSatisfiability problemsen_US
dc.subjectSecurity threatsen_US
dc.subjectCryptographyen_US
dc.titlePolynomial solvability of satisfiability and its implication to hybrid cryptosystem securityen_US
dc.typeConference Paperen_US
Appears in Collections:Department of Computer Science and Engineering

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetric Badge: