Designs, Codes and Cryptography最新文献_第8页

On the uniqueness of balanced complex orthogonal design 论平衡复正交设计的唯一性

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-09-03 DOI: 10.1007/s10623-024-01483-x

Yiwen Gao, Yuan Li, Haibin Kan

引用次数: 0

Minimal abundant packings and choosability with separation 最少的丰富包装和分离的可选择性

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-09-03 DOI: 10.1007/s10623-024-01484-w

Zoltán Füredi, Alexandr Kostochka, Mohit Kumbhat

{"title":"Minimal abundant packings and choosability with separation","authors":"Zoltán Füredi, Alexandr Kostochka, Mohit Kumbhat","doi":"10.1007/s10623-024-01484-w","DOIUrl":"https://doi.org/10.1007/s10623-024-01484-w","url":null,"abstract":"A (v, k, t) packing of size b is a system of b subsets (blocks) of a v-element underlying set such that each block has k elements and every t-set is contained in at most one block. P(v, k, t) stands for the maximum possible b. A packing is called abundant if (b> v). We give new estimates for P(v, k, t) around the critical range, slightly improving the Johnson bound and asymptotically determine the minimum (v=v_0(k,t)) when abundant packings exist. For a graph G and a positive integer c, let (chi _ell (G,c)) be the minimum value of k such that one can properly color the vertices of G from any assignment of lists L(v) such that (|L(v)|=k) for all (vin V(G)) and (|L(u)cap L(v)|le c) for all (uvin E(G)). Kratochvíl, Tuza and Voigt in 1998 asked to determine (lim _{nrightarrow infty } chi _ell (K_n,c)/sqrt{cn}) (if it exists). Using our bound on (v_0(k,t)), we prove that the limit exists and equals 1. Given c, we find the exact value of (chi _ell (K_n,c)) for infinitely many n.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"8 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142123908","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

Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field Bandersnatch：在 BLS12-381 标量场上构建的快速椭圆曲线

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-09-01 DOI: 10.1007/s10623-024-01472-0

Simon Masson, Antonio Sanso, Zhenfei Zhang

引用次数: 0

Moments of autocorrelation demerit factors of binary sequences 二进制序列自相关扣分因子的矩

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-09-01 DOI: 10.1007/s10623-024-01482-y

Daniel J. Katz, Miriam E. Ramirez

{"title":"Moments of autocorrelation demerit factors of binary sequences","authors":"Daniel J. Katz, Miriam E. Ramirez","doi":"10.1007/s10623-024-01482-y","DOIUrl":"https://doi.org/10.1007/s10623-024-01482-y","url":null,"abstract":"Sequences with low aperiodic autocorrelation are used in communications and remote sensing for synchronization and ranging. The autocorrelation demerit factor of a sequence is the sum of the squared magnitudes of its autocorrelation values at every nonzero shift when we normalize the sequence to have unit Euclidean length. The merit factor, introduced by Golay, is the reciprocal of the demerit factor. We consider the uniform probability measure on the (2^ell ) binary sequences of length (ell ) and investigate the distribution of the demerit factors of these sequences. Sarwate and Jedwab have respectively calculated the mean and variance of this distribution. We develop new combinatorial techniques to calculate the pth central moment of the demerit factor for binary sequences of length (ell ). These techniques prove that for (pge 2) and (ell ge 4), all the central moments are strictly positive. For any given p, one may use the technique to obtain an exact formula for the pth central moment of the demerit factor as a function of the length (ell ). Jedwab’s formula for variance is confirmed by our technique with a short calculation, and we go beyond previous results by also deriving an exact formula for the skewness. A computer-assisted application of our method also obtains exact formulas for the kurtosis, which we report here, as well as the fifth central moment.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"26 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142100952","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

Storage codes and recoverable systems on lines and grids 线路和电网上的存储代码和可恢复系统

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-09-01 DOI: 10.1007/s10623-024-01481-z

Alexander Barg, Ohad Elishco, Ryan Gabrys, Geyang Wang, Eitan Yaakobi

引用次数: 0

Frequency distance sequences for packet detection in physical-layer security 物理层安全中用于数据包检测的频率距离序列

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-08-31 DOI: 10.1007/s10623-024-01475-x

Radi Abubaker, Guang Gong

{"title":"Frequency distance sequences for packet detection in physical-layer security","authors":"Radi Abubaker, Guang Gong","doi":"10.1007/s10623-024-01475-x","DOIUrl":"https://doi.org/10.1007/s10623-024-01475-x","url":null,"abstract":"In this paper, we investigate how to construct the required sequences to be used as pilot signals for packet detection in physical-layer security. Our construction starts from the frequency domain, where a set of orthogonal frequencies cover an entire given bandwidth. The construction is a generalized construction from Milewski’s construction, where it takes the inverse discrete Fourier transform of the given frequency domain sequences. In this paper, we call a set of the q sequences of length (ell q) with an equal distanced, nonzero frequency response in the frequency domain a frequency distance sequence set (FDSS) and a sequence interleaved from this set an FDSS interleaved sequence. By applying frequency and time domain relations, we show that such a set is mutually orthogonal, and is a complementary sequence set if and only if the seed sequence is perfect (i.e., zero autocorrelation at all out-of-phase shift). The FDSS interleaved sequence is perfect if and only if the seed sequence is perfect. We apply the proposed sequences to real world experiments as pilot sequences for coarse synchronization. In our experiments, we selected Frank–Zadoff–Chu sequences and Golay pair sequences in our construction for use with an ADALM-Pluto SDR from Analog Devices and simulations, and we show the pilot detection rate under different noisy channel conditions, when compared to alternative pilot selections. The false negative detection rate of our pilot decreases to zero when the SNR is 20 dB. In contrast, a general OFDM QPSK pilot has a false-negative detection rate near 70% at the same SNR. In general, our pilot sequence consistently has a lower false-negative rate to the OFDM QPSK pilot, which failed to detect most packets in the ADALM-Pluto SDR environment.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"380 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142100953","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

Time-based attribute-based proxy re-encryption with decryption key update 基于时间属性的代理重新加密与解密密钥更新

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-08-31 DOI: 10.1007/s10623-024-01467-x

Feixiang Zhao, Jian Weng, Wenli Xie, Lin Hou, Ming Li

{"title":"Time-based attribute-based proxy re-encryption with decryption key update","authors":"Feixiang Zhao, Jian Weng, Wenli Xie, Lin Hou, Ming Li","doi":"10.1007/s10623-024-01467-x","DOIUrl":"https://doi.org/10.1007/s10623-024-01467-x","url":null,"abstract":"Proxy re-encryption (PRE) is a cryptosystem that realizes efficient encrypted data sharing by allowing a third party proxy to transform a ciphertext intended for a delegator (i.e., Alice) to a ciphertext intended for a delegatee (i.e., Bob). Attribute-based proxy re-encrypftion (AB-PRE) generalizes PRE to the attribute-based scenarios, enabling fine-grained access control on ciphertexts. However, the existing AB-PRE schemes do not adequately address the following problems: (1) the risk of decryption key leakage, and (2) the need of time-based delegation. To resolve these problems, we introduce a primitive called time-based attribute-based proxy re-encryption (TB-AB-PRE) with decryption key update. TB-AB-PRE associates keys with the current time information and supports efficient periodical decryption key update for each time transition. This property guarantees that a compromise of a decryption key for some time does not breach the security of ciphertexts from the others. Leveraging this time-based property, the proposed TB-AB-PRE elegantly achieves time-based delegation which enables Alice to decide which ciphertexts can be transformed and their decryptable timeframe after being transformed. The proposed construction is proven to be secure against honest re-encryption attacks with decryption key exposure resistance, under the learning with errors assumption.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"8 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142100949","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 the construction of certain odd degree irreducible polynomials over finite fields 论有限域上某些奇度不可还原多项式的构造

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-08-27 DOI: 10.1007/s10623-024-01479-7

Melek Çil, Barış Bülent Kırlar

引用次数: 0

An algebraic approach to circulant column parity mixers 圆柱奇偶校验混合器的代数方法

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-08-21 DOI: 10.1007/s10623-024-01476-w

Robert Christian Subroto

{"title":"An algebraic approach to circulant column parity mixers","authors":"Robert Christian Subroto","doi":"10.1007/s10623-024-01476-w","DOIUrl":"https://doi.org/10.1007/s10623-024-01476-w","url":null,"abstract":"Circulant Column Parity Mixers (CCPMs) are a particular type of linear maps, used as the mixing layer in permutation-based cryptographic primitives like Keccak-f (SHA3) and Xoodoo. Although being successfully applied, not much is known regarding their algebraic properties. They are limited to invertibility of CCPMs, and that the set of invertible CCPMs forms a group. A possible explanation is due to the complexity of describing CCPMs in terms of linear algebra. In this paper, we introduce a new approach to studying CCPMs using module theory from commutative algebra. We show that many interesting algebraic properties can be deduced using this approach, and that known results regarding CCPMs resurface as trivial consequences of module theoretic concepts. We also show how this approach can be used to study the linear layer of Xoodoo, and other linear maps with a similar structure which we call DCD-compositions. Using this approach, we prove that every DCD-composition where the underlying vector space with the same dimension as that of Xoodoo has a low order. This provides a solid mathematical explanation for the low order of the linear layer of Xoodoo, which equals 32. We design a DCD-composition using this module-theoretic approach, but with a higher order using a different dimension.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"1 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142022186","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 Boolean functions derived from linear maps over $$mathbb {Z}_4$$ and their application to secret sharing 论从 $$mathbb {Z}_4$$ 上的线性映射派生的布尔函数及其在秘密共享中的应用

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-08-16 DOI: 10.1007/s10623-024-01478-8

Deepak Agrawal, Srinivasan Krishnaswamy, Smarajit Das

引用次数: 0