Lagged Fibonacci Generators (LFG) are used as a building block of key-stream generator in stream cipher cryptography. In this note, we have used the self-shrinking concept in LFG and given an upper bound 2n+m/8 for the self-shrinking LFG, where n is the number of stage and m is the word size of the LFG. We have also shown that the bound is attained by all the LFGs of degree n < 28, result supported by experiments.
為了持續優化網站功能與使用者體驗,本網站將Cookies分析技術用於網站營運、分析和個人化服務之目的。
若您繼續瀏覽本網站,即表示您同意本網站使用Cookies。