Abstract:
The authenticated encryption cryptosystem with derived one-time keys is considered, which uses a block recursive sequence for information encryption and a polynomial MAC for information authentication. The generator of recursive sequence is based on calculations in the fields of characteristic two using quasigroup operations. A choice of cryptosystem parameters that guarantees resistance to attacks based only on the ciphertext, and an analysis of resistance to attacks with known plaintext are proposed. The complexity algorithm is analyzed.
Key words:authenticated encryption cryptosystem, quasigroup, orthogonal Latin squares.