Abstract
GOST is a government standard of the former Soviet Union. It is a block algorithm for the protection of data processing systems. The algorithm is easy to understand and is secure. However, when we use GOST for encryption, the textfile has to be broken into blocks of 64 bits. If the length of a textfile is not a multiple of 64 we need to do something different for the last block. In this paper we want to propose a generalized GOST, without changing the structure and designing concept of original GOST, so that it can encrypt a textfile without breaking it into the same length blocks. Therein the padding problem is solved. The greatest difficulty is that we have to generate a huge number of S-boxes. We define the seed permutations that can generate all the S-boxes we need in the proposed scheme.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
