An Upper Bound on the Key Equivocation for Pure Ciphers

DOI10.1109/TIT.1984.1056843zbMath0531.94006OpenAlexW2011087452WikidataQ122176704 ScholiaQ122176704MaRDI QIDQ3313770

Rolf J. Blom

Publication date: 1984

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1984.1056843

zbMATH Keywords

memoryless sourcekey equivocationpure ciphers

Mathematics Subject Classification ID

Information theory (general) (94A15)

Related Items (1)

A Simplified Method for Computing the Key Equivocation for Additive-Like Instantaneous Block Encipherers

This page was built for publication: An Upper Bound on the Key Equivocation for Pure Ciphers