Designs, Codes and Cryptography最新文献

筛选
英文 中文
The weight hierarchies of three classes of linear codes 三类线性码的权重层次
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2024-12-27 DOI: 10.1007/s10623-024-01553-0
Wei Lu, Qingyao Wang, Xiaoqiang Wang, Dabin Zheng
{"title":"The weight hierarchies of three classes of linear codes","authors":"Wei Lu, Qingyao Wang, Xiaoqiang Wang, Dabin Zheng","doi":"10.1007/s10623-024-01553-0","DOIUrl":"https://doi.org/10.1007/s10623-024-01553-0","url":null,"abstract":"<p>Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in various applications. However, determining the generalized Hamming weights of linear codes, particularly their weight hierarchy, is generally a challenging task. In this paper, we focus on investigating the generalized Hamming weights of three classes of linear codes over finite fields. These codes are constructed by different defining sets. By analysing the intersections between the definition sets and the duals of all <i>r</i>-dimensional subspaces, we get the inequalities on the sizes of these intersections. Then constructing subspaces that reach the upper bounds of these inequalities, we successfully determine the complete weight hierarchies of these codes.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"87 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142887805","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
Several families of negacyclic BCH codes and their duals 几个负环BCH码族及其对偶
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2024-12-27 DOI: 10.1007/s10623-024-01551-2
Zhonghua Sun, Xinyue Liu
{"title":"Several families of negacyclic BCH codes and their duals","authors":"Zhonghua Sun, Xinyue Liu","doi":"10.1007/s10623-024-01551-2","DOIUrl":"https://doi.org/10.1007/s10623-024-01551-2","url":null,"abstract":"<p>Negacyclic BCH codes are a special subclasses of negacyclic codes, and have the best parameters known in many cases. A family of good negacyclic BCH codes are the <i>q</i>-ary narrow-sense negacyclic BCH codes of length <span>(n=(q^m-1)/2)</span>, where <i>q</i> is an odd prime power. Little is known about the true minimum distance of this family of negacyclic BCH codes and the dimension of this family of negacyclic BCH codes with large designed distance. The main objective of this paper is to study three subfamilies of this family of negacyclic BCH codes. The dimension and true minimum distance of a subfamily of the <i>q</i>-ary narrow-sense negacyclic BCH codes of length <i>n</i> are determined. The dimension and good lower bounds on the minimum distance of two subfamilies of the <i>q</i>-ary narrow-sense negacyclic BCH codes of length <i>n</i> are presented. The minimum distances of the duals of the <i>q</i>-ary narrow-sense negacyclic BCH codes of length <i>n</i> are also investigated. As will be seen, the three subfamilies of negacyclic BCH codes are sometimes distance-optimal and sometimes have the same parameters as the best linear codes known.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"25 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142887804","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
Fault attacks on multi-prime RSA signatures 针对RSA多素数签名的故障攻击
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2024-12-27 DOI: 10.1007/s10623-024-01554-z
Chunzhi Zhao, Jinzheng Cao, Junqi Zhang, Qingfeng Cheng
{"title":"Fault attacks on multi-prime RSA signatures","authors":"Chunzhi Zhao, Jinzheng Cao, Junqi Zhang, Qingfeng Cheng","doi":"10.1007/s10623-024-01554-z","DOIUrl":"https://doi.org/10.1007/s10623-024-01554-z","url":null,"abstract":"<p>At CHES 2009, Coron et al. proposed a fault attack on standard RSA signatures based on Coppersmith’s method. This work greatly enhances the practicality of fault attacks on RSA signatures. In practice, multi-prime RSA signatures are widely used due to their faster generation speed. In this paper, we propose fault attacks on multi-prime RSA signatures under the PKCS#1 v2.x protocols. We conduct the fault attacks based on Coppersmith’s method in various scenarios. To be specific, we first consider the case where there is only one fault signature, and then we consider the cases where there are multiple fault signatures with co-prime moduli, common moduli, and arbitrary moduli. For each case, we give the upper bound of the unknowns that can be solved in polynomial time, which improves the practicability of the attacks. Our research is grounded in the EMSA-PKCS1-v1_5 encoding method and has been verified by experiments.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"33 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142887807","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 vector subspaces of $$mathbb {F}_{2^n}$$ over which the multiplicative inverse function sums to zero 在$$mathbb {F}_{2^n}$$的向量子空间上,其上的乘法逆函数和为零
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2024-12-27 DOI: 10.1007/s10623-024-01531-6
Claude Carlet
{"title":"On the vector subspaces of $$mathbb {F}_{2^n}$$ over which the multiplicative inverse function sums to zero","authors":"Claude Carlet","doi":"10.1007/s10623-024-01531-6","DOIUrl":"https://doi.org/10.1007/s10623-024-01531-6","url":null,"abstract":"<p>We study the behavior of the multiplicative inverse function (which plays an important role in cryptography and in the study of finite fields), with respect to a recently introduced generalization of almost perfect nonlinearity (APNness), called <i>k</i>th-order sum-freedom, that extends a classic characterization of APN functions, and has also some relationship with integral attacks. This generalization corresponds to the fact that a vectorial function <span>(F:mathbb {F}_2^nmapsto mathbb {F}_2^m)</span> sums to a nonzero value over every <i>k</i>-dimensional affine subspace of <span>(mathbb {F}_2^n)</span>, for some <span>(kle n)</span> (APNness corresponds to <span>(k=2)</span>). The sum of the values of the inverse function <span>(xin mathbb {F}_{2^n}mapsto x^{2^n-2}in mathbb {F}_{2^n})</span> over any affine subspace <i>A</i> of <span>(mathbb {F}_{2^n})</span> not containing 0 (i.e. being not a vector space) has been addressed, thanks to a simple expression of such sum, which shows that it never vanishes. We study in the present paper the case of vector (i.e. linear) subspaces, which is much less simple to handle. The sum depends on a coefficient in subspace polynomials. We study for which values of <i>k</i> the multiplicative inverse function can sum to nonzero values over all <i>k</i>-dimensional vector subspaces. We show that, for every <i>k</i> not co-prime with <i>n</i>, it sums to zero over at least one <i>k</i>-dimensional <span>(mathbb {F}_2)</span>-subspace of <span>(mathbb {F}_{2^n})</span>. We study the behavior of the inverse function over direct sums of vector spaces and we deduce that the property of the inverse function to be <i>k</i>th-order sum-free happens for <i>k</i> if and only if it happens for <span>(n-k)</span>. We derive several other results and we show that the set of values <i>k</i> such that the inverse function is not <i>k</i>th-order sum-free is stable when adding two values of <i>k</i> whose product is smaller than <i>n</i> (and when subtracting two values under some conditions). We clarify the case of dimension at most 4 (equivalently, of co-dimension at most 4) and this allows to address, for every <i>n</i>, all small enough values of <i>k</i> of the form <span>(3a+4b)</span>.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"31 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142887806","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
Codes from $$A_m$$ -invariant polynomials 代码来自$$A_m$$ -不变多项式
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2024-12-27 DOI: 10.1007/s10623-024-01550-3
Giacomo Micheli, Vincenzo Pallozzi Lavorante, Phillip Waitkevich
{"title":"Codes from $$A_m$$ -invariant polynomials","authors":"Giacomo Micheli, Vincenzo Pallozzi Lavorante, Phillip Waitkevich","doi":"10.1007/s10623-024-01550-3","DOIUrl":"https://doi.org/10.1007/s10623-024-01550-3","url":null,"abstract":"<p>Let <i>q</i> be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on <span>({mathbb {F}}_q[x_1,dots ,x_m])</span> combined with the ideas in Datta and Johnsen (Des Codes Cryptogr 91(3):747–761, 2023). Compared with Generalized Reed–Muller codes with analogous parameters, our codes have the same asymptotic relative distance but a better rate. Our results follow from combinations of Galois theoretical methods with Weil-type bounds for hypersurfaces.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"153 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142887319","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
The support designs of several families of lifted linear codes 几种提升线性码族的支撑设计
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2024-12-25 DOI: 10.1007/s10623-024-01549-w
Cunsheng Ding, Zhonghua Sun, Qianqian Yan
{"title":"The support designs of several families of lifted linear codes","authors":"Cunsheng Ding, Zhonghua Sun, Qianqian Yan","doi":"10.1007/s10623-024-01549-w","DOIUrl":"https://doi.org/10.1007/s10623-024-01549-w","url":null,"abstract":"<p>A generator matrix of a linear code <span>({mathcal {C}})</span> over <span>({textrm{GF}}(q))</span> is also a matrix of the same rank <i>k</i> over any extension field <span>({textrm{GF}}(q^ell ))</span> and generates a linear code of the same length, same dimension and same minimum distance over <span>({textrm{GF}}(q^ell ))</span>, denoted by <span>({mathcal {C}}(q|q^ell ))</span> and called a lifted code of <span>({mathcal {C}})</span>. Although <span>({mathcal {C}})</span> and their lifted codes <span>({mathcal {C}}(q|q^ell ))</span> have the same parameters, they have different weight distributions and different applications. Few results about lifted linear codes are known in the literature. This paper proves some fundamental theory for lifted linear codes, and studies the 2-designs of the lifted projective Reed–Muller codes, lifted Hamming codes and lifted Simplex codes. In addition, this paper settles the weight distributions of the lifted Reed–Muller codes of certain orders, and investigates the 3-designs supported by these lifted codes. As a by-product, an infinite family of three-weight projective codes over <span>({textrm{GF}}(4))</span> is obtained.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"25 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142884413","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
Low-weight codewords in cyclic codes 循环码中的低权重码字
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2024-12-24 DOI: 10.1007/s10623-024-01547-y
J. G. Coelho, F. E. Brochero Martínez
{"title":"Low-weight codewords in cyclic codes","authors":"J. G. Coelho, F. E. Brochero Martínez","doi":"10.1007/s10623-024-01547-y","DOIUrl":"https://doi.org/10.1007/s10623-024-01547-y","url":null,"abstract":"<p>We introduce a formula for determining the number of codewords of weight 2 in cyclic codes and provide results related to the count of codewords with weight 3. Additionally, we establish a recursive relationship for binary cyclic codes that connects their weight distribution to the number of solutions of associated systems of polynomial equations. This relationship allows for the computation of weight distributions from known solutions of systems of diagonal equations and vice versa, offering a new insight into the structure and properties of binary cyclic codes.\u0000</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"123 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142884410","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 class of permutations on $${mathbb {Z}}_{p}$$ with differential uniformity at most 3 $${mathbb {Z}}_{p}$$上微分均匀性最多为3的一类置换
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2024-12-22 DOI: 10.1007/s10623-024-01548-x
Prachi Gupta, P. R. Mishra, Atul Gaur
{"title":"A class of permutations on $${mathbb {Z}}_{p}$$ with differential uniformity at most 3","authors":"Prachi Gupta, P. R. Mishra, Atul Gaur","doi":"10.1007/s10623-024-01548-x","DOIUrl":"https://doi.org/10.1007/s10623-024-01548-x","url":null,"abstract":"<p>In this paper, we give a class of permutations on <span>({mathbb {Z}}_{p})</span> having differential uniformity at most 3, where prime <i>p</i> satisfies <span>(p equiv 1 pmod {4})</span>. Further, we present a sufficient condition for differential uniformity exactly 3 and identify a subclass achieving this value.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"1 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142869956","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
Guessing less and better: improved attacks on GIFT-64 猜测更少,更好:改进对GIFT-64的攻击
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2024-12-20 DOI: 10.1007/s10623-024-01527-2
Federico Canale, María Naya-Plasencia
{"title":"Guessing less and better: improved attacks on GIFT-64","authors":"Federico Canale, María Naya-Plasencia","doi":"10.1007/s10623-024-01527-2","DOIUrl":"https://doi.org/10.1007/s10623-024-01527-2","url":null,"abstract":"<p>GIFT-64 is a block cipher that has received a lot of attention from the community since its proposal in 2017. The attack on the highest number of rounds is a differential related-key attack on 26 rounds. We studied this attack, in particular with respect to some recent generic frameworks for improving key recovery, and we realised that this framework, combined with an efficient parallel key guessing of interesting subsets of the key and a consequent list merging applied to the partial solutions, can improve the complexity of the attack. We propose two different trade-offs, as a result of the improved key-recovery. We believe that the techniques are quite generic and that it is possible to apply them to improve other differential attacks.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"31 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142867061","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 automorphism groups of binary cyclic codes 论二元循环码的自形群
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2024-12-20 DOI: 10.1007/s10623-024-01539-y
Jicheng Ma, Guiying Yan
{"title":"On automorphism groups of binary cyclic codes","authors":"Jicheng Ma, Guiying Yan","doi":"10.1007/s10623-024-01539-y","DOIUrl":"https://doi.org/10.1007/s10623-024-01539-y","url":null,"abstract":"<p>Cyclic codes, as a significant subclass of linear codes, can be constructed and analyzed using algebraic methods. Due to its cyclic nature, they have efficient encoding and decoding algorithms. To date, cyclic codes have found applications in various domains, including consumer electronics, data storage systems, and communication systems. In this paper, we investigate the full automorphism groups of binary cyclic codes. A matrix presentation technique of cyclic codewords is introduced, which subsequently serves well for presenting binary cyclic codes of long lengths. These constructions are significantly useful in facilitating the determination of the full automorphism groups of binary cyclic codes of specified lengths.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"8 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142867031","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信