Advertisement

On message protection in cryptosystems modelled as the generalized wire-tap channel II

  • Miodrag J. Mihaljević
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 829)

Abstract

A novel approach to the analysis of message security in cryptosystems which can be modelled as the generalized wire-tap channel II is considered. Roughly speaking, the codewords transmitted through this channel are degraded by the deletion of a number of bits and by the complementing of a number of the remaining bits. It is assumed that the channel output codewords are available to a cryptanalyst. The security of the messages is measured by the uncertainty after certain minimum distance decoding (MDD) procedures are applied to the received codewords. A novel distance measure relevant to MDD is proposed, and the remaining uncertainty after MDD is analyzed. An extension of the approach is also considered.

Keywords

Linear Code Levenshtein Distance 1EEE Trans Message Security Unknown Position 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R.E.Blahut, Digital Transmission of Information. Addison-Wesley, Reading MA, 1990.Google Scholar
  2. 2.
    A.D.Wyner, ”The wire-tap channel”, Bell Syst. Tech. Journal, vol. 54, pp. 1355–1387, 1975.Google Scholar
  3. 3.
    V.Korzhik and V.Yakovlev, ”Nonasymptotic estimates of information protection efficiency for the wire-tap channel concept”, Advances in Cryptology— AUSCRYPT 92, Lecture Notes in Computer Science, vol. 718, pp. 185–195, 1993.Google Scholar
  4. 4.
    L.H.Ozarow and A.D.Wyner, ”Wire-tap channel II”, AT & T Bell Lab. Tech. Journal, vol. 63, pp. 2135–2157, Dec. 1984.Google Scholar
  5. 5.
    V.K.Wei, ”Generalized Hamming weights for linear codes”, IEEE Trans. Inform. Theory, vol. 37, pp. 1412–1418, Sep. 1991.Google Scholar
  6. 6.
    G.L.Feng, K.K.Tzeng and W.K.Wei, ”On the generalized Hamming weights of several classes of cyclic codes”, IEEE Trans. Inform. Theory, vol. 38, pp. 1125–1130, May 1992.Google Scholar
  7. 7.
    T.Helleseth, T.Kløve, O.Ytrehys, ”Generalized Hamming weights of linear codes”, IEEE Trans. Inform. Theory, vol. 38, pp. 1133–1140, May 1992.Google Scholar
  8. 8.
    D.Sankoff and J.B.Kruskal, Time Warps, String edits and macromolecules: The theory and practice of sequence comparison. Reading, MA: Addison-Wesley, 1983.Google Scholar
  9. 9.
    A.Levenshtein, ”Binary codes capable of correcting deletions, insertions, and reversals”, Sov. Phy. Dokl., vol. 10, pp. 707–710, 1966.Google Scholar
  10. 10.
    B.J.Oommen, ”Recognition of noisy subsequences using constrained edit distance”, IEEE Trans. Pattern Analysis Mach. Intell., vol. PAMI-9, pp. 676–685, Sep. 1987.Google Scholar
  11. 11.
    B.J.Oommen, ”Correction to Recognition of noisy subsequences using constrained edit distance”, IEEE Trans. Pattern Analysis Mach. Intell., vol. PAMI-10, pp. 983–984, Nov. 1988.Google Scholar
  12. 12.
    M.Mihaljević, ”An approach to the initial state reconstruction of a clock-controlled shift register based on a novel distance measure”, Advances in Cryptology — AUSCRYPT "92, Lecture Notes in Computer Science, vol. 718, pp. 349–356, 1993.Google Scholar
  13. 13.
    B.J.Oommen, ”Constrained string editing”, Inform. Sci., vol.40, pp.267–284, 1986.Google Scholar
  14. 14.
    J.Golić and M.Mihaljević, ”A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance”, Journal of Cryptology, vol. 3 (3), pp.201–212, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Miodrag J. Mihaljević
    • 1
  1. 1.Institute of Applied Mathematics and Electronics, Institute of MathematicsAcademy of Arts and SciencesBelgradeYugoslavia

Personalised recommendations