发布求助
文献互助 智能选刊 最新文献

Cryptography and Communications最新文献

筛选
英文 中文
Correction: Low-hit-zone frequency hopping sequence sets under aperiodic Hamming correlation 更正：非周期性汉明相关性下的低命中区跳频序列集
Cryptography and Communications Pub Date : 2024-04-12 DOI: 10.1007/s12095-024-00714-1
Xing Liu
{"title":"Correction: Low-hit-zone frequency hopping sequence sets under aperiodic Hamming correlation","authors":"Xing Liu","doi":"10.1007/s12095-024-00714-1","DOIUrl":"https://doi.org/10.1007/s12095-024-00714-1","url":null,"abstract":"","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"2 12","pages":"647"},"PeriodicalIF":0.0,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140710647","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}
引用次数: 0
Mumford representation and Riemann-Roch space of a divisor on a hyperelliptic curve 超椭圆曲线上除数的姆福德表示和黎曼-罗赫空间
Cryptography and Communications Pub Date : 2024-04-10 DOI: 10.1007/s12095-024-00713-2
Giovanni Falcone, Giuseppe Filippone
{"title":"Mumford representation and Riemann-Roch space of a divisor on a hyperelliptic curve","authors":"Giovanni Falcone, Giuseppe Filippone","doi":"10.1007/s12095-024-00713-2","DOIUrl":"https://doi.org/10.1007/s12095-024-00713-2","url":null,"abstract":"<p>For an (imaginary) hyperelliptic curve <span>(mathcal {H})</span> of genus <i>g</i>, with a Weierstrass point <span>(Omega )</span>, taken as the point at infinity, we determine a basis of the Riemann-Roch space <span>(mathcal {L}(Delta + m Omega ))</span>, where <span>(Delta )</span> is of degree zero, directly from the Mumford representation of <span>(Delta )</span>. This provides in turn a generating matrix of a Goppa code.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"27 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140599079","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}
引用次数: 0
New linear approximation of modular addition and improved differential-linear cryptanalysis of SPARX-64/128 模块加法的新线性近似和 SPARX-64/128 的改进微分线性密码分析
Cryptography and Communications Pub Date : 2024-04-01 DOI: 10.1007/s12095-024-00708-z
Zhichao Xu, Hong Xu, Lin Tan, Wenfeng Qi
{"title":"New linear approximation of modular addition and improved differential-linear cryptanalysis of SPARX-64/128","authors":"Zhichao Xu, Hong Xu, Lin Tan, Wenfeng Qi","doi":"10.1007/s12095-024-00708-z","DOIUrl":"https://doi.org/10.1007/s12095-024-00708-z","url":null,"abstract":"<p>Differential-linear cryptanalysis is an efficient cryptanalysis method to attack ARX ciphers, which have been used to present the best attacks on many ARX primitives such as Chaskey and Chacha. In this paper, we present the differential-linear cryptanalysis of another ARX-based block cipher SPARX-64/128. We first construct multiple 6-round differential-linear distinguishers based on the structure of SPARX-64/128, and then extend them into 14-round differential-linear distinguishers by adding a 7-round differential characteristic before and a one-round linear approximation after the distinguishers. Then we introduce a new linear approximation of modular addition, and use it to extend one more round after the 14-round differential-linear distinguishers. With the 15-round differential-linear distinguishers, we present a differential-linear attack on 18-round SPARX-64/128.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140599233","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}
引用次数: 0
Sequences with ideal auto-correlation derived from group actions 由群体行为得出的具有理想自相关性的序列
Cryptography and Communications Pub Date : 2024-03-22 DOI: 10.1007/s12095-024-00710-5
Hongyang Xiao, Xiwang Cao
{"title":"Sequences with ideal auto-correlation derived from group actions","authors":"Hongyang Xiao, Xiwang Cao","doi":"10.1007/s12095-024-00710-5","DOIUrl":"https://doi.org/10.1007/s12095-024-00710-5","url":null,"abstract":"<p>Bent functions have a number of practical applications in cryptography, coding theory, and other fields. Fourier transform is a key tool to study bent functions on finite abelian groups. Using Fourier transforms, in this paper, we first present two necessary and sufficient conditions on the existence of bent functions via faithful actions of finite abelian groups and then show two constructions of sequences with ideal auto-correlation (SIACs). In addition, we construct a periodic complementary sequence set (PCSS) by rearranging a periodic multiple shift sequence (PMSS) corresponding to a bent function on a finite abelian group. Some concrete constructions of SIACs and PCSSs are provided to illustrate the efficiency of our methods.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"306 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140202440","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}
引用次数: 0
Abelian and consta-Abelian polyadic codes over affine algebras with a finite commutative chain coefficient ring 具有有限交换链系数环的仿射代数上的阿贝尔和常阿贝尔多义码
Cryptography and Communications Pub Date : 2024-03-15 DOI: 10.1007/s12095-024-00707-0
Gülsüm Gözde Yılmazgüç, Javier de la Cruz, Edgar Martínez-Moro
{"title":"Abelian and consta-Abelian polyadic codes over affine algebras with a finite commutative chain coefficient ring","authors":"Gülsüm Gözde Yılmazgüç, Javier de la Cruz, Edgar Martínez-Moro","doi":"10.1007/s12095-024-00707-0","DOIUrl":"https://doi.org/10.1007/s12095-024-00707-0","url":null,"abstract":"<p>This paper studies Abelian and consta-Abelian polyadic codes over rings defined as affine algebras over chain rings. For this purpose, we use the classical construction via splittings and multipliers of the underlying Abelian group. We also derive some results on the structure of the associated polyadic codes and the number of codes under these conditions.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"80 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140153646","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}
引用次数: 0
Representing the inverse map as a composition of quadratics in a finite field of characteristic 2 将逆映射表示为特征 2 有限域中的二次函数组合
Cryptography and Communications Pub Date : 2024-03-09 DOI: 10.1007/s12095-024-00702-5
Florian Luca, Santanu Sarkar, Pantelimon Stănică
{"title":"Representing the inverse map as a composition of quadratics in a finite field of characteristic 2","authors":"Florian Luca, Santanu Sarkar, Pantelimon Stănică","doi":"10.1007/s12095-024-00702-5","DOIUrl":"https://doi.org/10.1007/s12095-024-00702-5","url":null,"abstract":"<p>In 1953, Carlitz showed that all permutation polynomials over <span>({mathbb F}_q)</span>, where <span>(q&gt;2)</span> is a power of a prime, are generated by the special permutation polynomials <span>(x^{q-2})</span> (the inversion) and <span>( ax+b)</span> (affine functions, where <span>(0ne a, bin {mathbb F}_q)</span>). Recently, Nikova, Nikov and Rijmen (2019) proposed an algorithm (NNR) to find a decomposition of the inverse function in quadratics, and computationally covered all dimensions <span>(nle 16)</span>. Petrides (2023) theoretically found a class of integers for which it is easy to decompose the inverse into quadratics, and improved the NNR algorithm, thereby extending the computation up to <span>(nle 32)</span>. In this paper, we extend Petrides’ result, as well as we propose a new number theoretical approach, which allows us to easily cover all (surely, odd) exponents up to 250, at least.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140098240","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}
引用次数: 0
An improvement on Weil bounds for character sums of polynomials over finite fields 有限域上多项式特征和的魏尔界的改进
Cryptography and Communications Pub Date : 2024-03-06 DOI: 10.1007/s12095-024-00706-1
Fengwei Li, Fanhui Meng, Ziling Heng, Qin Yue
{"title":"An improvement on Weil bounds for character sums of polynomials over finite fields","authors":"Fengwei Li, Fanhui Meng, Ziling Heng, Qin Yue","doi":"10.1007/s12095-024-00706-1","DOIUrl":"https://doi.org/10.1007/s12095-024-00706-1","url":null,"abstract":"<p>Let <span>(mathbb {F}_q)</span> be a finite field with <i>q</i> elements, where <i>q</i> is a power of a prime <i>p</i>. In this paper, we obtain an improvement on Weil bounds for character sums associated to a polynomial <i>f</i>(<i>x</i>) over <span>(mathbb {F}_q )</span>, which extends the results of Wan et al. (Des. Codes Cryptogr. <b>81</b>, 459–468, 2016) and Wu et al. (Des. Codes Cryptogr. <b>90</b>, 2813–2821, 2022).</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"300 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140055744","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}
引用次数: 0
The [1, 0]-twisted generalized Reed-Solomon code [1，0]扭曲的广义里德-所罗门码
Cryptography and Communications Pub Date : 2024-02-27 DOI: 10.1007/s12095-024-00704-3
Canze Zhu, Qunying Liao
{"title":"The [1, 0]-twisted generalized Reed-Solomon code","authors":"Canze Zhu, Qunying Liao","doi":"10.1007/s12095-024-00704-3","DOIUrl":"https://doi.org/10.1007/s12095-024-00704-3","url":null,"abstract":"<p>In this paper, we not only give the parity check matrix of the [1, 0]-twisted generalized Reed-Solomon (in short, TGRS) code, but also determine the weight distribution. Especially, we show that the [1, 0]-TGRS code is not GRS or EGRS. Furthermore, we present a sufficient and necessary condition for any punctured code of the [1, 0]-TGRS code to be self-orthogonal, and then construct several classes of self-dual or almost self-dual [1, 0]-TGRS codes. Finally, on the basis of these self-dual or almost self-dual [1, 0]-TGRS codes, we obtain some LCD [1, 0]-TGRS codes.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"36 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139978007","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}
引用次数: 0
Boolean functions of binary Type-II and Type-III/II complementary array pairs 二进制 Type-II 和 Type-III/II 互补阵列对的布尔函数
Cryptography and Communications Pub Date : 2024-02-24 DOI: 10.1007/s12095-024-00701-6
Erzhong Xue, Zilong Wang, Jinjin Chai
{"title":"Boolean functions of binary Type-II and Type-III/II complementary array pairs","authors":"Erzhong Xue, Zilong Wang, Jinjin Chai","doi":"10.1007/s12095-024-00701-6","DOIUrl":"https://doi.org/10.1007/s12095-024-00701-6","url":null,"abstract":"<p>The sequence pairs of length <span>(2^{m})</span> projected from Type-II and Type-III/II complementary array pairs of size <span>(2times 2times cdots times 2)</span> (<i>m</i>-times) form Type-II and Type-III complementary sequence pairs, respectively. An exhaustive search for binary Type-II and Type-III complementary sequence pairs of small lengths <span>(2^{m})</span> (<span>(m=1,2,3,4)</span>) shows that they are all projected from the aforementioned complementary array pairs, whose algebraic normal forms satisfy specified expressions. It’s natural to ask whether the conclusion holds for all <i>m</i>. In this paper, we proved that these expressions of algebraic normal forms determine all the binary Type-II and Type-III/II complementary array pairs of size <span>(2times 2times cdots times 2)</span>.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"57 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139953628","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}
引用次数: 0
Complete characterization of a class of permutation trinomials in characteristic five 特性五中一类置换三项式的完整表征
Cryptography and Communications Pub Date : 2024-02-21 DOI: 10.1007/s12095-024-00705-2
Markus Grassl, Ferruh Özbudak, Buket Özkaya, Burcu Gülmez Temür
{"title":"Complete characterization of a class of permutation trinomials in characteristic five","authors":"Markus Grassl, Ferruh Özbudak, Buket Özkaya, Burcu Gülmez Temür","doi":"10.1007/s12095-024-00705-2","DOIUrl":"https://doi.org/10.1007/s12095-024-00705-2","url":null,"abstract":"<p>In this paper, we address an open problem posed by Bai and Xia in [2]. We study polynomials of the form <span>(f(x)=x^{4q+1}+lambda _1x^{5q}+lambda _2x^{q+4})</span> over the finite field <span>({mathbb F}_{5^{k}})</span>, which are not quasi-multiplicative equivalent to any of the known permutation polynomials in the literature. We find necessary and sufficient conditions on <span>(lambda _1, lambda _2 in {mathbb F}_{5^{k}})</span> so that <i>f</i>(<i>x</i>) is a permutation monomial, binomial, or trinomial of <span>({mathbb F}_{5^{2k}})</span>.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139921188","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}
引用次数: 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学术官方微信