Difference between revisions of "Linear complexity"

Latest revision as of 17:51, 7 December 2013

The linear complexity of a sequence is an order of "most compact" linear recurrence relation, which governs all signs sequence. [F10]

Revision as of 01:07, 26 November 2013 (view source) 13-02-GendugovaDV (Talk \| contribs) (Created page with "'''The linear complexity of a sequence''' - the order of "most compact" linear recurrence relation, which governs all signs sequence. References to section Cryptographic gen...")		Latest revision as of 17:51, 7 December 2013 (view source) 13-04-AvezovaYE (Talk \| contribs)
Line 1:		Line 1:
−	'''The linear complexity of a sequence''' ~~- the~~ order of "most compact" linear recurrence relation, which governs all signs sequence. [[References to section Cryptographic generators. Stream ciphers and their cryptanalysis # F10 \| [F10]]]	+	'''The linear complexity of a sequence''' is an order of "most compact" linear recurrence relation, which governs all signs sequence. [[References to section Cryptographic generators. Stream ciphers and their cryptanalysis # F10 \| [F10]]]


−	[[Cryptographic generators. Stream ciphers and their cryptanalysis # Glossary \| ~~Home page section~~]]	+	[[Cryptographic generators. Stream ciphers and their cryptanalysis#Glossary \| Back]]