This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Lecture  VIII Eastern Mediterranean University School of Computing and Technology ITEC 443 Cryptography and Network Security PSEUDO RANDOM SEQUENCES • Are the digital equivalent of white noise in the binary case. The simplest type is generated by a linear feedback shift register (LFSR). Dr. E. Iscioglu Cryptography and Network Security 2 1 O/P 2 3 C 1 Exclusive  OR C 2 C m C m1 C m Clock PSEUDO RANDOM SEQUENCES • Coefficients: C i :0, where 1<= i <= m1, and C =C m =1 always, • The sequence o/p has max period n, with mstage SR. If n = 2 m – 1 • Such a sequence is called an m sequence or maximal length sequence. Dr. E. Iscioglu Cryptography and Network Security 3 PSEUDO RANDOM SEQUENCES... • A maximum length sequence ( MLS ) is a type of pseudorandom binary sequence . • They are polynomial rings generated using maximal linear feedback shift registers and are so called because they are periodic and reproduce every binary sequence that can be reproduced by the shift registers (i.e., for length m registers they produce a sequence of length...
View
Full
Document
This note was uploaded on 08/01/2011 for the course ITEC 443 taught by Professor Wqe during the Spring '11 term at Eastern Mediterranean University.
 Spring '11
 wqe

Click to edit the document details