Construction of Pseudorandom Binary Sequences Using Additive Characters

Christian Mauduit, Joël Rivat, A. Sárközy

Research output: Contribution to journalArticle

50 Citations (Scopus)

Abstract

In earlier papers the authors studied finite pseudorandom binary sequences, and they constructed sequences with strong pseudorandom properties. In these earlier constructions multiplicative characters were used. In this paper a new construction is presented which utilizes properties of additive characters. These new sequences can be computed fast, they are well-distributed relative to arithmetic progressions and their correlations of "small" order are "small", but the price paid for the fast computation is that the correlations of "large" order can be "large".

Original languageEnglish
Pages (from-to)197-208
Number of pages12
JournalMonatshefte fur Mathematik
Volume141
Issue number3
Publication statusPublished - Mar 2004

Fingerprint

Pseudorandom Sequence
Binary Sequences
Arithmetic sequence
Multiplicative
Character

Keywords

  • Additive character
  • Binary sequence
  • Correlation
  • Pseudo-random

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Construction of Pseudorandom Binary Sequences Using Additive Characters. / Mauduit, Christian; Rivat, Joël; Sárközy, A.

In: Monatshefte fur Mathematik, Vol. 141, No. 3, 03.2004, p. 197-208.

Research output: Contribution to journalArticle

Mauduit, Christian ; Rivat, Joël ; Sárközy, A. / Construction of Pseudorandom Binary Sequences Using Additive Characters. In: Monatshefte fur Mathematik. 2004 ; Vol. 141, No. 3. pp. 197-208.
@article{5a9c18a0366049a69ec04abfda961260,
title = "Construction of Pseudorandom Binary Sequences Using Additive Characters",
abstract = "In earlier papers the authors studied finite pseudorandom binary sequences, and they constructed sequences with strong pseudorandom properties. In these earlier constructions multiplicative characters were used. In this paper a new construction is presented which utilizes properties of additive characters. These new sequences can be computed fast, they are well-distributed relative to arithmetic progressions and their correlations of {"}small{"} order are {"}small{"}, but the price paid for the fast computation is that the correlations of {"}large{"} order can be {"}large{"}.",
keywords = "Additive character, Binary sequence, Correlation, Pseudo-random",
author = "Christian Mauduit and Jo{\"e}l Rivat and A. S{\'a}rk{\"o}zy",
year = "2004",
month = "3",
language = "English",
volume = "141",
pages = "197--208",
journal = "Monatshefte fur Mathematik",
issn = "0026-9255",
publisher = "Springer Wien",
number = "3",

}

TY - JOUR

T1 - Construction of Pseudorandom Binary Sequences Using Additive Characters

AU - Mauduit, Christian

AU - Rivat, Joël

AU - Sárközy, A.

PY - 2004/3

Y1 - 2004/3

N2 - In earlier papers the authors studied finite pseudorandom binary sequences, and they constructed sequences with strong pseudorandom properties. In these earlier constructions multiplicative characters were used. In this paper a new construction is presented which utilizes properties of additive characters. These new sequences can be computed fast, they are well-distributed relative to arithmetic progressions and their correlations of "small" order are "small", but the price paid for the fast computation is that the correlations of "large" order can be "large".

AB - In earlier papers the authors studied finite pseudorandom binary sequences, and they constructed sequences with strong pseudorandom properties. In these earlier constructions multiplicative characters were used. In this paper a new construction is presented which utilizes properties of additive characters. These new sequences can be computed fast, they are well-distributed relative to arithmetic progressions and their correlations of "small" order are "small", but the price paid for the fast computation is that the correlations of "large" order can be "large".

KW - Additive character

KW - Binary sequence

KW - Correlation

KW - Pseudo-random

UR - http://www.scopus.com/inward/record.url?scp=1842432435&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1842432435&partnerID=8YFLogxK

M3 - Article

VL - 141

SP - 197

EP - 208

JO - Monatshefte fur Mathematik

JF - Monatshefte fur Mathematik

SN - 0026-9255

IS - 3

ER -