二元多序列的联合2进复杂度

RAIRO Theor. Informatics Appl. Pub Date : 2012-07-01 DOI:10.1051/ita/2012011

Lu Zhao, Qiao-yan Wen

{"title":"二元多序列的联合2进复杂度","authors":"Lu Zhao, Qiao-yan Wen","doi":"10.1051/ita/2012011","DOIUrl":null,"url":null,"abstract":"Joint 2-adic complexity is a new important index of the cryptographic security for\n multisequences. In this paper, we extend the usual Fourier transform to the case of\n multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for\n the multisequences with p n -period, we discuss\n the relation between sequences and their Fourier coefficients. Based on the relation, we\n determine a lower bound for the number of multisequences with given joint 2-adic\n complexity.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On the joint 2-adic complexity of binary multisequences\",\"authors\":\"Lu Zhao, Qiao-yan Wen\",\"doi\":\"10.1051/ita/2012011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Joint 2-adic complexity is a new important index of the cryptographic security for\\n multisequences. In this paper, we extend the usual Fourier transform to the case of\\n multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for\\n the multisequences with p n -period, we discuss\\n the relation between sequences and their Fourier coefficients. Based on the relation, we\\n determine a lower bound for the number of multisequences with given joint 2-adic\\n complexity.\",\"PeriodicalId\":438841,\"journal\":{\"name\":\"RAIRO Theor. Informatics Appl.\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RAIRO Theor. Informatics Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ita/2012011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO Theor. Informatics Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ita/2012011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

联合二进复杂度是衡量多序列密码安全性的一个新的重要指标。本文将通常的傅里叶变换推广到多序列的情况，并给出了联合2进复杂度的上界。此外，对于n周期的多序列，我们讨论了序列与其傅里叶系数的关系。基于这一关系，我们确定了具有给定联合2进复杂度的多序列数目的下界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the joint 2-adic complexity of binary multisequences

Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with p n -period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences with given joint 2-adic complexity.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

RAIRO Theor. Informatics Appl.

自引率

0.00%

发文量