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

DOI10.1007/11889342_14zbMATH Open1158.94391OpenAlexW2005006607MaRDI QIDQ5504191FDOQ5504191

Authors: Zhaozhi Zhang 

Publication date: 22 January 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11889342_14

Recommendations

• scientific article; zbMATH DE number 1421004
• On key and message equivocation in secrecy systems
• Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers
• Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer
• Attainable unconditional security for shared-key cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (6)

• Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the use of nonequiprobability in a key generator for finding codes by the exhaustive search method
• Attainable unconditional security for shared-key cryptosystems
• Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504191)