About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Conference paper
Bounds on encryption using linear code ciphers
Abstract
Summary form only given. When a memoryless source of entropy H is enciphered using cipher sequences from some linear (n, nR) code of rate R, the average distortion D for unauthorized decryption is shown to be lower bounded by the expression Rr(D/R) ≤ Hmax-H, where Hmax = log2|AM| is the source entropy when the letters in its alphabet are equally likely. Using cipher codes where every nR positions form an information set, D is bounded by the tighter expression Rr(D) ≤ Hmax -H. Both bounds improve on Lu's bound r(D ≤ 2Hmax - RH - H for 1 - H/Hmax ≤ R ≤ 1 except at the boundaries, where they are equal.