Abstract
Linear Feedback Shift Registers (LFSRs) are currently used as generators of pseudorandom sequences with multiple applications from communication systems to cryptography. In this work, design and software implementation of LFSRs defined over extended fields GF(2n) instead of over the binary field GF(2) are analysed. The key idea is combining algebraic structures (finite fields) with modern processor capabilities to take advantage of the underlying device over which the application is executed. The study has been carried out for diverse extended fields and different architectures. Detailed microanalysis and macroanalysis of the LFSR implementation are performed too. Numerical results prove that extended fields provide speedup factors up to 10.15. The benefits of these fields are clear for applications with LFSRs cryptographic applications, including
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
