Talk:Self-shrinking generator

	This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.CryptographyWikipedia:WikiProject CryptographyTemplate:WikiProject CryptographyCryptography articles
???	This article has not yet received a rating on the importance scale.
	This article is supported by WikiProject Computer science.

(*) According to the LFSR article and my knowledge, the standard is to make the least significant bit (rightmost bit) the degree of the polynomial and the most significant bit (leftmost bit) the x when determining the tap polynomial. Additionally, all tap polynomials end in 1 by convention because we want to make primitive tap polynomials over GF(2) the ones that precisely generate all possible nonzero key values in a standard LFSR.

Jason22 22:22, 5 December 2006 (UTC)[reply]

09.Dec.2008 This is an incomplete sentence: "They went on to show that if the period is at least 2L/2 and also that the linear complexity of the construction is 2L/2-1." —Preceding unsigned comment added by 209.176.49.238 (talk) 03:58, 10 December 2008 (UTC)[reply]