{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture8 - Technology ITEC443 LectureVIII PSEUDORANDOM...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture - VIII Eastern Mediterranean University School of Computing and  Technology ITEC 443 Cryptography and Network Security
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
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 0 m C m-1 C m Clock
Background image of page 2
PSEUDO RANDOM  SEQUENCES Coefficients: C i :0, where 1<= i <= m-1, and  C 0 =C m =1 always, The sequence o/p has max period n, with  m-stage 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
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
PSEUDO RANDOM  SEQUENCES... 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 
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}