English
Related papers

Related papers: A class of pseudorandom sequences From Function Fi…

200 papers

Motivated by the constructions of binary sequences by utilizing the cyclic elliptic function fields over the finite field $\mathbb{F}_{2^{n}}$ by Jin \textit{et al.} in [IEEE Trans. Inf. Theory 71(8), 2025], we extend the construction to…

Information Theory · Computer Science 2026-05-11 Xiaofeng Liu , Jun Zhang , Fang-Wei Fu

In this paper we present, using the arithmetic of elliptic curves over finite fields, an algorithm for the efficient generation of a sequence of uniform pseudorandom vectors in high dimensions, that simulates a sample of a sequence of…

Probability · Mathematics 2022-10-11 Chung Pang Mok

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…

Number Theory · Mathematics 2025-09-25 Manfred G. Madritsch , Robert F. Tichy

We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a…

Combinatorics · Mathematics 2013-08-20 Hamed Hatami , Pooya Hatami , James Hirst

We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…

Classical Analysis and ODEs · Mathematics 2021-09-07 Richard J. Mathar

We introduce a shifted version of the binomial theorem, and use it to study some remarkable trigonometric integrals and their explicit rewriting in terms of binomial multiple sums. Motivated by the expressions of area generating functions…

Mathematical Physics · Physics 2020-10-23 Stéphane Ouvry , Alexios P. Polychronakos

We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite…

Information Theory · Computer Science 2013-12-06 Harald Niederreiter , Chaoping Xing

Let $\cal R$ be either the Grothendieck semiring (semiring with multiplication) of complex algebraic varieties, or the Grothendieck ring of these varieties, or the Grothendieck ring localized by the class of the complex affine line. We…

Algebraic Geometry · Mathematics 2007-05-23 S. M. Gusein-Zade , I. Luengo , A. Melle-Hernandez

Motivated by the substantial development of the special functions, we contribute to establish some rigorous results on the general series identities with bounded sequences and hypergeometric functions with different arguments, which are…

General Mathematics · Mathematics 2019-02-19 Mohammad Idris Qureshi , Saima Jabee , Mohammad Shadab

Given a prime $p$, an elliptic curve $\E/\F_p$ over the finite field $\F_p$ of $p$ elements and a binary \lrs\ $\(u(n)\)_{n =1}^\infty$ of order~$r$, we study the distribution of the sequence of points $$ \sum_{j=0}^{r-1} u(n+j)P_j, \qquad…

Number Theory · Mathematics 2011-02-08 Simon R. Blackburn , Alina Ostafe , Igor E. Shparlinski

In this paper we study the distribution of very short sequences of inversive congruential pseudorandom numbers modulo $2^t$. We derive a new bound on exponential sums with such sequences and use it to give estimate their discrepancy. The…

Number Theory · Mathematics 2019-06-13 László Mérai , Igor E. Shparlinski

Recently, a conjecture on the linear complexity of a new class of generalized cyclotomic binary sequences of period $p^r$ was proposed by Z. Xiao et al. (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0408-7). Later, for the case $f$ being…

Cryptography and Security · Computer Science 2018-03-16 Zhifan Ye , Pinhui Ke , Chenhuang Wu

We investigate the $k$-error linear complexity of pseudorandom binary sequences of period $p^{\mathfrak{r}}$ derived from the Euler quotients modulo $p^{\mathfrak{r}-1}$, a power of an odd prime $p$ for $\mathfrak{r}\geq 2$. When…

Cryptography and Security · Computer Science 2018-10-05 Zhixiong Chen , Vladimir Edemskiy , Pinhui Ke , Chenhuang Wu

We describe the set of prime numbers splitting completely in the non-abelian splitting field of certain monic irreducible polynomials of degree three. As an application we establish some divisibility properties of the associated ternary…

Number Theory · Mathematics 2022-05-16 Pieter Moree , Armand Noubissie

We propose a new method to construct a stationary process and random field with a given decreasing covariance function and any one-dimensional marginal distribution. The result is a new class of stationary processes and random fields. The…

Methodology · Statistics 2024-07-24 Jeonghwa Lee

In this work we derive results concerning Elliptic Functions using as tools general formulas from previus work.

General Mathematics · Mathematics 2009-07-08 Nikos Bagis

Sequences with a low correlation have very important applications in communications, cryptography, and compressed sensing. In the literature, many efforts have been made to construct good sequences with various lengths where binary…

Information Theory · Computer Science 2022-10-25 Lingfei Jin , Liming Ma , Chaoping Xing

We review a collection of models of random simplicial complexes together with some of the most exciting phenomena related to them. We do not attempt to cover all existing models, but try to focus on those for which many important results…

Probability · Mathematics 2022-05-04 Omer Bobrowski , Dmitri Krioukov

This is a survey article written for a workshop on L-functions and random matrix theory at the Newton Institute in July, 2004. The goal is to give some insight into how well-distributed sets of matrices in classical groups arise from…

Number Theory · Mathematics 2010-02-18 Douglas Ulmer

We prove some general estimates for exponential sums over subsets of finite fields which are definable in the language of rings. This generalizes both the classical exponential sum estimates over varieties over finite fields due to Weil,…

Number Theory · Mathematics 2007-05-23 Emmanuel Kowalski
‹ Prev 1 2 3 10 Next ›