Development models and method of forming cascade mac using modular transformation
DOI:
https://doi.org/10.18372/2410-7840.15.4850Keywords:
codes of integrity and authenticity of data, a modular transformation, generic classes are hashed functionsAbstract
To construct the MAC codes satisfying collision properties of universal hash functions are used algorithms with modular transformations that provide provably secure hashing information. The disadvantages of such algorithms 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 functions in the scheme provably secure key universal hashing, a model and a method of forming code integrity and authenticity 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 required performance properties of universal hash collision, demonstrable resilience and high speed forming a hash code.
References
Stinson D. R. Some constructions and bounds for authentication codes / D. R. Stinson // J. Cryptology. - 1988. - № 1. - P. 37-51.
Stinson D. R. The combinatorics of authentication and secrecy codes / D. R. Stinson //J. Cryptology. - 1990.-№2.-P. 23-49.
Кузнецов А.А. Исследование коллизионных свойств кодов аутентификации сообщений UMAC //А.А. Кузнецов, О.Г. Король, С.П. Евсеев. Прикладная радиоэлектроника. — Харьков : Изд-во ХНУРЭ, 2012. Том 11 № 2. - С. 171 -183.
Hoholdt Т. An explicit construction of a sequence of codes attaining the Tsfasman-Yladut-Zink bound. The first steps, IEEE Trans. Info. Theory. —1997. —135 p.
Maitra S. Further constructions of resilient Boolean functions with very high nonlinearity / S. Maitra, E. Pasalic // Accepted in SETA. - May, 2001.
Кузнецов О.О. Захист інформації в інформаційних системах / О. О. Кузнецов, С.П. Євсеєв, O.F. Король. -X.: Вид. ХНЕУ, 2011. - 504 с.
Final report of European project number IST-1999- 12324, named New European Schemes for Signatures, Integrity, and Encryption, April 19, 2004 — Version 0.15 (beta), Springer-Verlag.
В. Столлингс Криптография и защита сетей: принципы и практика, 2-е изд. : пер. с англ. — М.: издательский дом «Вильям», 2001. — 672 с.
Король О.Г. Исследование методов обеспечения аутентичности и целостности данных на основе односторонних хеш-функций// О.Г. Король, С.П. Евсеев. Науково-технічний журнал «Захист інформації». Спецвипуск (40). — 2008. — С. 50 — 55.
Stinson D. R. Some constructions and bounds for authentication codes, D. R. Stinson, J. Cryptology., 1988, № 1, P. 37-51.
Stinson D. R. The combinatorics of authentication and secrecy codes, D. R. Stinson, J. Cryptology, 1990, № 2, P. 23—49.
Kuznetsov A, Korol O, Evseev S. (2012), «The study of collision properties of message authentication codes UMAC», «Applied electronics», Vol. 11, № 2, pp.171-183.
Hoholdt T. An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps, IEEE Trans. Info. Theory, 1997, 135 p.
Maitra S. Further constructions of resilient Boolean functions with very high nonlinearity, S. Maitra, E. Pasalic, Accepted in SETA, May, 2001.
Kuznetsov A, Korol O, Evseev S. (2011), «Information Security in Information Systems», publishing house KNEU, 504 p.
Final report of European project number IST-1999- 12324, named New European Schemes for Signatures, Integrity, and Encryption, April 19, 2004, Version 0.15 (beta), Springer-Verlag.
B. Stallings (2001), «Cryptography and network security: Principles and Practice», publishing house «William2, 2001, 672 p.
Korol O, Evseev S. (2008), «Investigation of methods to ensure the authenticity and integrity of data based on one-way hash functions», Naukovyi- tehnichny journal «Information Security2. Vol. (40), pp. 50 - 55.
Downloads
How to Cite
Issue
Section
License
The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.
All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Copyright
Authors who publish their works in the journal:
-
retain the copyright to their publications;
-
grant the journal the right of first publication of the article;
-
agree to the distribution of their materials under the CC BY 4.0 license;
-
have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.




