Cryptography and Communications最新文献_第3页

$$mathcal {S}_0$$ -equivalence classes, a new direction to find better weightwise perfectly balanced functions, and more $$mathcal {S}_0$$ -等价类，寻找更好的加权完全平衡函数的新方向，以及更多内容

Cryptography and Communications Pub Date : 2024-05-14 DOI: 10.1007/s12095-024-00719-w

Agnese Gini, Pierrick Méaux

引用次数: 0

Construction of DNA codes with multiple constrained properties 构建具有多重约束特性的 DNA 代码

Cryptography and Communications Pub Date : 2024-05-14 DOI: 10.1007/s12095-024-00718-x

Siddhartha Siddhiprada Bhoi, Udaya Parampalli, Abhay Kumar Singh

{"title":"Construction of DNA codes with multiple constrained properties","authors":"Siddhartha Siddhiprada Bhoi, Udaya Parampalli, Abhay Kumar Singh","doi":"10.1007/s12095-024-00718-x","DOIUrl":"https://doi.org/10.1007/s12095-024-00718-x","url":null,"abstract":"DNA sequences are prone to creating secondary structures by folding back on themselves by non-specific hybridization of its nucleotides. The formation of large stem-length secondary structures makes the sequences chemically inactive towards synthesis and sequencing processes. Furthermore, in DNA computing, other constraints like homopolymer run length also introduce complications. In this paper, our goal is to tackle the problems due to the creation of secondary structures in DNA sequences along with constraints such as not having a large homopolymer run length. This paper presents families of DNA codes with secondary structures of stem length at most two and homopolymer run length at most four. We identified (mathbb {Z}_{11}) as an ideal structure to construct DNA codes to avoid the above problems. By mapping the error-correcting codes over (mathbb {Z}_{11}) to DNA nucleotides, we obtained DNA codes with rates 0.5765 times the corresponding code rate over (mathbb {Z}_{11}), including some new secondary structure-free and better-performing codes for DNA-based data storage and DNA computing purposes.","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"304 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140939374","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

Integer syndrome decoding in the presence of noise 存在噪声时的整数综合征解码

Cryptography and Communications Pub Date : 2024-05-10 DOI: 10.1007/s12095-024-00712-3

Vlad-Florin Drăgoi, Brice Colombier, Pierre-Louis Cayrel, Vincent Grosso

{"title":"Integer syndrome decoding in the presence of noise","authors":"Vlad-Florin Drăgoi, Brice Colombier, Pierre-Louis Cayrel, Vincent Grosso","doi":"10.1007/s12095-024-00712-3","DOIUrl":"https://doi.org/10.1007/s12095-024-00712-3","url":null,"abstract":"Code-based cryptography received attention after the NIST started the post-quantum cryptography standardization process in 2016. A central NP-hard problem is the binary syndrome decoding problem, on which the security of many code-based cryptosystems lies. The best known methods to solve this problem all stem from the information-set decoding strategy, first introduced by Prange in 1962. A recent line of work considers augmented versions of this strategy, with hints typically provided by side-channel information. In this work, we consider the integer syndrome decoding problem, where the integer syndrome is available but might be noisy. We study how the performance of the decoder is affected by the noise. First we identify the noise model as being close to a centered in zero binomial distribution. Second we model the probability of success of the ISD-score decoder in presence of a binomial noise. Third, we demonstrate that with high probability our algorithm finds the solution as long as the noise parameter d is linear in t (the Hamming weight of the solution) and t is sub-linear in the code-length. We provide experimental results on cryptographic parameters for the BIKE and Classic McEliece cryptosystems, which are both candidates for the fourth round of the NIST standardization process.","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"191 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140939135","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

Additive codes with few weights 权重少的加法代码

Cryptography and Communications Pub Date : 2024-05-09 DOI: 10.1007/s12095-024-00720-3

Daniel Panario, Murat Sahin, Qiang Wang

引用次数: 0

Construction of spectrally-null-constrained zero-correlation zone sequences with flexible support 构建具有灵活支持的谱空约束零相关区序列

Cryptography and Communications Pub Date : 2024-05-02 DOI: 10.1007/s12095-024-00715-0

Nishant Kumar, Palash Sarkar, Sudhan Majhi

{"title":"Construction of spectrally-null-constrained zero-correlation zone sequences with flexible support","authors":"Nishant Kumar, Palash Sarkar, Sudhan Majhi","doi":"10.1007/s12095-024-00715-0","DOIUrl":"https://doi.org/10.1007/s12095-024-00715-0","url":null,"abstract":"In recent years, zero-correlation zone (ZCZ) sequences have been studied due to their significant applications in quasi-synchronous code division multiple access (QS-CDMA) systems and other wireless communication domains. However, in a cognitive radio (CR) network, it is desirable to design ZCZ sequences having spectrally-null-constrained (SNC) property to achieve a low spectral density profile. This paper focuses on the construction of SNC-ZCZ sequences having flexible support, where support refers to a collection of indices corresponding to non-zero entries in the sequence. The proposed SNC-ZCZ sequences are reduced to traditional ZCZ sequences when the support size is equal to the length of the sequence. To obtain ZCZ sequences, we first propose a construction of traditional/SNC-complete complementary codes (SNC-CCCs) using a class of extended Boolean functions (EBFs). With the help of this class, we propose another class of EBFs that generates asymptotically optimal traditional/SNC-ZCZ sequences of prime-power lengths with respect to Tang-Fan-Matsufuzi bound. Furthermore, a relation between the second-order cosets of first-order generalized Reed-Muller (GRM) code and the proposed traditional ZCZ sequences is also established. The enumeration of traditional ZCZ sequences within a GRM code is also established. This enumeration is achieved by tallying the distinct second-order cosets of the first-order GRM code and quantifying the number of ZCZ sequences residing within a particular coset. Moreover, the Hamming distance of the proposed traditional ZCZ sequences is also computed.","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"31 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140840192","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 sequence reconstruction problem for permutations with the Hamming distance 具有汉明距离的排列序列重构问题

Cryptography and Communications Pub Date : 2024-05-02 DOI: 10.1007/s12095-024-00717-y

Xiang Wang, Elena V. Konstantinova

引用次数: 0

ACD codes over skew-symmetric dualities 倾斜对称对偶上的 ACD 编码

Cryptography and Communications Pub Date : 2024-04-29 DOI: 10.1007/s12095-024-00709-y

Astha Agrawal, R. K. Sharma

引用次数: 0

Propagation properties of a non-linear mapping based on squaring in odd characteristic 基于奇数特征平方的非线性映射的传播特性

Cryptography and Communications Pub Date : 2024-04-26 DOI: 10.1007/s12095-024-00711-4

Joan Daemen, Daniël Kuijsters, Silvia Mella, Denise Verbakel

{"title":"Propagation properties of a non-linear mapping based on squaring in odd characteristic","authors":"Joan Daemen, Daniël Kuijsters, Silvia Mella, Denise Verbakel","doi":"10.1007/s12095-024-00711-4","DOIUrl":"https://doi.org/10.1007/s12095-024-00711-4","url":null,"abstract":"Many modern cryptographic primitives for hashing and (authenticated) encryption make use of constructions that are instantiated with an iterated cryptographic permutation that operates on a fixed-width state consisting of an array of bits. Often, such permutations are the repeated application of a relatively simple round function consisting of a linear layer and a non-linear layer. These constructions do not require that the underlying function is a permutation and they can plausibly be based on a non-invertible transformation. Recently, Grassi proposed the use of non-invertible mappings operating on arrays of digits that are elements of a finite field of odd characteristic for so-called MPC-/FHE-/ZK-friendly symmetric cryptographic primitives. In this work, we consider a mapping that we call (gamma ) that has a simple expression and is based on squaring. We discuss, for the first time, the differential and linear propagation properties of (gamma ) and observe that these follow the same rules up to a relabeling of the digits. This is an intriguing property that, as far as we know, only exists for (gamma ) and the binary mapping (chi _{_{3}}) that is used in the cryptographic permutation Xoodoo. Moreover, we study the implications of its non-invertibility on differentials with zero output difference and on biases at the output of the (gamma ) mapping and show that they are as small as they can possibly be.","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"51 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140799498","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

Equitable [[2, 10], [6, 6]]-partitions of the 12-cube 12 立方体的等分 [[2，10]，[6，6]]分区

Cryptography and Communications Pub Date : 2024-04-26 DOI: 10.1007/s12095-024-00716-z

Denis S. Krotov

引用次数: 0

Integer codes correcting burst errors within one byte and single errors within two bytes 整数码纠正一个字节内的突发错误和两个字节内的单个错误

Cryptography and Communications Pub Date : 2024-04-19 DOI: 10.1007/s12095-023-00687-7

Aleksandar Radonjic, Pankaj Kumar Das, Vladimir Vujicic

引用次数: 0