The effectiveness of symbolic integer splitting method over both synchronous stream ciphers and perfectly secret ciphers

Abstract

Synchronous stream ciphers are classified up to the used keystream into two types: either to the synchronous ciphers that are used pseudorandom keystreams, or to the perfectly-secret ciphers that are used truly random keystreams; each of these classifications has its disadvantages, so the necessity to find a method that belongs to the synchronous stream ciphers and overcomes their disadvantages is required. In this article, the author proposes a method to satisfy this purpose; the proposed method is called symbolic integer splitting method and it is a mathematical method for representing an integer in form of a certain sequence of integers by using the modular arithmetic operation. Also this method can be classified under perfectly-secret ciphers because it satisfies asymptotic secrecy under a certain condition. The new scientific results are conducted as the ability of this method to success in dealing with the disadvantages of both the traditional synchronous stream ciphers and perfectly-secret ones, likes: insecure protection of information, hide the information about the length of original message from the cryptanalyst, no need to use each gamma only once, not expensive in terms of required resources to store gammas.