Binary Threshold Sequences Derived from Carmichael Quotients with Even Numbers Modulus

摘要

We define a family of 2~(e+1)-periodic binary threshold sequences and a family of p~2-periodic binary threshold sequences by using Carmichael quotients modulo 2~e (e > 2) and 2p (p is an odd prime), respectively. These are extensions of the construction derived from Fermat quotients modulo an odd prime in our earlier work. We determine exact values of the linear complexity, which are larger than half of the period. For cryptographic purpose, the linear complexities of the sequences in this letter are of desired values.