Ariel Molina-Rueda, Fernando Uceda-Ponga, C. F. Uribe
{"title":"使用可变TAP功能的延长周期LFSR","authors":"Ariel Molina-Rueda, Fernando Uceda-Ponga, C. F. Uribe","doi":"10.1109/CONIELECOMP.2008.8","DOIUrl":null,"url":null,"abstract":"This paper presents a method to extend the period of a linear feedback shift register (LFSR) by proposing an algorithm to generate primitive polynomials, this is archived by using basic LFSR with a maximum period equal to a prime number. The period extension achieved with our proposed method is statistically robust and has a very long extension of the LFSR period, as long of (2120)!(2N - 1) for a 127 bit length register. Also by separating the phases of setup and running in the algorithm avoid losing the characteristically speed of the LFSRs.","PeriodicalId":202730,"journal":{"name":"18th International Conference on Electronics, Communications and Computers (conielecomp 2008)","volume":"168 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Extended Period LFSR Using Variable TAP Function\",\"authors\":\"Ariel Molina-Rueda, Fernando Uceda-Ponga, C. F. Uribe\",\"doi\":\"10.1109/CONIELECOMP.2008.8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a method to extend the period of a linear feedback shift register (LFSR) by proposing an algorithm to generate primitive polynomials, this is archived by using basic LFSR with a maximum period equal to a prime number. The period extension achieved with our proposed method is statistically robust and has a very long extension of the LFSR period, as long of (2120)!(2N - 1) for a 127 bit length register. Also by separating the phases of setup and running in the algorithm avoid losing the characteristically speed of the LFSRs.\",\"PeriodicalId\":202730,\"journal\":{\"name\":\"18th International Conference on Electronics, Communications and Computers (conielecomp 2008)\",\"volume\":\"168 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"18th International Conference on Electronics, Communications and Computers (conielecomp 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONIELECOMP.2008.8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th International Conference on Electronics, Communications and Computers (conielecomp 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONIELECOMP.2008.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper presents a method to extend the period of a linear feedback shift register (LFSR) by proposing an algorithm to generate primitive polynomials, this is archived by using basic LFSR with a maximum period equal to a prime number. The period extension achieved with our proposed method is statistically robust and has a very long extension of the LFSR period, as long of (2120)!(2N - 1) for a 127 bit length register. Also by separating the phases of setup and running in the algorithm avoid losing the characteristically speed of the LFSRs.