A Tighter Bound for the Character Sum of Primitive Sequences over Residue Rings Modulo Square-Free Odd Integers

Lin WANG; Yu ZHOU; Ying GAO

doi:10.1587/transfun.E98.A.246

A Tighter Bound for the Character Sum of Primitive Sequences over Residue Rings Modulo Square-Free Odd Integers

Lin WANG, Yu ZHOU, Ying GAO

Full Text Views

0

Share
Cite this

Summary :

Primitive linear recurring sequences over rings are important in modern communication technology, and character sums of such sequences are used to analyze their statistical properties. We obtain a new upper bound for the character sum of primitive sequences of order n over the residue ring modulo a square-free odd integer m, and thereby improve previously known bound m^n/2.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.1 pp.246-249

Publication Date: 2015/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E98.A.246

Type of Manuscript: Special Section LETTER (Special Section on Cryptography and Information Security)

Category

Authors

Lin WANG
  Science and Technology on Communication Security Laboratory
Yu ZHOU
  Science and Technology on Communication Security Laboratory
Ying GAO
  Beihang University

Keyword

linear recurring sequence, primitive sequence, residue ring, character sum

Cite this

Copy

Lin WANG, Yu ZHOU, Ying GAO, "A Tighter Bound for the Character Sum of Primitive Sequences over Residue Rings Modulo Square-Free Odd Integers" in IEICE TRANSACTIONS on Fundamentals, vol. E98-A, no. 1, pp. 246-249, January 2015, doi: 10.1587/transfun.E98.A.246.
Abstract: Primitive linear recurring sequences over rings are important in modern communication technology, and character sums of such sequences are used to analyze their statistical properties. We obtain a new upper bound for the character sum of primitive sequences of order n over the residue ring modulo a square-free odd integer m, and thereby improve previously known bound m^n/2.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.246/_p

Copy

@ARTICLE{e98-a_1_246,
author={Lin WANG, Yu ZHOU, Ying GAO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Tighter Bound for the Character Sum of Primitive Sequences over Residue Rings Modulo Square-Free Odd Integers},
year={2015},
volume={E98-A},
number={1},
pages={246-249},
abstract={Primitive linear recurring sequences over rings are important in modern communication technology, and character sums of such sequences are used to analyze their statistical properties. We obtain a new upper bound for the character sum of primitive sequences of order n over the residue ring modulo a square-free odd integer m, and thereby improve previously known bound m^n/2.},
keywords={},
doi={10.1587/transfun.E98.A.246},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - A Tighter Bound for the Character Sum of Primitive Sequences over Residue Rings Modulo Square-Free Odd Integers
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 246
EP - 249
AU - Lin WANG
AU - Yu ZHOU
AU - Ying GAO
PY - 2015
DO - 10.1587/transfun.E98.A.246
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2015
AB - Primitive linear recurring sequences over rings are important in modern communication technology, and character sums of such sequences are used to analyze their statistical properties. We obtain a new upper bound for the character sum of primitive sequences of order n over the residue ring modulo a square-free odd integer m, and thereby improve previously known bound m^n/2.
ER -