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

A framework for constructing impossible differential distinguishers and its applications 一个构造不可能微分区分符的框架及其应用

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-03-10 DOI: 10.1007/s10623-025-01588-x

Wenya Li, Kai Zhang, Bin Hu

{"title":"A framework for constructing impossible differential distinguishers and its applications","authors":"Wenya Li, Kai Zhang, Bin Hu","doi":"10.1007/s10623-025-01588-x","DOIUrl":"https://doi.org/10.1007/s10623-025-01588-x","url":null,"abstract":"The Internet of Things (IoT) has become a necessary part of modern technology, enabling devices to connect and interact with each other. Unless applicable cryptographic components have adequate security protection, the IoT could easily leak private data. Impossible differential cryptanalysis (IDC) is one of the best-known techniques for cryptanalysis of block ciphers. Several papers are aimed at formalizing the IDC and constructing impossible differentials (IDs) automatically. In 2003, Kim et al. proposed a framework for searching IDs, namely the (mathcal {U})-method. Luo et al. improved it and presented the UID-method in 2009. The two methods target word-oriented block ciphers. In this paper, we present a framework for constructing impossible differential distinguishers without a matrix, called the(mathcal {K})3.2 framework. This framework has a wider application on block ciphers than the (mathcal {U})-method, which works on the cipher with a certain property. In particular, the (mathcal {K})3.2 framework employs fewer variables than the (mathcal {U})-method and the UID-method. Furthermore, we present 10 applications on block ciphers and structures. For an IoT cipher, ALLPC, we find the full-round IDs and two longer IDs with five more rounds than full rounds. We find some new results for two ISO standard ciphers. For SKINNY, considering single-key and single-tweakey, we discover the ID with one more round than the previous result. For CLEFIA, we find two new IDs with the length of the previous longest IDs. For LBlock, TWINE, Feistel, Gen-RC6, Gen-Skipjack, Gen-CAST256, and SMS4, we rediscover the known IDs.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"29 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143582742","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

Nonexistence of generalized bent functions and the quadratic norm form equations 广义弯曲函数的不存在性与二次范数形式方程

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-03-09 DOI: 10.1007/s10623-025-01606-y

Chang Lv, Yuqing Zhu

引用次数: 0

Bounds on sphere sizes in the sum-rank metric and coordinate-additive metrics 和秩度量和坐标加性度量中球尺寸的界限

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-03-08 DOI: 10.1007/s10623-025-01604-0

Hugo Sauerbier Couvée, Thomas Jerkovits, Jessica Bariffi

引用次数: 0

The weight distribution of the fourth-order Reed–Muller code of length 512 长度为512的四阶Reed-Muller码的权值分布

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-03-07 DOI: 10.1007/s10623-025-01602-2

Miroslav Markov, Yuri Borissov

引用次数: 0

On linear equivalence, canonical forms, and digital signatures 关于线性等价、规范形式和数字签名

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-03-07 DOI: 10.1007/s10623-025-01576-1

Tung Chou, Edoardo Persichetti, Paolo Santini

{"title":"On linear equivalence, canonical forms, and digital signatures","authors":"Tung Chou, Edoardo Persichetti, Paolo Santini","doi":"10.1007/s10623-025-01576-1","DOIUrl":"https://doi.org/10.1007/s10623-025-01576-1","url":null,"abstract":"Given two linear codes, the code equivalence problem asks to find an isometry mapping one code into the other. The problem can be described in terms of group actions and, as such, finds a natural application in signatures derived from a Zero-Knowledge Proof system. A recent paper, presented at Asiacrypt 2023, showed how a proof of equivalence can be significantly compressed by describing how the isometry acts only on an information set. Still, the resulting signatures are far from being optimal, as the size for a witness to this relation is still significantly larger than the theoretical lower bound, which is twice the security parameter. In this paper, we fill this gap and propose a new notion of equivalence, which leads to a drastically reduced witness size. For many cases, the resulting size is exactly the optimal one given by the lower bound. We achieve this by introducing the framework of canonical representatives, that is, representatives for classes of codes which are equivalent under some notion of equivalence. We propose new notions of equivalence which encompass and further extend all the existing ones: this allows to identify broader classes of equivalent codes, for which the equivalence can be proved with a very compact witness. We associate these new notions to a specific problem, called Canonical Form Linear Equivalence Problem (CF-LEP), which we show to be as hard as the original one (when random codes are considered), providing reductions in both ways. As an added consequence, this reduction leads to a new solver for the code equivalence problem, which is the fastest solver when the finite field size is large enough. Finally, we show that our framework yields a remarkable reduction in signature size when compared to the LESS submission. Our variant is able to obtain very compact signatures, around 2 KB or less, which are among the smallest in the code-based setting.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"85 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143569773","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

How to lose some weight: a practical template syndrome decoding attack 如何减肥：一个实用的模板综合征解码攻击

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-03-07 DOI: 10.1007/s10623-025-01603-1

Sebastian Bitzer, Jeroen Delvaux, Elena Kirshanova, Sebastian Maaßen, Alexander May, Antonia Wachter-Zeh

{"title":"How to lose some weight: a practical template syndrome decoding attack","authors":"Sebastian Bitzer, Jeroen Delvaux, Elena Kirshanova, Sebastian Maaßen, Alexander May, Antonia Wachter-Zeh","doi":"10.1007/s10623-025-01603-1","DOIUrl":"https://doi.org/10.1007/s10623-025-01603-1","url":null,"abstract":"We study the hardness of the Syndrome Decoding problem, the base of most code-based cryptographic schemes, such as Classic McEliece, in the presence of side-channel information. We use ChipWhisperer equipment to perform a template attack on Classic McEliece running on an ARM Cortex-M4, and accurately classify the Hamming weights of consecutive 32-bit blocks of the secret error vector (textbf{e}in {{mathbb {F}}}_2^n). With these weights at hand, we optimize Information Set Decoding algorithms. Technically, we demonstrate how to speed up information set decoding via a dimension reduction, additional parity-check equations, and an improved information set search, all derived from the Hamming-weight information. Consequently, using our template attack, we can practically recover an error vector (textbf{e}in {{mathbb {F}}}_2^n) in dimension (n=2197) in a matter of seconds. Without side-channel information, such an instance has a complexity of around 88 bit. We also estimate how our template attack affects the security of the proposed McEliece parameter sets. Roughly speaking, even an error-prone leak of our Hamming weight information leads for (n=3488) to a security drop of 89 bits.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"67 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143569772","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 ternary codes with few weights 一类少权值的三元码

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-03-06 DOI: 10.1007/s10623-025-01605-z

Kaimin Cheng

{"title":"A class of ternary codes with few weights","authors":"Kaimin Cheng","doi":"10.1007/s10623-025-01605-z","DOIUrl":"https://doi.org/10.1007/s10623-025-01605-z","url":null,"abstract":"Let (ell ^m) be a power with (ell ) a prime greater than 3 and (m) a positive integer such that 3 is a primitive root modulo (2ell ^m). Let (mathbb {F}_3) be the finite field of order 3, and let (mathbb {F}) be the (ell ^{m-1}(ell -1))-th extension field of (mathbb {F}_3). Denote by (text {Tr}) the absolute trace map from (mathbb {F}) to (mathbb {F}_3). For any (alpha in mathbb {F}_3) and (beta in mathbb {F}), let (D) be the set of nonzero solutions in (mathbb {F}) to the equation (text {Tr}(x^{frac{q-1}{2ell ^m}} + beta x) = alpha ). In this paper, we investigate a ternary code (mathcal {C}) of length (n), defined by (mathcal {C}:= {(text {Tr}(d_1x), text {Tr}(d_2x), dots , text {Tr}(d_nx)): x in mathbb {F}}) when we rewrite (D = {d_1, d_2, dots , d_n}). Using recent results on explicit evaluations of exponential sums, the Weil bound, and combinatorial techniques, we determine the Hamming weight distribution of the code (mathcal {C}). Furthermore, we show that when (alpha = beta = 0), the dual code of (mathcal {C}) is optimal with respect to the Hamming bound.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"17 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143569770","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 triple-twisted GRS codes 一类三绞GRS码

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-03-05 DOI: 10.1007/s10623-025-01595-y

Kapish Chand Meena, Piyush Pachauri, Ambrish Awasthi, Maheshanand Bhaintwal

引用次数: 0

Constructing k-ary orientable sequences with asymptotically optimal length 构造长度渐近最优的k元可定向序列

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-28 DOI: 10.1007/s10623-025-01581-4

Daniel Gabrić, Joe Sawada

{"title":"Constructing k-ary orientable sequences with asymptotically optimal length","authors":"Daniel Gabrić, Joe Sawada","doi":"10.1007/s10623-025-01581-4","DOIUrl":"https://doi.org/10.1007/s10623-025-01581-4","url":null,"abstract":"An orientable sequence of order n over an alphabet({0,1,ldots , k{-}1}) is a cyclic sequence such that each length-n substring appears at most once in either direction. When (k= 2), efficient algorithms are known to construct binary orientable sequences, with asymptotically optimal length, by applying the classic cycle-joining technique. The key to the construction is the definition of a parent rule to construct a cycle-joining tree of asymmetric bracelets. Unfortunately, the parent rule does not generalize to larger alphabets. Furthermore, unlike the binary case, a cycle-joining tree does not immediately lead to a simple successor-rule when (k ge 3) unless the tree has certain properties. In this paper, we derive a parent rule to derive a cycle-joining tree of k-ary asymmetric bracelets. This leads to a successor rule that constructs asymptotically optimal k-ary orientable sequences in O(n) time per symbol using O(n) space. In the special case when (n=2), we provide a simple construction of k-ary orientable sequences of maximal length.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"28 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143518771","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

Meet-in-the-middle attack on round-reduced SCARF under single pair-of-tweaks setting 在单对调整设置下，对圆形缩小围巾进行中路攻击

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-27 DOI: 10.1007/s10623-025-01596-x

Siwei Chen, Kai Hu, Guozhen Liu, Zhongfeng Niu, Quan Quan Tan, Shichang Wang

{"title":"Meet-in-the-middle attack on round-reduced SCARF under single pair-of-tweaks setting","authors":"Siwei Chen, Kai Hu, Guozhen Liu, Zhongfeng Niu, Quan Quan Tan, Shichang Wang","doi":"10.1007/s10623-025-01596-x","DOIUrl":"https://doi.org/10.1007/s10623-025-01596-x","url":null,"abstract":"SCARF, an ultra low-latency tweakable block cipher, is the first cipher designed for cache randomization. The block cipher design is significantly different from other common tweakable block ciphers; with a block size of only 10 bits, and yet the input key size is a whopping 240 bits. Notably, the majority of the round key in its round function is absorbed into the data path through AND operations, rather than the typical XOR operations. In this paper, we present a key-recovery attack on a round-reduced version of SCARF with 4 + 4 rounds under the single pair-of-tweaks setting. Our attack is essentially a Meet-in-the-Middle (MitM) attack, where the matching phase is represented by a system of linear equations. Unlike the cryptanalysis conducted by the designers, our attack is effective under both security requirements they have outlined. The data complexity of our attack is (2^{10}) plaintexts, with a time complexity of approximately (2^{60.63}) 4-round of SCARF encryptions. It is important to note that our attack does not threaten the overall security of SCARF.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"38 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143507255","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