Разработка модели и метода каскадного формирования МАС с использованием модулярных преобразований

Abstract

To construct the MAC codes satisfying collision proper-ties of universal hash functions are used algorithms with modular transformations that provide provably secure hashing information. The disadvantages of such algo-rithms is the high computational complexity and low rate of formation of the hashes, which significantly reduces the scope of their application. The choice of cycle func-tions in the scheme provably secure key universal hashing, a model and a method of forming code integrity and au-thenticity of data based on the modular transformation algorithm to reduce the computational complexity of the hashing scheme using cyclic functions. The developed method of cascade formation of MAC provides the re-quired performance properties of universal hash collision, demonstrable resilience and high speed forming a hash code.