Related papers: Simple extractors via constructions of cryptograph…
We develop a simple compiler that generically adds publicly-verifiable deletion to a variety of cryptosystems. Our compiler only makes use of one-way functions (or one-way state generators, if we allow the public verification key to be…
We report upon a novel principle for realization of a fast nondeterministic random number generator whose randomness relies on intrinsic randomness of the quantum physical processes of photonic emission in semiconductors and subsequent…
Low-energy random number generation is critical for many emerging computing schemes proposed to complement or replace von Neumann architectures. However, current random number generators are always associated with an energy cost that is…
Phase-randomized optical homodyne detection is a well-known technique for performing quantum state tomography. So far, it has been mainly considered a sophisticated tool for laboratory experiments but unsuitable for practical applications.…
This article proposes the use of pseudorandom decimal sequences that have gone through an additional random mapping for the design of cryptographic keys. These sequences are generated by starting with inverse prime expansions in base 3 and…
The optimizations of the track fittings require complex simulations of silicon strip detectors to be compliant with the fundamental properties of the hit heteroscedasticity. Many different generations of random numbers must be available…
Motivated by the study of pattern avoidance in the context of permutations and ordered partitions, we consider the enumeration of weak-ordering chains obtained as leaves of certain restricted rooted trees. A tree of order $n$ is generated…
Random number generation is crucial in many aspects of everyday life, as online security and privacy depend ultimately on the quality of random numbers. Many current implementations are based on pseudo-random number generators, but…
We introduce a general framework for constructing compact quantum circuits that implement the real-time evolution of Hamiltonians of the form $H = \sigma P_B$, where $\sigma$ is a Pauli string commuting with a projection operator $P_B$ onto…
Many simulation applications require the generation of long sequences of pseudo-random numbers. Linear recurrences modulo 2 are commonly used as the fundamental building block for constructing pseudo-random number generators with extended…
This work studies the problem of separate random number generation from correlated general sources with side information at the tester under the criterion of statistical distance. Tight one-shot lower and upper performance bounds are…
We investigate the bit-search type irregular decimation algorithms that are used within LFSR-based stream ciphers. In particular, we concentrate on BSG and ABSG, and consider two different setups for the analysis. In the first case, the…
A topological quantum computer should allow intrinsically fault-tolerant quantum computation, but there remains uncertainty about how such a computer can be implemented. It is known that topological quantum computation can be implemented…
Quantum mechanics offers a fundamentally unpredictable entropy source due to the intrinsic probabilistic nature of quantum measurements, making it attractive for secure random number generation. This paper explores the practicality of…
We establish that it is possible to extract accurate blockwise and bitwise soft output from Guessing Codeword Decoding with minimal additional computational complexity by considering it as a variant of Guessing Random Additive Noise…
The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of arithmetic and bitwise logical operations, which are…
A Pseudo-Random Number Generator (PRNG) is any algorithm generating a sequence of numbers approximating properties of random numbers. These numbers are widely employed in mid-level cryptography and in software applications. Test suites are…
Sequence generators obtained by linear recursions over the two-element field $\mathbb{F}_2$, i.e., $\mathbb{F}_2$-linear generators, are widely used as pseudorandom number generators. For example, the Mersenne Twister MT19937 is one of the…
Zhang et al. introduced a novel modification of Goldstein's classical subgradient method, with an efficiency guarantee of $O(\varepsilon^{-4})$ for minimizing Lipschitz functions. Their work, however, makes use of a nonstandard subgradient…
We present three simple algorithms to uniformly generate `Fibonacci words' (i.e., some words that are enumerated by Fibonacci numbers), Schr{\"o}der trees of size $n$ and Motzkin left factors of size $n$ and final height $h$. These…