On the generation and analysis of pseudorandom sequences over arbitrary finite fields

Abstract

A sequence generated by a deterministic algorithm is called a pseudorandom sequence if it satisfies statistical properties similar to a truly random sequence Such sequences arise in many applications starting from key generation in cryptography to spread spectrum communication and so on This thesis deals with the topics related to the generation and analysis of pseudorandom sequences Many pseudorandom sequence generators are based on Linear Feedback Shift Registers LFSRs LFSR is a shif...