A note on determine the greatest common subfamily of two NFSRs by Gröbner basis

DOI10.1007/s11424-015-3072-xzbMath1329.13052OpenAlexW2273598340MaRDI QIDQ905163

Tian Tian, Wen-Feng Qi, Zhong-Xiao Wang

Publication date: 14 January 2016

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-015-3072-x

zbMATH Keywords

Gröbner basisstream ciphernonlinear feedback shift registergreatest common subfamily

Mathematics Subject Classification ID

Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (1)

New results on the state cycles of Trivium

Uses Software

• Trivium
• MICKEY
• Grain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characteristic set algorithms for equation solving in finite fields
• Fast correlation attacks on certain stream ciphers
• On the cycle structure of a set of nonlinear shift registers with symmetric feedback functions
• PERIODS ON TWO KINDS OF NONLINEAR FEEDBACK SHIFT REGISTERS WITH TIME VARYING FEEDBACK FUNCTIONS
• Results on the Nonlinear Span of Binary Sequences
• A Transformation From the Fibonacci to the Galois NLFSRs
• Advances in Cryptology - CRYPTO 2003
• Linear algebra

This page was built for publication: A note on determine the greatest common subfamily of two NFSRs by Gröbner basis