The combinatorial complexity of masterkeying
type: Item
instance of: scholarly article
title: The combinatorial complexity of masterkeying
zbMATH Open document ID: 1032.90082
author: W. Espelage
author: Egon Wanke
published in: Mathematical Methods of Operations Research
publication date: 2003-08-07T00:00:00Z
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 1961090
MaRDI profile type: Publication
full work available at URL: s001860000084
OpenAlex ID: W2087355792
DOI: 10.1007/S001860000084
Recommended article: Q5421815
Recommended article: The Complexity of Public-Key Cryptography
Recommended article: Q4887836
Recommended article: The combinatorics of authentication and secrecy codes
Recommended article: The Combinatorics of Perfect Authentication Schemes
Recommended article: Q3316592
Recommended article: Complexity Measures for Public-Key Cryptosystems
Recommended article: Q2960961
Recommended article: Q4240560
Recommended article: Kolmogorov complexity and cryptography
description: scientific article; zbMATH DE number 1961090