Quantifying Equivocation for Finite Blocklength Wiretap Codes



This paper presents a new technique for providing the analysis and comparison of wiretap codes in the small blocklength regime over the binary erasure wiretap channel. A major result is the development of Monte Carlo strategies for quantifying a code’s equivocation, which mirrors techniques used to analyze forward error correcting codes. For this paper, we limit our analysis to coset-based wiretap codes, and give preferred strategies for calculating and/or estimating the equivocation in order of preference. We also make several comparisons of different code families. Our results indicate that there are security advantages to using algebraic codes for applications that require small to medium blocklengths.

Related Project

SWING2 - Securing Wireless Networks with Coding and Jamming


IEEE International Conference on Communications 2017

PDF File

Cited by

No citations found