Skip to main content
Springer Nature Link
Log in

A fast and efficient homophonic coding algorithm

  • Session 10b: Invited Presentation
  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1996)

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

Included in the following conference series:

  • 148 Accesses

Abstract

Homophonic coding, introduced in [1, 2], is refered to as a technique that contributes to reliability of the secret-key cipher systems. For the methods of homophonic coding known until now, the redundancy r defined as the difference between a mean codeword length and a source entropy can only be reduced at the expense of exponential growth of the memory size and calculation time required. We suggest a method of perfect homophonic coding for which the size of memory and the time of calculation grow as O(1/r) and O(log2 1/r log log 1/r), respectively, as r → 0.

Supported by Russian Foundation of Fundamental Research under Grant 96-01-00052

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.

References

  1. Günther, Ch. G.: A universal algorithm for homophonic coding. Proc. of Eurocrypt-89, Springer-Verlag (1990) 382–94

    Google Scholar 

  2. Jendal, H. N., Kuhn, Y. J. B., Massey, J. L.: An information-theoretic treatment of homophonic substitution. Proc. of Eurocrypt-89, Springer-Verlag (1990) 382–94

    Google Scholar 

  3. Massey, J. L.: An introduction to contemporary cryptology. Proc. of the IEEE 76 (1988) 533–549

    Article  Google Scholar 

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

    Article  Google Scholar 

  5. 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

Tetsuo Asano Yoshihide Igarashi Hiroshi Nagamochi Satoru Miyano Subhash Suri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ryabko, B., Fionov, A. (1996). A fast and efficient homophonic coding algorithm. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009519

Download citation

  • DOI: https://doi.org/10.1007/BFb0009519

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62048-8

  • Online ISBN: 978-3-540-49633-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics