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

On equidistant single-orbit cyclic and quasi-cyclic subspace codes 关于等距单轨循环和拟循环子空间码

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-12 DOI: 10.1007/s10623-025-01586-z

Mahak, Maheshanand Bhaintwal

引用次数: 0

Construction of optimal flag codes by MRD codes 用MRD码构造最优标志码

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-10 DOI: 10.1007/s10623-025-01584-1

Shuangqing Liu, Shuhui Yu, Lijun Ji

引用次数: 0

The asymptotic existence of BIBDs having a nesting 具有嵌套的bibd的渐近存在性

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-08 DOI: 10.1007/s10623-025-01583-2

Xinyue Ming, Tao Feng, Menglong Zhang

{"title":"The asymptotic existence of BIBDs having a nesting","authors":"Xinyue Ming, Tao Feng, Menglong Zhang","doi":"10.1007/s10623-025-01583-2","DOIUrl":"https://doi.org/10.1007/s10623-025-01583-2","url":null,"abstract":"A ((v,k,lambda ))-BIBD ((X,mathcal {B})) has a nesting if there is a mapping (phi :mathcal {B}rightarrow X) such that ((X,{Bcup {phi (B)}mid Bin mathcal {B}})) is a ((v,k+1,lambda +1))-packing. If the ((v,k+1,lambda +1))-packing is a ((v,k+1,lambda +1))-BIBD, then this nesting is said to be perfect. We show that given any positive integers k and (lambda ), if (kge 2lambda +2), then for any sufficiently large v, every ((v,k,lambda ))-BIBD can be nested into a ((v,k+1,lambda +1))-packing; and if (k=2lambda +1), then for any sufficiently large v satisfying (v equiv 1 pmod {2k}), there exists a ((v,k,lambda ))-BIBD having a perfect nesting. Banff difference families (BDF), as a special kind of difference families (DF), can be used to generate nested BIBDs. We show that if G is a finite abelian group with a large size whose number of order 2 elements is no more than a given constant, and (kge 2lambda +2), then one can obtain a ((G,k,lambda ))-BDF by taking any ((G,k,lambda ))-DF and then replacing each of its base blocks by a suitable translation. This is a Novák-like theorem. The generalized Novák’s conjecture states that given any positive integers k and (lambda ) with (kge lambda +1), there exists an integer (v_0) such that, for any cyclic ((v,k,lambda ))-BIBD with (vge v_0), it is always possible to choose one block from each block orbit so that the chosen blocks are pairwise disjoint. We confirm this conjecture for every (kge lambda +2). Most of the theorems in this paper are based on a recent result presented by Delcourt and Postle on the asymptotic existence of an A-perfect matching of a bipartite hypergraph.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"12 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143371556","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

Can we beat three halves lower bound? (Im)possibility of reducing communication cost for garbled circuits 我们能打败3 / 2的下界吗？降低乱码电路通信成本的可能性

IF 1.6 2区数学

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

Chunghun Baek, Taechan Kim

引用次数: 0

New models for the cryptanalysis of ASCON ASCON密码分析的新模型

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-08 DOI: 10.1007/s10623-025-01572-5

Mathieu Degré, Patrick Derbez, Lucie Lahaye, André Schrottenloher

{"title":"New models for the cryptanalysis of ASCON","authors":"Mathieu Degré, Patrick Derbez, Lucie Lahaye, André Schrottenloher","doi":"10.1007/s10623-025-01572-5","DOIUrl":"https://doi.org/10.1007/s10623-025-01572-5","url":null,"abstract":"This paper focuses on the cryptanalysis of the ASCON family using automatic tools. We analyze two different problems with the goal to obtain new modelings, both simpler and less computationally heavy than previous works (all our models require only a small amount of code and run on regular desktop computers). The first problem is the search for Meet-in-the-middle attacks on reduced-round ASCON–XOF. Starting from the MILP modeling of Qin et al. (Meet-in-the-middle preimage attacks on sponge-based hashing. In: EUROCRYPT (4). Lecture notes in computer science, vol 14007. Springer, pp. 158–188, 2023. https://doi.org/10.1007/978-3-031-30634-1_6), we rephrase the problem in SAT, which accelerates significantly the solving time and removes the need for the “weak diffusion structure” heuristic. This allows us to reduce the memory complexity of Qin et al.’s attacks and to prove some optimality results. The second problem is the search for lower bounds on the probability of differential characteristics for the ASCON permutation. We introduce a lossy MILP encoding of the propagation rules based on the Hamming weight, in order to find quickly lower bounds which are comparable to the state of the art. We find a small improvement over the existing bound on 7 rounds.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"47 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143371604","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

New results on non-disjoint and classical strong external difference families 非不相交和经典强外差族的新结果

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-05 DOI: 10.1007/s10623-025-01566-3

Sophie Huczynska, Sophie Hume

引用次数: 0

A new automatic framework for searching rotational-XOR differential characteristics in ARX ciphers 一种新的自动搜索ARX密码中旋转异或差分特征的框架

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-05 DOI: 10.1007/s10623-025-01571-6

Yuhan Zhang, Lei Zhang, Yafei Zheng, Wenling Wu

{"title":"A new automatic framework for searching rotational-XOR differential characteristics in ARX ciphers","authors":"Yuhan Zhang, Lei Zhang, Yafei Zheng, Wenling Wu","doi":"10.1007/s10623-025-01571-6","DOIUrl":"https://doi.org/10.1007/s10623-025-01571-6","url":null,"abstract":"In this paper, a security evaluation framework for ARX ciphers, using modular addition as non-linear component, against rotational-XOR differential cryptanalysis is proposed. We first model all the possible propagations for rotational-XOR difference and rotational-XOR differential probability by some conjunctive normal form clauses. Then, acceleration techniques of automatic search are presented to derive better results and improve the efficiency. Our framework is successfully applied to SPECK, and we have identified rotational-XOR differential characteristics that cover more rounds than those previously reported. In particular, we present 17-round, 17-round and 24-round rotational-XOR differential characteristics for SPECK64/128, SPECK96/144 and SPECK128/256, whereas the previously longest characteristics cover 13, 13 and 13 rounds, respectively. For CHAM64/128, a 16-round characteristic with higher probability is proposed, while 17-round and 18-round rotational-XOR differential characteristics are provided for the first time. Furthermore, we apply rotational-XOR cryptanalysis on SPARX and Ballet for the first time, obtaining a 15-round rotational-XOR characteristic for SPARX64/128 and a 9-round characteristic for Ballet128/256.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"2672 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143125241","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

Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences 具有相同补序列和逆序列的奇阶de Bruijn序列的高效生成

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-01 DOI: 10.1007/s10623-025-01580-5

Zuling Chang, Qiang Wang

引用次数: 0

The revised boomerang connectivity tables and their connection to the difference distribution table 修改后的回飞镖连接表及其与差分布表的连接

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-01 DOI: 10.1007/s10623-025-01582-3

Kirpa Garg, Sartaj Ul Hasan, Constanza Riera, Pantelimon Stănică

引用次数: 0

Improved Side Channel Attacks on TRIVIUM, GRAIN-128-AEAD, ACORN-128 v3 and ASCON-128a 改进的TRIVIUM、GRAIN-128-AEAD、ACORN-128 v3和ASCON-128a侧信道攻击

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-01 DOI: 10.1007/s10623-025-01579-y

Soumya Sahoo, Raghavendra Patil, Sandip Kumar Mondal, Santanu Sarkar, Chester Rebeiro

引用次数: 0