Secure pseudorandom bit generators and point sets with low star-discrepancy
From MaRDI portal
Publication:2029676
DOI10.1016/j.cam.2021.113601zbMath1469.11244arXiv2004.14158OpenAlexW3159262607MaRDI QIDQ2029676
Domingo Gómez-Pérez, Friedrich Pillichshammer, Ana I. Gómez
Publication date: 3 June 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.14158
Related Items (2)
A new approach to analyze the independence of statistical tests of randomness ⋮ A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering numbers, dyadic chaining and discrepancy
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- On the bit security of cryptographic primitives
- The Supremum Norm of the Discrepancy Function: Recent Results and Connections
- Asymptotic distribution $\mathrm{mod} m$ and independence of sequences of integers, I
- Foundations of Cryptography
- The inverse of the star-discrepancy depends linearly on the dimension
- Calculation of Discrepancy Measures and Applications
- Probabilistic discrepancy bound for Monte Carlo point sets
- Introduction to Quasi-Monte Carlo Integration and Applications
- Random Generators and Normal Numbers
- Efficient Pseudorandom Generators Based on the DDH Assumption
This page was built for publication: Secure pseudorandom bit generators and point sets with low star-discrepancy
