Protocol insecurity with a finite number of sessions and composed keys is NP-complete. (Q1874404)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Protocol insecurity with a finite number of sessions and composed keys is NP-complete. |
scientific article; zbMATH DE number 1915580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Protocol insecurity with a finite number of sessions and composed keys is NP-complete. |
scientific article; zbMATH DE number 1915580 |
Statements
Protocol insecurity with a finite number of sessions and composed keys is NP-complete. (English)
0 references
25 May 2003
0 references
Verification
0 references
Security
0 references
Protocols
0 references
Rewriting
0 references
Complexity
0 references
0.8402031064033508
0 references
0.8288185000419617
0 references
0.8233009576797485
0 references
0.8189557790756226
0 references
0.7943573594093323
0 references
