{"title":"Адаптированный спектрально-разностный метод построения дифференциально 4-равномерных кусочно-линейных подстановок, ортоморфизмов, инволюций поля $mathbb{F}_{2^{n}}$","authors":"Андрей Валерьевич Менячихин, A. V. Menyachikhin","doi":"10.4213/dm1757","DOIUrl":"https://doi.org/10.4213/dm1757","url":null,"abstract":"Предложен метод построения подстановок поля $mathbb{F}_{2^{n}}$ с низким значением $Delta$-равномерности, ограничения которых на смежные классы группы $mathbb{F}^{times}_{2^{n}}$ по некоторой ее подгруппе $H$ являются линейными. С использованием предложенного метода построено большое число новых CCZ-неэквивалентных дифференциально 4-равномерных подстановок, ортоморфизмов, инволюций над полем $mathbb{F}_{2^{n}}$ ($n=6,8$).","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"87 10 1","pages":""},"PeriodicalIF":0.2,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77295162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Search for differences for Alzette S-Box with maximum or close to maximum differential characteristic probability","authors":"Andrey A. Dmukh, Dmitriy O. Pasko","doi":"10.17223/20710410/58/5","DOIUrl":"https://doi.org/10.17223/20710410/58/5","url":null,"abstract":"A “difference meeting in the middle” approach is proposed for constructing consistent systems of local difference relations for the Alzette substitution, which makes it possible to obtain systems with maximum or close to maximum difference characteristics. Using this approach, the results on the estimation of the difference characteristics of the Alzette substitution, obtained by the developers of the substitution, are extended, while at the same time with less laboriousness.","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"1 1","pages":""},"PeriodicalIF":0.2,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67583505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Истван Фазекаш, István Fazekas, Алексей Николаевич Чупрунов, Alexej Nikolaevich Chuprunov
{"title":"Принцип инвариантности для чисел частиц в ячейках обобщенной схемы размещения","authors":"Истван Фазекаш, István Fazekas, Алексей Николаевич Чупрунов, Alexej Nikolaevich Chuprunov","doi":"10.4213/dm1738","DOIUrl":"https://doi.org/10.4213/dm1738","url":null,"abstract":"Пусть $eta_1,…,eta_N$ - обобщенная схема размещения $n$ частиц по $N$ ячейкам, определенная независимыми случайными величинами $xi_1,…,xi_N$, которые имеют распределение степенного ряда с параметром $beta$. Обозначим через $m(beta)$ и $sigma^2(beta)$ математическое ожидание и дисперсию случайной величины $xi_i$ и будем считать, что $frac{n}{N}=m(beta)$. Рассматриваются случайные процессы $X_{n,N}(t)=sum_{i=1}^{[tN]}eta_i $ и $Y_{n,N}(t)=n^{-1/2}(X_{n,N}(t)-[tN]frac{n}{N})$, $0le tle 1$. Указаны условия, при которых случайные процессы $sigma_{-1}(beta)sqrt{frac{n}{N}}Y_{n,N}$ сходятся по распределению при $n,Ntoinfty$ в пространстве Скорохода к броуновскому мосту, а также условия, при которых случайные процессы $X_{n,N}$ сходятся по распределению (когда $n$ фиксировано, а $Ntoinfty$) в пространстве Скорохода к случайному процессу $nF_n$, где $F_n$ - эмпирический процесс.","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"48 1","pages":""},"PeriodicalIF":0.2,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73701903","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Большие уклонения ветвящегося процесса с частицами двух полов в случайной среде","authors":"Александр Викторович Шкляев, A. V. Shklyaev","doi":"10.4213/dm1778","DOIUrl":"https://doi.org/10.4213/dm1778","url":null,"abstract":"В работе рассматриваются вероятности больших уклонений ветвящегося процесса $N_n$ с частицами двух полов в случайной среде, представляющей собой независимые одинаково распределенные величины. Для такого процесса при определенных условиях на функцию паросочетаний (возможно, зависящую от среды) вводится сопровождающее случайное блуждание $S_n$. При выполнении условия Крамера для шагов блуждания и моментных ограничениях на число потомков одной пары найдена точная асимптотика вероятностей $mathbf{P}(ln N_n in [x,x+Delta_n))$ при значениях $x/n$, изменяющихся в некотором диапазоне, и всех достаточно медленно стремящихся к нулю при $ntoinfty$ последовательностей $Delta_n$. Аналогичная теорема доказывается для ветвящегося процесса с частицами двух полов в случайной среде с иммиграцией.","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"323 1","pages":""},"PeriodicalIF":0.2,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80302180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"New bounds on the nonlinearity of PN and APN functions over finite fields","authors":"Владимир Геннадьевич Рябов, V. G. Ryabov","doi":"10.4213/dm1771","DOIUrl":"https://doi.org/10.4213/dm1771","url":null,"abstract":"Нелинейность векторной функции над конечным полем в статье определяется как расстояние Хэмминга от нее до множества аффинных отображений в пространстве значений всех векторных функций. Для произвольного поля из $q$ элементов получены нижние границы нелинейности PN- и APN-функций от $n$ переменных, равные $q^n - sqrt { q^n - 3 cdot 2^{-2}} - 2^{-1}$ и $q^n - sqrt { 2q^n - 7 cdot 2^{-2}} - 2^{-1}$ соответственно и улучшающие ранее известные границы для булевого случая. Показано, что в качестве верхней границы нелинейности таких функций может быть использована величина $q^n - n - 1$. При $q = 2,3,4$ получены точные значения нелинейности PN- и APN-функций малой размерности.","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"24 1","pages":""},"PeriodicalIF":0.2,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82572286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"О множествах критерия распространения для строго мажоритарных булевых функций","authors":"Глеб Андреевич Исаев, G. A. Isaev","doi":"10.4213/dm1756","DOIUrl":"https://doi.org/10.4213/dm1756","url":null,"abstract":"Исследуется критерий распространения для строго мажоритарных симметрических булевых функций. С помощью аппарата полиномов Кравчука доказано, что критерию распространения для строго мажоритарных функций от $n$ переменных, где $lfloor n/2 rfloor$ нечeтно, удовлетворяют векторы с весом Хэмминга, значение которого отличается от $n/2$ не более чем на $1/2$.","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"30 1","pages":""},"PeriodicalIF":0.2,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80287436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Короткие полные диагностические тесты для схем с двумя дополнительными входами в одном базисе","authors":"Кирилл Андреевич Попков, K. A. Popkov","doi":"10.4213/dm1702","DOIUrl":"https://doi.org/10.4213/dm1702","url":null,"abstract":"Доказано, что любую булеву функцию от $n$ переменных можно смоделировать тестопригодной схемой из функциональных элементов с двумя дополнительными входами в базисе «конъюнкция, косая конъюнкция, дизъюнкция, отрицание», допускающей полный диагностический тест длины не более $2n+3$ относительно константных неисправностей типа $1$ на выходах элементов.","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"69 1","pages":""},"PeriodicalIF":0.2,"publicationDate":"2022-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88942097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes","authors":"Y. Kosolapov, E. A. Lelyuk","doi":"10.17223/20710410/57/2","DOIUrl":"https://doi.org/10.17223/20710410/57/2","url":null,"abstract":"The current task of cryptography is the development of cryptosystems resistant to attacks using quantum computing. One of the promising encryption schemes is the McEliece system based on Goppa codes. However, this system has a number of disadvantages due to the structure of Goppa codes, which makes it relevant to search for other codes for the McEliece scheme. Important requirements for these codes are the presence of a fast decoder and ensuring the resistance of the corresponding cryptosystem to known attacks, including attacks with the Schur - Hadamard product. Many attempts to replace Goppa codes have failed because the corresponding cryptosystems have proven to be unstable against structural attacks. In this paper, it is proposed to use the D-construction (D-code) on binary Reed - Muller codes in the McEliece cryptosystem. This construction is a sum of a special kind of tensor products of binary Reed - Muller codes. There is a fast decoding algorithm for it. To analyze the security of the McEliece scheme on D-codes, we have constructed a structural attack that uses the Schur - Hadamard product of a D-code. To select the parameters that ensure the resistance of the cryptosystem to the constructed attack, we investigate the decomposition of the degree of the D-code into the direct sum of Reed - Muller codes and conclude about the set of strong keys of the cryptosystem.","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"1 1","pages":""},"PeriodicalIF":0.2,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67582922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Short single fault detection tests for logic networks under arbitrary faults of gates","authors":"K. A. Popkov","doi":"10.17223/20710410/55/4","DOIUrl":"https://doi.org/10.17223/20710410/55/4","url":null,"abstract":"It was proved that one can implement any non-constant Boolean function in n variables by an irredundant logic network in the basis {&, ⊕,¬}, allowing, when n ≥ 3, a single fault detection test with length not more than 6n - 10 relative to arbitrary faults of gates.","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"1 1","pages":""},"PeriodicalIF":0.2,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67583046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Superpositions of free Fox derivations","authors":"V. Roman’kov","doi":"10.17223/20710410/56/3","DOIUrl":"https://doi.org/10.17223/20710410/56/3","url":null,"abstract":"Fox derivations are an effective tool for studying free groups and their group rings. Let Fr be a free group of finite rank r with basis {f1,..., fr}. For every i, the partial Fox derivations ∂/∂fi и ∂/∂fi-1 are defined on the group ring ℤ[Fr]. For k / 2, their superpositions Dfϵi = = ∂/∂fϵki о ... о ∂/∂fϵk1, ϵ = (ϵ1,..., ϵk) Є{±1}k, are not Fox derivations. In this paper, we study the properties of superpositions Dfϵi. It is shown that the restrictions of such superpositions to the commutant F′r are Fox derivations. As an application of the obtained results, it is established that for any rational subset R of F′r and any i there are parameters k and ϵ such that R is annihilated by Dfϵi.","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"1 1","pages":""},"PeriodicalIF":0.2,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67583191","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}