Method of message authentication code formation based on permutations
DOI:
https://doi.org/10.18372/2410-7840.16.7620Keywords:
generator of permutations, message authentication, message authentication code, factorial number system, transformation of factorial number into permutation, transformation keyAbstract
The task of controlling the integrity of transmitted messageswhich is provided by the use of message authenticationis relevant for constructing of protected telecommunicationssystems. Given the growth of computing meansproductivity, and improving the methods of hacking ofinformation protection systems including protectionagainst false data imposing requirements for messageauthentication methods and means increase. In this paperthe structural diagram of device of random permutationssequence formation is developed and shown. On thebasis of this device construction principles the methodand device of message authentication code formation isproposed. The essence of the method lies in the fact thatas a message authentication code is used a part of large dimension permutation symbols in some chosen order.This permutation is formed from the sequence of charactersof the message converted into a sequence of related numbers in factorial number system. To hide the law offormation of message authentication code a replaceabletransformation key is used. The resistance of permutationand message authentication code generated from it whentrying to break a key by "brute force" is determined.References
. Борисенко О.А. Електронна система генерації перестановок на базі факторіальних чисел / О.А. Борисенко, І.А. Кулик, О.Є. Горячев // Вісник СумДУ. Технічні науки. – 2007. – №1. – С. 183-188.
. Диффи У. Защищенность и имитостойкость: введение в криптографию / У. Диффи, М. Хеллман // ТИИЭР. – 1979. – т.67., №3. – С. 71-109.
. Кнут Дональд Э. Искусство программирования. В 7 т. Т.4. Выпуск 2. Генерация всех кортежей и перестановок. / Дональд Эрвин Кнут, Станфордский университет ; пер.с англ. Ю.Г. Гордиенко. – М.: ООО «И.Д. Вильямс», 2008. – 160 с.
. Рейнгольд Э. Комбинаторные алгоритмы. Теория и практика / Э. Рейнгольд, Ю. Нивергельт, Н. Део; пер. с англ. Е.П. Липатова; под ред. В.Б. Алексеева. – М.: Мир, 1980. – 476 с.
Downloads
Published
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.