Shrinking generators based on σ-LFSRs

Please use this identifier to cite or link to this item: https://idr.l3.nitk.ac.in/jspui/handle/123456789/15825

Full metadata record

DC Field	Value	Language
dc.contributor.author	Bishoi S.K.
dc.contributor.author	Senapati K.
dc.contributor.author	Shankar B.R.
dc.date.accessioned	2021-05-05T10:28:09Z	-
dc.date.available	2021-05-05T10:28:09Z	-
dc.date.issued	2020
dc.identifier.citation	Discrete Applied Mathematics Vol. 285 , , p. 493 - 500	en_US
dc.identifier.uri	https://doi.org/10.1016/j.dam.2020.06.010
dc.identifier.uri	http://idr.nitk.ac.in/jspui/handle/123456789/15825	-
dc.description.abstract	The word-based LFSRs called σ-LFSRs are very attractive as they take advantage of the modern word-based processor and thus increase the throughput. Secondly, the bitstream produced by σ-LFSR has excellent statistical properties with a high period except for low linear complexity. In order to increase the linear complexity, the concept of both bit-oriented shrinking and self-shrinking generators is introduced in case of σ-LFSRs. In both the cases, the lower bound for the period as well as for the linear complexity of the bitstream are shown to be exponential. Further, we have experimented and investigated more results on the periodicity and statistical properties of the bitstream in self-shrinking σ-LFSRs. This helps to find and prove the exact period of the bitstream produced by self-shrinking generators. © 2020 Elsevier B.V.	en_US
dc.title	Shrinking generators based on σ-LFSRs	en_US
dc.type	Article	en_US
Appears in Collections:	1. Journal Articles

Files in This Item:

There are no files associated with this item.