{"title":"用于密码学应用的单个WFCSR自动机生成多个r -序列","authors":"Ganesh Akula, Vinod Naik, B. Umadevi","doi":"10.1109/NGCT.2016.7877531","DOIUrl":null,"url":null,"abstract":"Feedback with carry shift registers (FCSRs) have been proposed as a promising alternate to the Linear feedback shift registers (LFSRs) in recent years. An approach based on traditional matrix representation has been proposed to design a Word oriented FCSR (WFCSR) automaton in [2], [3]. This automaton always generates a fixed ℓ-sequence, which is not desired for some cryptographic applications. In this paper, we present a new WFCSR automaton which enhances the traditional matrix representation by incorporating α-mask and/or β-mask operations on certain blocks (or words) of WFCSR automaton. By applying different α-mask and/or β-mask on certain blocks (or words) of WFCSR automaton, we can generate multiple ℓ-sequences without changing its structure. We can use the proposed approach to design WFCSR automaton in Fibonacci, Galois and Ring representations. The proposed WFCSR automaton can be adopted as a basic primitive to design any pseudo random number generator or stream cipher for cryptographic applications.","PeriodicalId":326018,"journal":{"name":"2016 2nd International Conference on Next Generation Computing Technologies (NGCT)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the generation of multiple ℓ-sequences from single WFCSR automaton for cryptographic applications\",\"authors\":\"Ganesh Akula, Vinod Naik, B. Umadevi\",\"doi\":\"10.1109/NGCT.2016.7877531\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Feedback with carry shift registers (FCSRs) have been proposed as a promising alternate to the Linear feedback shift registers (LFSRs) in recent years. An approach based on traditional matrix representation has been proposed to design a Word oriented FCSR (WFCSR) automaton in [2], [3]. This automaton always generates a fixed ℓ-sequence, which is not desired for some cryptographic applications. In this paper, we present a new WFCSR automaton which enhances the traditional matrix representation by incorporating α-mask and/or β-mask operations on certain blocks (or words) of WFCSR automaton. By applying different α-mask and/or β-mask on certain blocks (or words) of WFCSR automaton, we can generate multiple ℓ-sequences without changing its structure. We can use the proposed approach to design WFCSR automaton in Fibonacci, Galois and Ring representations. The proposed WFCSR automaton can be adopted as a basic primitive to design any pseudo random number generator or stream cipher for cryptographic applications.\",\"PeriodicalId\":326018,\"journal\":{\"name\":\"2016 2nd International Conference on Next Generation Computing Technologies (NGCT)\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 2nd International Conference on Next Generation Computing Technologies (NGCT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NGCT.2016.7877531\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd International Conference on Next Generation Computing Technologies (NGCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGCT.2016.7877531","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the generation of multiple ℓ-sequences from single WFCSR automaton for cryptographic applications
Feedback with carry shift registers (FCSRs) have been proposed as a promising alternate to the Linear feedback shift registers (LFSRs) in recent years. An approach based on traditional matrix representation has been proposed to design a Word oriented FCSR (WFCSR) automaton in [2], [3]. This automaton always generates a fixed ℓ-sequence, which is not desired for some cryptographic applications. In this paper, we present a new WFCSR automaton which enhances the traditional matrix representation by incorporating α-mask and/or β-mask operations on certain blocks (or words) of WFCSR automaton. By applying different α-mask and/or β-mask on certain blocks (or words) of WFCSR automaton, we can generate multiple ℓ-sequences without changing its structure. We can use the proposed approach to design WFCSR automaton in Fibonacci, Galois and Ring representations. The proposed WFCSR automaton can be adopted as a basic primitive to design any pseudo random number generator or stream cipher for cryptographic applications.