Encryption with first order splines.
Cryptography nowadays is used almost in all information systems - from Internet to databases. Maintenance of a required level of protection without it is impossible. By means of cryptographic algorithms swindle attempts in systems of electronic commerce are prevented and legality of financial transactions is provided. Every year the value of information protection maintenance increases, however nobody can give an absolute guarantee of safety. In the given work the algorithm of enciphering the information based on wavelet decomposition of splines of the first degree on a non-uniform grid is presented. Using splines and their wavelet decompositions leads to a rather wide variety of the keys defined by mesh and the order of ejection of nodes. The suggested algorithms can also be applied to the key transfer. The presented algorithm has the Feistel Structure, but there is no XOR operation with the round key, as it was presented in all block ciphers. Algorithms have easy mathematical structure for analysis. The algorithm provided can work with the block length equal to 512 and 1024 bit, which is not possible for AES or 3DES. It was also made researches to use wavelet decomposition of splines of the second and third degree in symmetric block cryptography. Presented algorithm can provide good secrecy.