Algorithm of block symmetric encoding based on arithmetic operations modulo 2n

Abstract

The algorithm of block symmetric encoding is based on principles, which were not used at construction of block ciphers earlier, is offered. The main idea is that arithmetic operations, which are effectively realized on modern processors, are used. Blocks of information and private keys are considered as n-bit integers. Above these numbers operations of multiplication, division, addition and subtraction modulo 2n, where n- a block size are carried out. The offered algorithm has simple mathematical structure and possesses a high speed, as arithmetic operations modulo 2n are natural and fast for modern computers and hardware. The algorithm takes into account modern tendencies of computer evolution, namely: increases of processor's word width and extensions of machine instructions for efficient big number arithmetic implementation.