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

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

Special Section on Cryptography and Information Security

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

Lin WANG, Yu ZHOU, Ying GAO

Author information

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

JOURNAL RESTRICTED ACCESS

2015 Volume E98.A Issue 1 Pages 246-249

DOI https://doi.org/10.1587/transfun.E98.A.246

Details

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.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!