Protocol insecurity with a finite number of sessions and composed keys is NP-complete

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.299, Iss.1, 2003-04, pp. : 451-475

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Correlation Structure of Landscapes of NP-Complete Optimization Problems at Finite Temperatures

By Gehring Wolfgang Salamon Peter Whitney Roger E. Sibani Paolo

Open Systems and Information Dynamics, Vol. 11, Iss. 2, 2004-06 ,pp. : 177-184

Springer Publishing Company

Access to resources Recommend Favorite

On universally easy classes for NP-complete problems

By Demaine E.D. Lopez-Ortiz A. Munro J.I.

Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. : 471-476

Elsevier

Access to resources Recommend Favorite

The synthesis problem for elementary net systems is NP-complete

By Badouel E. Bernadinello L. Darondeau P.

Theoretical Computer Science, Vol. 186, Iss. 1, 1997-10 ,pp. : 107-134

Elsevier

Access to resources Recommend Favorite

Topology of strings: Median string is NP-complete

By de la Higuera C. Casacuberta F.

Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. : 39-48

Elsevier

Access to resources Recommend Favorite

Ontology Mapping Validation: Dealing with an NP-Complete Problem

International Journal of Web Portals (IJWP), Vol. 3, Iss. 3, 2011-07 ,pp. : 1-11

IGI Global_journal

Access to resources Recommend Favorite