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

DOI10.1016/j.endm.2005.07.052zbMath1158.94392OpenAlexW2178560143MaRDI QIDQ3439299

Zhao Zhi Zhang

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.07.052

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• An Upper Bound on the Key Equivocation for Pure Ciphers
• Sounds on key equivocation for simple substitution ciphers

This page was built for publication: A Simplified Method for Computing the Key Equivocation for Additive-Like Instantaneous Block Encipherers