Finite binary sequences constructed by explicit inversive methods (Q938755): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ffa.2007.08.002 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Yaochen Zhu / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Yaochen Zhu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ffa.2007.08.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978246545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography and Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting nonlinear pseudorandom number generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite pseudorandom binary sequences VII: The measures of pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The period lengths of inversive pseudorandom vector generations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of large families of pseudorandom binary sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multidimensional distribution of inversive congruential pseudorandom numbers in parts of the period / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a family of pseudorandom binary sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pseudorandom binary lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of pseudorandom binary sequences using additive characters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the measures of pseudorandomness of binary sequences. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of pseudorandom binary sequences by using the multiplicative inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5449223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear complexity profile of explicit nonlinear pseudorandom numbers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4832273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear complexity profile of some new explicit inversive pseudorandom numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Sums and Goppa Codes: I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Serial Test for Congruential Pseudorandom Numbers Generated by Inversions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the correlation of pseudorandom numbers generated by inversive methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of pseudorandom numbers and vectors generated by inversive methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of inversive congruential pseudorandom numbers in parts of the period / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of compound inversive congruential pseudorandom numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the lattice structure of pseudorandom numbers generated over arbitrary finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice structure and linear complexity of nonlinear pseudorandom numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular constructions of pseudorandom binary sequences with composite moduli / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5482386 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.FFA.2007.08.002 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:00, 10 December 2024

scientific article
Language Label Description Also known as
English
Finite binary sequences constructed by explicit inversive methods
scientific article

    Statements

    Finite binary sequences constructed by explicit inversive methods (English)
    0 references
    0 references
    27 August 2008
    0 references
    In the present paper some families of finite binary sequences with strong pseudo-random properties are constructed by explicit inversive methods. One of them is as follows, let \(q=p^r\) be a power of prime \(p\) and \(\mathbb F_q\) the finite field of order \(q\). Taking \(\vartheta,\alpha,\beta \in\mathbb F^*_q\), where \(\vartheta\) is a fixed element of large multiplicative order \(T\), define \(\sigma_n=\overline{\alpha\vartheta^n +\beta}\) \((n=1/2,\dots)\), where \(\overline \gamma=\gamma^{-1}\) (if \(\gamma\in\mathbb F^*_q)\), or 0 (if \(\gamma=0)\). For an ordered basis \(\{\gamma_1,\dots,\gamma_r\}\) of \(\mathbb F_q\) over \(\mathbb F_p\), let \(\sigma_n=\sum^r_{j=1}c_{n,j}\gamma_j\) with all \(c_{n,j}\in \mathbb F_p\), and \(x_n=\sum^r_{j=1}c_{n,j}p^{-j}\). Then we define a binary sequence \(S_T=\{s_1, \dots,s_T\}\) by \(s_n:=0\) (if \(0\leq x_n< 1/2)\), or 1 (if \(1/2\leq x_n<1)\). The author proves that the well-distribution measure \[ W(S_T)\ll\min\{q^{1/2}(\log T)(\log q),T^{1/2} q^{1/4}(\log q)\}, \] and the correlation measure of order \(k (<T)\) \[ C_k(S_T)\ll\min\{q^{1/2}(\log T)(\log q)^k,T^{1/2}q^{1/4}(\log q)^k\} \] by using some estimates of certain exponential sums over finite fields. Moreover, the constructions using explicit nonlinear generators are also considered.
    0 references
    pseudo-random binary sequences
    0 references
    inversive methods
    0 references
    exponential sums
    0 references
    correlation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers