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

Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique 强正则图可分解为可整除的设计图和Delsarte团

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2025-02-14 DOI: 10.1007/s10623-024-01563-y

Alexander L. Gavrilyuk, Vladislav V. Kabanov

引用次数: 0

Constructions of complete permutations in multiplication 乘法中完全排列的构造

IF 1.6 2区数学

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

Kangquan Li

引用次数: 0

Probabilistic results on the 2-adic complexity 二进复杂度的概率结果

IF 1.6 2区数学

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

Zhixiong Chen, Arne Winterhof

引用次数: 0

Secret and shared keys recovery on hamming quasi-cyclic with SASCA 基于SASCA的hamming拟环上的密钥和共享密钥恢复

IF 1.6 2区数学

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

Chloé Baïsse, Antoine Moran, Guillaume Goy, Julien Maillard, Nicolas Aragon, Philippe Gaborit, Maxime Lecomte, Antoine Loiseau

{"title":"Secret and shared keys recovery on hamming quasi-cyclic with SASCA","authors":"Chloé Baïsse, Antoine Moran, Guillaume Goy, Julien Maillard, Nicolas Aragon, Philippe Gaborit, Maxime Lecomte, Antoine Loiseau","doi":"10.1007/s10623-025-01575-2","DOIUrl":"https://doi.org/10.1007/s10623-025-01575-2","url":null,"abstract":"Soft Analytical Side Channel Attacks (SASCA) are a powerful family of Side Channel Attacks (SCA) that allows the recovery of secret values with only a small number of traces. Their effectiveness lies in the Belief Propagation (BP) algorithm, which enables efficient computation of the marginal distributions of intermediate values. Post-quantum schemes such as Kyber, and more recently, Hamming Quasi-Cyclic (HQC), have been targets of SASCA. Previous SASCA on HQC focused on Reed–Solomon (RS) codes and successfully retrieved the shared key with a high success rate for high noise levels using a single trace. In this work, we present new SASCA on HQC, where both the shared key and the secret key are targeted. Our attacks are realized on simulations. Unlike the previous SASCA, we take a closer look at the Reed–Muller (RM) code. The advantage of this choice is that the RM decoder is applied before the RS decoder, enabling attacks targeting both the secret key and shared key. We build a factor graph of the Fast Hadamard Transform (FHT) function from the HQC reference implementation of April 2023. The information recovered from BP allows us to retrieve the shared key with a single trace. In addition to the previous SASCA targeting HQC, we also manage to recover the secret key with two different chosen ciphertext attacks. One of them requires a single trace and is successful until high noise levels.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"18 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143393286","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 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