English
Related papers

Related papers: On asymptotically optimal tests for random number …

200 papers

Sequential monitoring of randomized trials traditionally relies on parametric assumptions or asymptotic approximations. We discuss a family of nonparametric sequential tests - collectively called e-RT - for binary, event-only, and…

Methodology · Statistics 2026-05-12 Fernando G Zampieri

Semi-device independent (Semi-DI) quantum random number generators (QRNG) gained attention for security applications, offering an excellent trade-off between security and generation rate. This paper presents a proof-of-principle time-bin…

Pseudo-Random Numbers Generators (PRNGs) are algorithms produced to generate long sequences of statistically uncorrelated numbers, i.e. Pseudo-Random Numbers (PRNs). These numbers are widely employed in mid-level cryptography and in…

Cryptography and Security · Computer Science 2019-12-30 Luca Pasqualini , Maurizio Parton

We analyze the thermodynamic costs of the three main approaches to generating random numbers via the recently introduced Information Processing Second Law. Given access to a specified source of randomness, a random number generator (RNG)…

Statistical Mechanics · Physics 2017-07-05 C. Aghamohammadi , J. P. Crutchfield

We study random number generators (RNGs), both in the fixed to variable-length (FVR) and the variable to fixed-length (VFR) regimes, in a universal setting in which the input is a finite memory source of arbitrary order and unknown…

Information Theory · Computer Science 2015-03-12 Gadiel Seroussi , Marcelo J. Weinberger

A random number generator is proposed based on a theorem about existence of chaos in fixed point iteration of x= cot2(x). Digital computer simulation of this function iteration exhibits random behavior. A method is proposed to extract…

Discrete Mathematics · Computer Science 2013-01-23 Nabarun Mondal , Partha P. Ghosh

Random numbers are a fundamental ingredient for many applications including simulation, modelling and cryptography. Sound random numbers should be independent and uniformly distributed. Moreover, for cryptographic applications they should…

We consider Bayesian multiple statistical classification problem in the case where the unknown source distributions are estimated from the labeled training sequences, then the estimates are used as nominal distributions in a robust…

Information Theory · Computer Science 2021-10-11 Hüseyin Afşer

In this paper we present experiments in order to show how some pseudo random number generators can improve the effectiveness of a statistical cryptanalysis algorithm. We deduce mainly that a better generator enhance the accuracy of the…

Cryptography and Security · Computer Science 2014-09-19 O. Benamara , F. Merazka

The authors discuss what is provable security in cryptography. Think that provable security is asymptotic, relative, and dynamic, and only a supplement to but not a replacement of exact security analysis. Because the conjecture P != NP has…

Cryptography and Security · Computer Science 2014-08-27 Shenghui Su , Shuwang Lu

In pure exploration problems, a statistician sequentially collects information to answer a question about some stochastic and unknown environment. The probability of returning a wrong answer should not exceed a maximum risk parameter…

Machine Learning · Computer Science 2026-02-19 Riccardo Poiani , Martino Bernasconi , Andrea Celli

This work considers the deployment of pseudo-random number generators (PRNGs) on graphics processing units (GPUs), developing an approach based on the xorgens generator to rapidly produce pseudo-random numbers of high statistical quality.…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-03-13 Nimalan Nandapalan , Richard P. Brent , Lawrence M. Murray , Alistair Rendell

We propose a class of locally and asymptotically optimal tests, based on multivariate ranks and signs for the homogeneity of scatter matrices in $m$ elliptical populations. Contrary to the existing parametric procedures, these tests remain…

Statistics Theory · Mathematics 2008-12-18 Marc Hallin , Davy Paindaveine

Our ability to trust that a random number is truly random is essential for fields as diverse as cryptography and fundamental tests of quantum mechanics. Existing solutions both come with drawbacks -- device-independent quantum random number…

A common challenge in nonparametric inference is its high computational complexity when data volume is large. In this paper, we develop computationally efficient nonparametric testing by employing a random projection strategy. In the…

Statistics Theory · Mathematics 2018-02-20 Meimei Liu , Zuofeng Shang , Guang Cheng

Random numbers are essential for our modern information based society e.g. in cryptography. Unlike frequently used pseudo-random generators, physical random number generators do not depend on complex algorithms but rather on a physical…

Quantum Physics · Physics 2015-06-11 Mario Stipčević , Rupert Ursin

Recent exact analytical results developed for the random number generators with taps are reported. These results are applicable to a wide class of algorithms, including random walks, cluster algorithms, Ising models. Practical…

High Energy Physics - Lattice · Physics 2009-11-07 Lev N. Shchur

We investigate the problem of jointly testing multiple hypotheses and estimating a random parameter of the underlying distribution in a sequential setup. The aim is to jointly infer the true hypothesis and the true parameter while using on…

Signal Processing · Electrical Eng. & Systems 2024-02-02 Dominik Reinhard , Michael Fauß , Abdelhak M. Zoubir

This paper studies optimal hypothesis testing for nonregular econometric models with parameter-dependent support. We consider both one-sided and two-sided hypothesis testing and develop asymptotically uniformly most powerful tests based on…

Statistics Theory · Mathematics 2025-10-07 Yuya Shimizu , Taisuke Otsu

We present a scheme for a self-testing quantum random number generator. Compared to the fully device-independent model, our scheme requires an extra natural assumption, namely that the mean energy per signal is bounded. The scheme is…

‹ Prev 1 3 4 5 6 7 10 Next ›