Paper 2005/241
On the binary sequences with high linear complexities and low linear complexities
Hao Chen and Liqing Xu
Abstract
Klapper [1] showed that there are binary sequences of period
Metadata
- Available format(s)
- PS
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Cryptographystream cipher
linear complexity linear complexity - Contact author(s)
- chenhao @ fudan edu cn
- History
- 2005-07-30: received
- Short URL
- https://ia.cr/2005/241
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2005/241, author = {Hao Chen and Liqing Xu}, title = {On the binary sequences with high ${GF}(2)$ linear complexities and low ${GF}(p)$ linear complexities}, howpublished = {Cryptology {ePrint} Archive, Paper 2005/241}, year = {2005}, url = {https://eprint.iacr.org/2005/241} }