{"title":"具有最大代数免疫的平衡布尔函数的构造","authors":"Yindong Chen, Wei Tian, Ya-nan Zhang","doi":"10.1109/ASEA.2014.12","DOIUrl":null,"url":null,"abstract":"Algebraic immunity is a new cryptographic criterion. In order to resist algebraic attacks, Boolean functions used in cryptosystem should have high algebraic immunity. This paper presents a new recursive construction of Boolean function with maximum algebraic immunity. The constructed Boolean functions are pointed out to be balanced.","PeriodicalId":320279,"journal":{"name":"2014 7th International Conference on Advanced Software Engineering and Its Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Construction for Balanced Boolean Function with Maximum Algebraic Immunity\",\"authors\":\"Yindong Chen, Wei Tian, Ya-nan Zhang\",\"doi\":\"10.1109/ASEA.2014.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Algebraic immunity is a new cryptographic criterion. In order to resist algebraic attacks, Boolean functions used in cryptosystem should have high algebraic immunity. This paper presents a new recursive construction of Boolean function with maximum algebraic immunity. The constructed Boolean functions are pointed out to be balanced.\",\"PeriodicalId\":320279,\"journal\":{\"name\":\"2014 7th International Conference on Advanced Software Engineering and Its Applications\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 7th International Conference on Advanced Software Engineering and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASEA.2014.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 7th International Conference on Advanced Software Engineering and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASEA.2014.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Construction for Balanced Boolean Function with Maximum Algebraic Immunity
Algebraic immunity is a new cryptographic criterion. In order to resist algebraic attacks, Boolean functions used in cryptosystem should have high algebraic immunity. This paper presents a new recursive construction of Boolean function with maximum algebraic immunity. The constructed Boolean functions are pointed out to be balanced.