Skip to main content
Springer Nature Link
Log in

Homophonic coding with logarithmic memory size

  • Session 5B
  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1350))

Included in the following conference series:

Abstract

Homophonic coding, introduced in [1, 2], is refered to as a means of constructing unbreakable secret-key cipher systems. In [3] a homophonic coding method has been proposed that provides arbitrarily small redundancy r with the size of memory and computation time growing as O(1/r) and O(log2 1/r log log 1/r), respectively, as r → 0, not more than 4r random bits being used on average. In the present paper, we suggest a method for which the memory size and computation time grow as O(log 1/r) and O(log 1/r log log 1/r log log log 1/r), respectively, as r → 0, the average number of random bits being approx. 2 + r. We also propose a homophonic coding scheme which meets both specified redundancy and a number of random bits.

Supported by Russian Foundation of Fundamental Research under Grant 96-0100052

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Günther, Ch. G.: A universal algorithm for homophonic coding. Advances in Cryptology Eurocrypt-88, N. Y.: Springer-Verlag (1988) 405–414 (Lecture notes in comput. sci.: Vol. 330)

    Google Scholar 

  2. Jendal, H. N., Kuhn, Y. J. B., Massey, J. L.: An information-theoretic treatment of homophonic substitution. Advances in Cryptology Eurocrypt-89, Berlin: Springer-Verlag (1990) 382–394 (Lecture notes in comput. sci.: Vol. 434)

    Google Scholar 

  3. Ryabko B. Y., Fionov A. N.: A fast and efficient homophonic coding algorithm. Algorithms and Computation ISAAC-96. Berlin: Springer (1996) 427–438 (Lecture notes in comput. sci.: Vol. 1178)

    Google Scholar 

  4. Ryabko, B. Y.: Fast and effective coding of information sources. IEEE Trans. Inform. Theory Vol. 40, 1 (1994) 96–99

    Google Scholar 

  5. Rissanen J., Langdon G. G.: Universal modeling and coding. IEEE Trans. Inform. Theory Vol. 27, 1 (1981) 12–23

    Google Scholar 

  6. Bell T. C., Cleary J. G., Witten I. H.: Text compression. Englewood Cliffs, Nj: Prentice Hall, Inc. (1990)

    Google Scholar 

  7. Aho, A. V., Hopcroft, L. E., Ullman, J. D.: The design and analysis of computer algorithms. Addison-Wesley Publishing Company (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk Telecommunication Institute, Kirov str. 86, 630102, Novosibirsk, Russia

    Boris Ryabko & Andrey Fionov

Authors
  1. Boris Ryabko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrey Fionov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hon Wai Leong Hiroshi Imai Sanjay Jain

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ryabko, B., Fionov, A. (1997). Homophonic coding with logarithmic memory size. In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-63890-3_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63890-2

  • Online ISBN: 978-3-540-69662-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics