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

Meet-in-the-middle attacks on AES with value constraints 带值限制的 AES 中间人攻击

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-04-18 DOI: 10.1007/s10623-024-01396-9

Xiaoli Dong, Jun Liu, Yongzhuang Wei, Wen Gao, Jie Chen

引用次数: 0

Fast decoding of lifted interleaved linearized Reed–Solomon codes for multishot network coding 用于多点网络编码的提升交错线性化里德-所罗门码的快速解码

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-04-16 DOI: 10.1007/s10623-024-01393-y

Hannes Bartz, Sven Puchinger

{"title":"Fast decoding of lifted interleaved linearized Reed–Solomon codes for multishot network coding","authors":"Hannes Bartz, Sven Puchinger","doi":"10.1007/s10623-024-01393-y","DOIUrl":"https://doi.org/10.1007/s10623-024-01393-y","url":null,"abstract":"Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory 65(8):4785–4803, 2019) proposed lifted linearized Reed–Solomon codes as suitable codes for error control in multishot network coding. We show how to construct and decode lifted interleaved linearized Reed–Solomon (LILRS) codes. Compared to the construction by Martínez-Peñas–Kschischang, interleaving allows to increase the decoding region significantly and decreases the overhead due to the lifting (i.e., increases the code rate), at the cost of an increased packet size. We propose two decoding schemes for LILRS that are both capable of correcting insertions and deletions beyond half the minimum distance of the code by either allowing a list or a small decoding failure probability. We propose a probabilistic unique Loidreau–Overbeck-like decoder for LILRS codes and an efficient interpolation-based decoding scheme that can be either used as a list decoder (with exponential worst-case list size) or as a probabilistic unique decoder. We derive upper bounds on the decoding failure probability of the probabilistic-unique decoders which show that the decoding failure probability is very small for most channel realizations up to the maximal decoding radius. The tightness of the bounds is verified by Monte Carlo simulations.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140557132","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

Constructing linked systems of relative difference sets via Schur rings 通过舒尔环构建相对差集的关联系统

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-04-16 DOI: 10.1007/s10623-024-01406-w

Mikhail Muzychuk, Grigory Ryabov

引用次数: 0

Symmetric 2-adic complexity of Tang–Gong interleaved sequences from generalized GMW sequence pair 来自广义 GMW 序列对的唐-龚交错序列的对称 2-adic 复杂性

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-04-16 DOI: 10.1007/s10623-024-01399-6

Bo Yang, Kangkang He, Xiangyong Zeng, Zibi Xiao

引用次数: 0

Lengths of divisible codes: the missing cases 可分割代码的长度：缺失的情况

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-04-13 DOI: 10.1007/s10623-024-01398-7

Sascha Kurz

引用次数: 0

New constructions of signed difference sets 有符号差集的新构造

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-04-10 DOI: 10.1007/s10623-024-01389-8

Zhiwen He, Tingting Chen, Gennian Ge

引用次数: 0

Algebraic properties of the maps $$chi _n$$ $$chi _n$$ 映射的代数特性

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-04-10 DOI: 10.1007/s10623-024-01395-w

Jan Schoone, Joan Daemen

{"title":"Algebraic properties of the maps $$chi _n$$","authors":"Jan Schoone, Joan Daemen","doi":"10.1007/s10623-024-01395-w","DOIUrl":"https://doi.org/10.1007/s10623-024-01395-w","url":null,"abstract":"The Boolean map (chi _n :mathbb {F}_2^n rightarrow mathbb {F}_2^n, x mapsto y) defined by (y_i = x_i + (x_{i+1}+1)x_{i+2}) (where (iin mathbb {Z}/nmathbb {Z})) is used in various permutations that are part of cryptographic schemes, e.g., Keccak-f (the SHA-3-permutation), ASCON (the winner of the NIST Lightweight competition), Xoodoo, Rasta and Subterranean (2.0). In this paper, we study various algebraic properties of this map. We consider (chi _n) (through vectorial isomorphism) as a univariate polynomial. We show that it is a power function if and only if (n=1,3). We furthermore compute bounds on the sparsity and degree of these univariate polynomials, and the number of different univariate representations. Secondly, we compute the number of monomials of given degree in the inverse of (chi _n) (if it exists). This number coincides with binomial coefficients. Lastly, we consider (chi _n) as a polynomial map, to study whether the same rule ((y_i = x_i + (x_{i+1}+1)x_{i+2})) gives a bijection on field extensions of (mathbb {F}_2). We show that this is not the case for extensions whose degree is divisible by two or three. Based on these results, we conjecture that this rule does not give a bijection on any extension field of (mathbb {F}_2).","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140541719","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

Jacobi polynomials for the first-order generalized Reed–Muller codes 一阶广义里德-穆勒码的雅可比多项式

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-04-08 DOI: 10.1007/s10623-024-01392-z

Ryosuke Yamaguchi

引用次数: 0

Anonymous attribute-based broadcast encryption with hidden multiple access structures 基于匿名属性的广播加密与隐藏式多重访问结构

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-04-06 DOI: 10.1007/s10623-024-01373-2

Tran Viet Xuan Phuong

{"title":"Anonymous attribute-based broadcast encryption with hidden multiple access structures","authors":"Tran Viet Xuan Phuong","doi":"10.1007/s10623-024-01373-2","DOIUrl":"https://doi.org/10.1007/s10623-024-01373-2","url":null,"abstract":"Due to the high demands of data communication, the broadcasting system streams the data daily. This service not only sends out the message to the correct participant but also respects the security of the identity user. In addition, when delivered, all the information must be protected for the party who employs the broadcasting service. Currently, Attribute-Based Broadcast Encryption (ABBE) is useful to apply for the broadcasting service. (ABBE) is a combination of Attribute-Based Encryption (ABE) and Broadcast Encryption (BE), which allows a broadcaster (or encrypter) to broadcast an encrypted message, including a predefined user set and specified access policy to install the authorization mechanism. It is desirable to hide all the information when producing in the ciphertext, which has not been considered in the previous works of ABBE. Motivated by the above issue, we devise a solution to achieve anonymity for the ABBE scheme, which not only hides the access structures but also anonymizes the user’s identity. In this work, we propose two schemes as Anonymous Key Policy (AKP)-ABBE and Anonymous Ciphertext Policy (ACP)-ABBE with supporting multiple access structures by using (textsf {OR}/textsf {AND}) gates. Specifically, we present the generic constructions of AKP/ACP-ABBE on the building block of the Inner Product Encryption ((textsf {IPE})), which enables the hidden user’s identity and complex (textsf {OR}/textsf {AND})-Gate access structure. We show that our proposed schemes are secured under the standard models.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140533966","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

Ovoids of Q(6, q) of low degree 低度 Q（6，q）的卵形体

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2024-04-06 DOI: 10.1007/s10623-024-01388-9

Daniele Bartoli, Nicola Durante, Giovanni Giuseppe Grimaldi

引用次数: 0