DocumentCode
2358791
Title
Polynomial solvability of satisfiability and its implication to hybrid cryptosystem security
Author
Thomas, Jaya ; Chaudhari, Narendra S.
Author_Institution
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Indore, India
fYear
2011
fDate
22-24 April 2011
Firstpage
52
Lastpage
54
Abstract
In this paper we propose a methodology for breaking the hybrid cryptosystem 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 showing the solvability of 3SAT in polynomial time, we illustrate the security threats existing on such cryptosystem.
Keywords
optimisation; public key cryptography; 3SAT; NP complete approach; encryption; hybrid cryptosystem security; polynomial solvability; satisfiability problem; security threats; Computers; Encryption; Polynomials; Public key cryptography; 2SAT; 3SAT; NP Complete; RSA; public key;
fLanguage
English
Publisher
ieee
Conference_Titel
Emerging Trends in Networks and Computer Communications (ETNCC), 2011 International Conference on
Conference_Location
Udaipur
Print_ISBN
978-1-4577-0239-6
Type
conf
DOI
10.1109/ETNCC.2011.5958485
Filename
5958485
Link To Document