Analysis and design of stream ciphers
Analysis and design of stream ciphers
Nonlinearity criteria for cryptographic functions
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Propagation characteristics of Boolean functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Spread spectrum communications handbook (revised ed.)
Spread spectrum communications handbook (revised ed.)
Finite fields
Shift Register Sequences
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Hi-index | 0.00 |
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk) by taking successive k-tuples of given sequences over GF(p). We are able to characterize those p-ary sequences whose k-tuple versions now over GF(pk) have the maximum possible linear complexities (LCs). Next, we consider the FH/TH sequence generators composed of a combinatorial function generator and some buffers. We are able to characterize the generators whose output FH/TH sequences over GF(pk) have the maximum possible LC for the given algebraic normal form.