Khoongming Khoo, Guat-Ee Tan, Hian-Kiat Lee, G. Gong
{"title":"Comparison of boolean function design","authors":"Khoongming Khoo, Guat-Ee Tan, Hian-Kiat Lee, G. Gong","doi":"10.1109/ISIT.2005.1523512","DOIUrl":null,"url":null,"abstract":"In this paper the impact of the more recent stream cipher attacks like time-memory-data trade-off attacks and algebraic attacks on filter function keystream generators are studied. The attacks succeed when the filter function is based on concatenation of linear functions. As an alternative, some known constructions based on finite fields which are not susceptible to these attacks are presented. Two new finite field constructions were also introduced, one based on the GMW construction and the other based on an efficient exhaustive search","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523512","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In this paper the impact of the more recent stream cipher attacks like time-memory-data trade-off attacks and algebraic attacks on filter function keystream generators are studied. The attacks succeed when the filter function is based on concatenation of linear functions. As an alternative, some known constructions based on finite fields which are not susceptible to these attacks are presented. Two new finite field constructions were also introduced, one based on the GMW construction and the other based on an efficient exhaustive search