A note on determine the greatest common subfamily of two NFSRs by Gröbner basis
- 81 Downloads
For nonlinear feedback shift registers (NFSRs), their greatest common subfamily may be not unique. Given two NFSRs, the authors only consider the case that their greatest common subfamily exists and is unique. If the greatest common subfamily is exactly the set of all sequences which can be generated by both of them, the authors can determine it by Gröbner basis theory. Otherwise, the authors can determine it under some conditions and partly solve the problem.
KeywordsGreatest common subfamily Gröbner basis nonlinear feedback shift register stream cipher
Unable to display preview. Download preview PDF.
- Canteaut A and Trabbia M, Improved fast correlation attacks using parity-check equations of weight 4 and 5, Advances in Cryptology-EUROCRYPT 2000 (ed. by Preneel B), Bruges, 2000.Google Scholar
- Courtois N and Meier W, Algebraic attacks on stream ciphers with linear feedback, Advances in Cryptology-EUROCRYPT 2003 (ed. by Biham E), Warsaw, 2003.Google Scholar
- Courtois N, Fast algebraic attacks on stream ciphers with linear feedback, Advances in Cryptology-CRYPTO 2003 (ed. by Boneh D), California, 2003.Google Scholar
- Hell M, Johansson T, and Meier W, New Stream Cipher Designs: The Grain Family of Stream Ciphers, Springer-Verlag, Berlin, 2008.Google Scholar
- Babbage S and Dodd M, New Stream Cipher Designs: The MICKEY Stream Ciphers, Springer-Verlag, Berlin, 2008.Google Scholar
- Cannière C D and Preneel B, New Stream Cipher Designs: Trivium, Springer-Verlag Berlin, 2008.Google Scholar
- Jansen C J, Investigations on nonlinear streamcipher systems: Construction and evaluation methods, Doctor’s degree thesis, Technical University of Delft, Netherlands, 1989.Google Scholar
- Erdmann D and Murphy S, An approximate distribution for the maximum order complexity, Designs, Codes and Cryptography, 2005, 10(4): 1555–1563.Google Scholar
- Lidl R and Niederreiter H, Finite Fields, Cambridge University Press Oxford, 1997.Google Scholar
- Becker T and Weispfenning V, Gröbner Bases, a Computationnal Approach to Commutative Algebra, Springer-Verlag, Berlin, 1993.Google Scholar
- Golomb S W, Shift Register Sequences, Aegean Park Press California, 1982.Google Scholar