1.one question about the LFSR
2 posters
Page 1 of 1
1.one question about the LFSR
1.In the LFSR, does the chosen prime field GF(2^311) 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 : 20101102
Easy to compute
I think mod 2^n1 is easy to compute. We need only add the length n periods of the number.
kknd Posts : 7
Join date : 20101108
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum

