Designs, Codes and Cryptography最新文献

Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-01 DOI: 10.1007/s10623-025-01580-5

Zuling Chang, Qiang Wang

引用次数: 0

The revised boomerang connectivity tables and their connection to the difference distribution table

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-01 DOI: 10.1007/s10623-025-01582-3

Kirpa Garg, Sartaj Ul Hasan, Constanza Riera, Pantelimon Stănică

引用次数: 0

Improved Side Channel Attacks on TRIVIUM, GRAIN-128-AEAD, ACORN-128 v3 and ASCON-128a

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-01 DOI: 10.1007/s10623-025-01579-y

Soumya Sahoo, Raghavendra Patil, Sandip Kumar Mondal, Santanu Sarkar, Chester Rebeiro

引用次数: 0

Perturbation-resilient sets for dynamic service balancing

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-01-31 DOI: 10.1007/s10623-025-01565-4

Jin Sima, Chao Pan, Olgica Milenkovic

{"title":"Perturbation-resilient sets for dynamic service balancing","authors":"Jin Sima, Chao Pan, Olgica Milenkovic","doi":"10.1007/s10623-025-01565-4","DOIUrl":"https://doi.org/10.1007/s10623-025-01565-4","url":null,"abstract":"A combinatorial trade is a pair of sets of blocks of elements that can be exchanged while preserving relevant subset intersection constraints. The class of balanced and swap-robust minimal trades was proposed in Pan et al. (in: 2022 IEEE International Symposium on Information Theory (ISIT), IEEE, pp 2385–2390, 2022) for exchanging blocks of data chunks stored on distributed storage systems in an access- and load-balanced manner. More precisely, data chunks in the trades of interest are labeled by popularity ranks and the blocks are required to have both balanced overall popularity and stability properties with respect to swaps in chunk popularities. The original construction of such trades relied on computer search and paired balanced sets obtained through iterative combining of smaller sets that have provable stability guarantees. To reduce the substantial gap between the results of prior approaches and the known theoretical lower bound, we present new analytical upper and lower bounds on the minimal disbalance of blocks introduced by limited-magnitude popularity ranking swaps. Our constructive and near-optimal approach relies on pairs of graphs whose vertices are two balanced sets with edges/arcs that capture the balance and potential balance changes induced by limited-magnitude popularity swaps. In particular, we show that if we start with carefully selected balanced trades and limit the magnitude of rank swaps to one, the new upper and lower bound on the maximum block disbalance caused by a swap only differ by a factor of 1.07. We also extend these results for larger popularity swap magnitudes.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"63 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143072631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Linear complementary pairs of skew constacyclic codes

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-01-31 DOI: 10.1007/s10623-025-01568-1

F. J. Lobillo, José Manuel Muñoz

引用次数: 0

On vectorial functions with maximal number of bent components

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-01-31 DOI: 10.1007/s10623-025-01569-0

Xianhong Xie, Yi Ouyang, Honggang Hu

{"title":"On vectorial functions with maximal number of bent components","authors":"Xianhong Xie, Yi Ouyang, Honggang Hu","doi":"10.1007/s10623-025-01569-0","DOIUrl":"https://doi.org/10.1007/s10623-025-01569-0","url":null,"abstract":"We study vectorial functions with maximal number of bent components in this paper. We first study the Walsh transform and nonlinearity of (F(x)=x^{2^e}h(textrm{Tr}_{2^{2m}/2^m}(x))), where (ege 0) and h(x) is a permutation over ({mathbb {F}}_{2^m}). If h(x) is monomial, the nonlinearity of F(x) is shown to be at most ( 2^{2,m-1}-2^{lfloor frac{3,m}{2}rfloor }) and some non-plateaued and plateaued functions attaining the upper bound are found. If h(x) is linear, the exact nonlinearity of F(x) is determined. Secondly, we give a construction of vectorial functions with maximal number of bent components from known ones, thus obtain two new classes from the Niho class and the Maiorana-McFarland class. Our construction gives a quadratic vectorial function that is not equivalent to the known functions of the form xh(x), and also contains vectorial functions outside the completed Maiorana-McFarland class. Finally, we show that the vectorial function (F: {mathbb {F}}_{2^{2m}}rightarrow {mathbb {F}}_{2^{2m}}), (xmapsto x^{2^m+1}+x^{2^i+1}) has maximal number of bent components if and only if (i=0).","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"63 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143071707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A public key encryption algorithm based on multi-dimensional general Chebyshev polynomial

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-01-30 DOI: 10.1007/s10623-025-01574-3

Rudong Min, Jiale Han, Shouliang Li, Zhen Yang, Yi Yang

{"title":"A public key encryption algorithm based on multi-dimensional general Chebyshev polynomial","authors":"Rudong Min, Jiale Han, Shouliang Li, Zhen Yang, Yi Yang","doi":"10.1007/s10623-025-01574-3","DOIUrl":"https://doi.org/10.1007/s10623-025-01574-3","url":null,"abstract":"Due to the operational efficiency and lower computational costs of the Chebyshev polynomial compared to ECC, this chaotic system has attracted widespread attention in public key cryptography. However, the single recurrence coefficient limitation and inherent short-period flaw, often render the Chebyshev polynomials cryptosystem ineffective against various attacks, such as Exhaustive Attacks and Ciphertext-Only Attacks. To address these vulnerabilities, the Multi-Dimensional General Chebyshev Polynomials (MDGCP) is developed in this study by parameterizing the coefficient of the Chebyshev polynomial over finite fields and converting its variable from one dimension to multiple dimensions. The MDGCP preserves the semigroup property and significantly reduces the likelihood of short periods by imposing a simple and explicit restriction on the initial state matrix. This enhancement improves the complexity and pluralism of the Chebyshev polynomial, thereby increasing its applicability in the design of public key cryptosystems. Consequently, a novel public key encryption algorithm based on MDGCP is proposed. Theoretical analyses and experimental results reveal that the proposed algorithm possesses better abilities than existing public key encryption algorithms based on Chebyshev polynomial in resisting exhaustive attacks and Ciphertext-only attacks.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"45 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143071706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On polynomials over finite fields that are free of binomials

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-01-29 DOI: 10.1007/s10623-025-01573-4

Fabio Enrique Brochero Martínez, Lucas Reis, Sávio Ribas

{"title":"On polynomials over finite fields that are free of binomials","authors":"Fabio Enrique Brochero Martínez, Lucas Reis, Sávio Ribas","doi":"10.1007/s10623-025-01573-4","DOIUrl":"https://doi.org/10.1007/s10623-025-01573-4","url":null,"abstract":"Let (mathbb {F}_q) be the finite field with q elements, where q is a power of a prime p. Given a monic polynomial (f in mathbb {F}_q[x]) that is not divisible by x, there exists a positive integer (e=e(f)) such that f(x) divides the binomial (x^e-1) and e is minimal with this property. The integer e is commonly known as the order of f and we write (textrm{ord}(f)=e). Motivated by a recent work of the second author on primitive k-normal elements over finite fields, in this paper we introduce the concept of polynomials free of binomials. These are the polynomials (f in mathbb {F}_q[x]), not divisible by x, such that f(x) does not divide any binomial (x^d-delta in mathbb {F}_q[x]) with (1le d<textrm{ord}(f)). We obtain some general results on polynomials free of binomials and we focus on the problem of describing the set of degrees of the polynomials that are free of binomials and whose order is fixed. In particular, we completely describe such set when the order equals a positive integer (n>1) whose prime factors divide (p(q-1)). Moreover, we also provide a correspondence between the polynomials that are free of binomials and cyclic codes that cannot be submerged into smaller constacyclic codes.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"23 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143055042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Polynomial reduction from syndrome decoding problem to regular decoding problem

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-01-28 DOI: 10.1007/s10623-025-01567-2

Pavol Zajac

{"title":"Polynomial reduction from syndrome decoding problem to regular decoding problem","authors":"Pavol Zajac","doi":"10.1007/s10623-025-01567-2","DOIUrl":"https://doi.org/10.1007/s10623-025-01567-2","url":null,"abstract":"The regular decoding problem asks for (the existence of) regular solutions to a syndrome decoding problem (SDP). This problem has increased applications in post-quantum cryptography and cryptanalysis. Recently, Esser and Santini explored in depth the connection between the regular (RSD) and classical syndrome decoding problems. They have observed that while RSD to SDP reductions are known (in any parametric regime), a similar generic reduction from SDP to RSD is not known. In our contribution, we examine two different generic polynomial reductions from a syndrome decoding problem to a regular decoding problem instance. The first reduction is based on constructing a special parity check matrix that encodes weight counter progression inside the parity check matrix, which is then the input of the regular decoding oracle. The target regular decoding problem has a significantly longer code length, that depends linearly on the weight parameter of the original SDP. The second reduction is based on translating the SDP to a non-linear system of equations in the Multiple Right-Hand Sides form, and then applying RSD oracle to solve this system. The second reduction has better code length. The ratio between RSD and SDP code length of the second reduction can be bounded by a constant (less than 8).","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"114 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143049911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Symmetric (15, 8, 4)-designs in terms of the geometry of binary simplex codes of dimension 4

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-01-24 DOI: 10.1007/s10623-025-01570-7

Mark Pankov, Krzysztof Petelczyc, Mariusz Żynel

引用次数: 0