We define a family of 2e+1-periodic binary threshold sequences and a family of p2-periodic binary threshold sequences by using Carmichael quotients modulo 2e (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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Chenhuang WU, Zhixiong CHEN, Xiaoni DU, "Binary Threshold Sequences Derived from Carmichael Quotients with Even Numbers Modulus" in IEICE TRANSACTIONS on Fundamentals,
vol. E95-A, no. 7, pp. 1197-1199, July 2012, doi: 10.1587/transfun.E95.A.1197.
Abstract: We define a family of 2e+1-periodic binary threshold sequences and a family of p2-periodic binary threshold sequences by using Carmichael quotients modulo 2e (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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.1197/_p
Copy
@ARTICLE{e95-a_7_1197,
author={Chenhuang WU, Zhixiong CHEN, Xiaoni DU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Binary Threshold Sequences Derived from Carmichael Quotients with Even Numbers Modulus},
year={2012},
volume={E95-A},
number={7},
pages={1197-1199},
abstract={We define a family of 2e+1-periodic binary threshold sequences and a family of p2-periodic binary threshold sequences by using Carmichael quotients modulo 2e (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.},
keywords={},
doi={10.1587/transfun.E95.A.1197},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - Binary Threshold Sequences Derived from Carmichael Quotients with Even Numbers Modulus
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1197
EP - 1199
AU - Chenhuang WU
AU - Zhixiong CHEN
AU - Xiaoni DU
PY - 2012
DO - 10.1587/transfun.E95.A.1197
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2012
AB - We define a family of 2e+1-periodic binary threshold sequences and a family of p2-periodic binary threshold sequences by using Carmichael quotients modulo 2e (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.
ER -