1.one question about the LFSR

View previous topic View next topic Go down

1.one question about the LFSR

Post  BrightRedJacket on Mon Nov 15, 2010 1:58 am

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?

BrightRedJacket

Posts : 1
Join date : 2010-11-02

View user profile

Back to top Go down

Easy to compute

Post  kknd on Mon Nov 15, 2010 5:36 am

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

View user profile

Back to top Go down

View previous topic View next topic Back to top

- Similar topics

 
Permissions in this forum:
You cannot reply to topics in this forum