发布求助
文献互助 智能选刊 最新文献

Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences最新文献

筛选
英文 中文
D-property for APN functions from F 2 n F2n中APN函数的D性质
IF 1.4 3区 计算机科学
Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences Pub Date : 2023-02-14 DOI: 10.1007/s12095-023-00627-5
Hiroaki Taniguchi
{"title":"D-property for APN functions from \u0000 \u0000 \u0000 \u0000 \u0000 \u0000 \u0000 F\u0000 \u0000 \u0000 2\u0000 \u0000 \u0000 n\u0000 \u0000 ","authors":"Hiroaki Taniguchi","doi":"10.1007/s12095-023-00627-5","DOIUrl":"https://doi.org/10.1007/s12095-023-00627-5","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":"15 1","pages":"627-647"},"PeriodicalIF":1.4,"publicationDate":"2023-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45103915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An algebraic approach to symmetric linear layers in cryptographic primitives 密码学原语中对称线性层的代数方法
IF 1.4 3区 计算机科学
Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences Pub Date : 2023-02-14 DOI: 10.1007/s12095-023-00630-w
Robert Christian Subroto
{"title":"An algebraic approach to symmetric linear layers in cryptographic primitives","authors":"Robert Christian Subroto","doi":"10.1007/s12095-023-00630-w","DOIUrl":"https://doi.org/10.1007/s12095-023-00630-w","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49218192","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Two classes of quasi-cyclic codes via irreducible polynomials 两类不可约多项式拟循环码
IF 1.4 3区 计算机科学
Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences Pub Date : 2023-02-14 DOI: 10.1007/s12095-023-00629-3
Daitao Huang, Qin Yue, Fengwei Li
{"title":"Two classes of quasi-cyclic codes via irreducible polynomials","authors":"Daitao Huang, Qin Yue, Fengwei Li","doi":"10.1007/s12095-023-00629-3","DOIUrl":"https://doi.org/10.1007/s12095-023-00629-3","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":"15 1","pages":"649-659"},"PeriodicalIF":1.4,"publicationDate":"2023-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45535621","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On locality of binary distance-optimal codes 关于二进制距离最优码的局部性
IF 1.4 3区 计算机科学
Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences Pub Date : 2023-02-09 DOI: 10.1007/s12095-023-00626-6
Ruipan Yang, Ruihu Li, Qiang Fu, Sen Yang, Yi Rao
{"title":"On locality of binary distance-optimal codes","authors":"Ruipan Yang, Ruihu Li, Qiang Fu, Sen Yang, Yi Rao","doi":"10.1007/s12095-023-00626-6","DOIUrl":"https://doi.org/10.1007/s12095-023-00626-6","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47779524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Modifications of bijective S-Boxes with linear structures 具有线性结构的双射S-盒的改进
IF 1.4 3区 计算机科学
Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences Pub Date : 2023-02-08 DOI: 10.1007/s12095-023-00631-9
K. Nyberg
{"title":"Modifications of bijective S-Boxes with linear structures","authors":"K. Nyberg","doi":"10.1007/s12095-023-00631-9","DOIUrl":"https://doi.org/10.1007/s12095-023-00631-9","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":"15 1","pages":"617-625"},"PeriodicalIF":1.4,"publicationDate":"2023-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49581516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
MDS constacyclic codes of length q + 1 over GF(q) 长度为q的MDS恒循环码+ GF（q）上的1
IF 1.4 3区 计算机科学
Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences Pub Date : 2023-01-13 DOI: 10.1007/s12095-022-00624-0
Xiaoqiang Wang, C. Ding, Hongwei Liu, Dabin Zheng
{"title":"MDS constacyclic codes of length q + 1 over GF(q)","authors":"Xiaoqiang Wang, C. Ding, Hongwei Liu, Dabin Zheng","doi":"10.1007/s12095-022-00624-0","DOIUrl":"https://doi.org/10.1007/s12095-022-00624-0","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":"1 1","pages":"1-28"},"PeriodicalIF":1.4,"publicationDate":"2023-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48173568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Construction of Optimal Binary Z-Complementary Code Sets with New Lengths Using Generalized Boolean Function 用广义布尔函数构造新长度的最优二进制Z-互补码集
IF 1.4 3区 计算机科学
Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences Pub Date : 2023-01-09 DOI: 10.1007/s12095-023-00658-y
Gobinda Ghosh, S. Majhi, Subhabrata Paul
{"title":"Construction of Optimal Binary Z-Complementary Code Sets with New Lengths Using Generalized Boolean Function","authors":"Gobinda Ghosh, S. Majhi, Subhabrata Paul","doi":"10.1007/s12095-023-00658-y","DOIUrl":"https://doi.org/10.1007/s12095-023-00658-y","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":"15 1","pages":"979 - 993"},"PeriodicalIF":1.4,"publicationDate":"2023-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46895085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On the classification of ideals over R[X]/〈f(X)ps〉 when R=𝔽p^{m}+u𝔽p^{m}+ldots +u^{n}𝔽p^{m} 在理想的分类/ R [X] / ps > < f (X)当R =𝔽p ^ {m} + u𝔽p ^ {m} + ldots + u ^ {n}𝔽p ^ {m}
IF 1.4 3区 计算机科学
Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences Pub Date : 2023-01-01 DOI: 10.1007/s12095-022-00620-4
B. Boudine, Jamal Laaouine, M. Charkani
{"title":"On the classification of ideals over R[X]/〈f(X)ps〉 when R=𝔽p^{m}+u𝔽p^{m}+ldots +u^{n}𝔽p^{m}","authors":"B. Boudine, Jamal Laaouine, M. Charkani","doi":"10.1007/s12095-022-00620-4","DOIUrl":"https://doi.org/10.1007/s12095-022-00620-4","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":"2 1","pages":"589-598"},"PeriodicalIF":1.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73173661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Octanary linear codes using simplicial complexes 使用简单复合体的八元线性码
IF 1.4 3区 计算机科学
Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences Pub Date : 2022-12-22 DOI: 10.1007/s12095-022-00617-z
V. Sagar, R. Sarma
{"title":"Octanary linear codes using simplicial complexes","authors":"V. Sagar, R. Sarma","doi":"10.1007/s12095-022-00617-z","DOIUrl":"https://doi.org/10.1007/s12095-022-00617-z","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":"15 1","pages":"599-616"},"PeriodicalIF":1.4,"publicationDate":"2022-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47144287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
New upper bounds and constructions of multi-erasure locally recoverable codes 多重擦除局部可恢复码的新上界和构造
IF 1.4 3区 计算机科学
Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences Pub Date : 2022-12-02 DOI: 10.1007/s12095-022-00618-y
Fagang Li, Haoyuan Chen, Hui-lin Lao, Shanxiang Lyu
{"title":"New upper bounds and constructions of multi-erasure locally recoverable codes","authors":"Fagang Li, Haoyuan Chen, Hui-lin Lao, Shanxiang Lyu","doi":"10.1007/s12095-022-00618-y","DOIUrl":"https://doi.org/10.1007/s12095-022-00618-y","url":null,"abstract":"","PeriodicalId":48936,"journal":{"name":"Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences","volume":"15 1","pages":"513-528"},"PeriodicalIF":1.4,"publicationDate":"2022-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"53220154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信