In thus work, a new class of keystream generators with a large hnear complexity has been derived The design crlterla are esslly compatible with those given m the hterature to prevent correlation attacks
Comments on “a family of keystream generators with large linear complexity”
✍ Scribed by A Fúster-Sabater
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 112 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This letter contributes to the investigation of the linear complexity of generalized cyclotomic sequences with the period p m , which are contained by the sequences constructed by C. Ding and T. Helleseth in 1998, as a representative special case. The results obtained confirm that all of these seque
## Abstract We give two constructions of a balanced incomplete‐block design discovered by van Lint: the design has parameters (13,39,15,5,5), and has repeated blocks and an automorphism group of order 240. One of these methods can be generalized to produce a large class of designs with the properti