No label defined (Q4936731)

A new homophonic coding method is presented. The memory size of the coder and decoder and the time of coding and decoding are exponentially less than those for earlier known methods. The memory size and computational time grow as \(O(\log (1/r))\) and \(O(\log (1/r) \log \log (1/r)\cdot \log \log \log (1/r))\) respectively, where \(r\) is the redundancy, \(r\) tends to 0. The method is based on arithmetic coding and makes it possible to produce full randomization of a message. Homophonic coding is appeared in cryptography for constructing reliable secret-key cipher systems. The number of symbols used in the method is greater than those in known methods.