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

Structure of CSS and CSS-T quantum codes CSS 和 CSS-T 量子编码的结构

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-05-24 DOI: 10.1007/s10623-024-01415-9

Elena Berardini, Alessio Caminata, Alberto Ravagnani

引用次数: 0

Bounds on data limits for all-to-all comparison from combinatorial designs 组合设计全对全比较的数据限界

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-05-23 DOI: 10.1007/s10623-024-01418-6

Joanne Hall, Daniel Horsley, Douglas R. Stinson

{"title":"Bounds on data limits for all-to-all comparison from combinatorial designs","authors":"Joanne Hall, Daniel Horsley, Douglas R. Stinson","doi":"10.1007/s10623-024-01418-6","DOIUrl":"https://doi.org/10.1007/s10623-024-01418-6","url":null,"abstract":"In situations where every item in a data set must be compared with every other item in the set, it may be desirable to store the data across a number of machines in such a way that any two data items are stored together on at least one machine. One way to evaluate the efficiency of such a distribution is by the largest fraction of the data it requires to be allocated to any one machine. The all-to-all comparison (ATAC) data limit for m machines is a measure of the minimum of this value across all possible such distributions. In this paper we further the study of ATAC data limits. We begin by investigating the data limits achievable using various classes of combinatorial designs. In particular, we examine the cases of transversal designs and projective Hjelmslev planes. We then observe relationships between data limits and the previously studied combinatorial parameters of fractional matching numbers and covering numbers. Finally, we prove a lower bound on the ATAC data limit that improves on one of Hall, Kelly and Tian, and examine the special cases where equality in this bound is possible.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141085453","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 duplication-free codes for disjoint or equal-length errors 关于不相邻或等长错误的无重复编码

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-05-21 DOI: 10.1007/s10623-024-01417-7

Wenjun Yu, Moshe Schwartz

引用次数: 0

Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem 半直接离散对数问题某些实例的高效量子算法

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-05-21 DOI: 10.1007/s10623-024-01416-8

Muhammad Imran, Gábor Ivanyos

{"title":"Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem","authors":"Muhammad Imran, Gábor Ivanyos","doi":"10.1007/s10623-024-01416-8","DOIUrl":"https://doi.org/10.1007/s10623-024-01416-8","url":null,"abstract":"The semidirect discrete logarithm problem (SDLP) is the following analogue of the standard discrete logarithm problem in the semidirect product semigroup (Grtimes {{,textrm{End},}}(G)) for a finite semigroup G. Given (gin G, sigma in {{,textrm{End},}}(G)), and (h=prod _{i=0}^{t-1}sigma ^i(g)) for some integer t, the SDLP((G,sigma )), for g and h, asks to determine t. As Shor’s algorithm crucially depends on commutativity, it is believed not to be applicable to the SDLP. For generic semigroups, the best known algorithm for the SDLP is based on Kuperberg’s subexponential time quantum algorithm. Still, the problem plays a central role in the security of certain proposed cryptosystems in the family of semidirect product key exchange. This includes a recently proposed signature protocol called SPDH-Sign. In this paper, we show that the SDLP is even easier in some important special cases. Specifically, for a finite group G, we describe quantum algorithms for the SDLP in (Grtimes {textrm{Aut}}(G)) for the following two classes of instances: the first one is when G is solvable and the second is when G is a matrix group and a power of (sigma ) with a polynomially small exponent is an inner automorphism of G. We further extend the results to groups composed of factors from these classes. A consequence is that SPDH-Sign and similar cryptosystems whose security assumption is based on the presumed hardness of the SDLP in the cases described above are insecure against quantum attacks. The quantum ingredients we rely on are not new: these are Shor’s factoring and discrete logarithm algorithms and well-known generalizations.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141074250","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 method for constructing quaternary Hermitian self-dual codes and an application to quantum codes 构建四元赫尔墨斯自偶码的方法及其在量子码中的应用

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-05-21 DOI: 10.1007/s10623-024-01421-x

Masaaki Harada

引用次数: 0

Locally maximal recoverable codes and LMR-LCD codes 局部最大可恢复编码和 LMR-LCD 编码

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-05-17 DOI: 10.1007/s10623-024-01419-5

Rajendra Prasad Rajpurohit, Maheshanand Bhaintwal, Charul Rajput

引用次数: 0

LCD codes and almost optimally extendable codes from self-orthogonal codes 液晶编码和自正交编码的几乎最佳扩展编码

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-05-17 DOI: 10.1007/s10623-024-01420-y

Xinran Wang, Ziling Heng, Fengwei Li, Qin Yue

引用次数: 0

On optimal constant weight codes derived from $$omega $$ -circulant balanced generalized weighing matrices 关于从$$omega $$ -circulant平衡广义称重矩阵推导出的最优恒权码

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-05-14 DOI: 10.1007/s10623-024-01414-w

Hadi Kharaghani, Thomas Pender, Vladimir Tonchev

引用次数: 0

Lifting iso-dual algebraic geometry codes 提升等二代数几何代码

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-05-07 DOI: 10.1007/s10623-024-01412-y

María Chara, Ricardo Podestá, Luciane Quoos, Ricardo Toledano

引用次数: 0

Yoyo attack on 4-round Lai-Massey scheme with secret round functions 利用秘密轮函数对 4 轮赖-马西方案进行悠悠攻击

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-05-03 DOI: 10.1007/s10623-024-01408-8

Le Dong, Danxun Zhang, Wenya Li, Wenling Wu

{"title":"Yoyo attack on 4-round Lai-Massey scheme with secret round functions","authors":"Le Dong, Danxun Zhang, Wenya Li, Wenling Wu","doi":"10.1007/s10623-024-01408-8","DOIUrl":"https://doi.org/10.1007/s10623-024-01408-8","url":null,"abstract":"In this study, we present the first yoyo attack to recover the secret round function of the 4-round Lai-Massey scheme with an affine orthomorphism. We first perform a yoyo attack on 3-round Lai-Massey scheme. However, the original method for constructing plaintext equations is not sufficiently effective. To solve this problem, we partition the ciphertext and plaintext spaces into (2^{n}) subsets, which provides a fresh perspective on our yoyo attack. From this perspective, our study presents two improvements. One is that we devise an improved yoyo game in which the established ciphertext pool significantly narrows the search of good pairs compared with random selection, and the inserted filter can eliminate all wrong pairs using simple XOR calculations. Consequently, the yoyo game is advantageous for reducing the complexity of seeking good pairs, and we can avoid the complexity involved in solving equations generated using wrong pairs. The other is that we present a valid method for solving equations, which helps to reduce the number of yoyos required to recover the first-round function. After removing the first round, the look-up tables of the remaining two round functions of the 3-round Lai-Massey scheme can be retrieved by selecting the inputs and accessing the outputs. On the basis of this attack, we mount a yoyo attack on the 4-round Lai-Massey scheme to recover the fourth-round function and then apply the above attack to the remaining three rounds. In general, the complete recovery of the 4-round Lai-Massey scheme requires time complexity O((k_{1}2^{2n})) and memory O((2^{2n})), where (nle k_{1}<2^{n}).","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140890374","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