# 1.one question about the LFSR

## 1.one question about the LFSR

1.In the LFSR, does the chosen prime field GF(2^31-1) has other good properties than GF(2^n) for certain n's except high linear complexity ?

2.The ZUC algorithm is more complicated than SNOW in form, does it has any practical efficiency?

2.The ZUC algorithm is more complicated than SNOW in form, does it has any practical efficiency?

**BrightRedJacket**- Posts : 1

Join date : 2010-11-02

## Easy to compute

I think mod 2^n-1 is easy to compute. We need only add the length n periods of the number.

**kknd**- Posts : 7

Join date : 2010-11-08

Similar topics

» Question on Lambda symbol for light

» Question re generational curses/ healing prayer

» Question your conduct

» A question for mediums

» CS Professional (New Syllabus) Question Papers

» Question re generational curses/ healing prayer

» Question your conduct

» A question for mediums

» CS Professional (New Syllabus) Question Papers

Page

**1**of**1****Permissions in this forum:**

**cannot**reply to topics in this forum