On Finite Pseudorandom Binary Sequences: Generalized polynomials

In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but also the floor function. We estimate the well-distribution measure, looking at the "randomness" along arithmetic progressions.

Authors

Institutions

Publication Details

Journal
Hardy-Ramanujan Journal
Published
2026-04-27
DOI
https://doi.org/10.46298/hrj.2026.17905
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Finite Pseudorandom Binary Sequences: Generalized polynomials

Robert Tichy, Manfred Madritsch
Hardy-Ramanujan Journal
Coding theory and cryptography
article

On Finite Pseudorandom Binary Sequences: Generalized polynomials

Robert Tichy, Manfred Madritsch
article en

Abstract

In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but also the floor function. We estimate the well-distribution measure, looking at the "randomness" along arithmetic progressions.

Hardy-Ramanujan JournalVol. Volume 48 - 2025
Graz University of Technology (AT)
Agence Nationale de la Recherche, Austrian Science Fund
Openalex Percentile: Top 4%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.