English
Related papers

Related papers: RandSolomon: Optimally Resilient Random Number Gen…

200 papers

We study medium access control layer random access under the assumption that the receiver can perform successive interference cancellation, without feedback. During recent years, a number of protocols with impressive error performance have…

Information Theory · Computer Science 2019-05-09 Christopher Boyd , Roope Vehkalahti , Olav Tirkkonen , Antti Laaksonen

Random numbers play a crucial role in science and industry. Many numerical methods require the use of random numbers, in particular the Monte Carlo method. Therefore it is of paramount importance to have efficient random number generators.…

Computational Physics · Physics 2010-05-25 Helmut G. Katzgraber

How to generate provably true randomness with minimal assumptions? This question is important not only for the efficiency and the security of information processing, but also for understanding how extremely unpredictable events are possible…

Quantum Physics · Physics 2015-05-18 Kai-Min Chung , Yaoyun Shi , Xiaodi Wu

Randomized exponential backoff is a widely deployed technique for coordinating access to a shared resource. A good backoff protocol should, arguably, satisfy three natural properties: (i) it should provide constant throughput, wasting as…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-07-14 Michael A. Bender , Jeremy T. Fineman , Seth Gilbert , Maxwell Young

Each application developer desires to provide its users with consistent results and an always-available system despite failures. Boldly, the CALM theorem disagrees. It states that it is hard to design a system that is both consistent and…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-25 Junchao Chen , Suyash Gupta , Daniel P. Hughes , Mohammad Sadoghi

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…

Consider a complete communication network of $n$ nodes, where the nodes receive a common clock pulse. We study the synchronous $c$-counting problem: given any starting state and up to $f$ faulty nodes with arbitrary behaviour, the task is…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-03-24 Christoph Lenzen , Joel Rybicki , Jukka Suomela

Although quantum random number generators rely on the inherent indeterminism of quantum mechanics, ensuring that the numbers produced are secure remains a significant challenge. We introduce two semi-device-independent randomness expansion…

Quantum Physics · Physics 2026-04-09 Rutvij Bhavsar , Hamid Tebyanian , Roger Colbeck

True random number generator (TRNG) plays a vital role in a variety of security applications and protocols. The security and privacy of an asset rely on the encryption, which solely depends on the quality of random numbers. Memory chips are…

Cryptography and Security · Computer Science 2019-03-27 B. M. S. Bahar Talukder , Joseph Kerns , Biswajit Ray , Thomas Morris , Md Tauhidur Rahman

Overlay management is the cornerstone of building robust and dependable Peer-to-Peer systems. A key component for building such overlays is the peer-sampling service, a mechanism that continuously supplies each node with a set of up-to-date…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-09-07 Alexandros Antonov , Spyros Voulgaris

In this paper, we study a fault-tolerant control for systems consisting of multiple homogeneous components such as parallel processing machines. This type of system is often more robust to uncertainty compared to those with a single…

Optimization and Control · Mathematics 2020-12-03 Jalal Arabneydi , Amir G. Aghdam

This paper explores the development and viability of an alternative pseudorandom number generator (PRNG) that leverages the chaotic dynamics of multiple pendulum systems. Some traditional PRNGs, notably the one implemented in the…

Cryptography and Security · Computer Science 2024-04-29 Matthew Sigit

Algorithms that rely on a pseudorandom number generator often lose their performance guarantees when adversaries can predict the behavior of the generator. To protect non-cryptographic applications against such attacks, we propose 'strong'…

Cryptography and Security · Computer Science 2018-10-05 Jan Wassenberg , Robert Obryk , Jyrki Alakuijala , Emmanuel Mogenet

We give a protocol for Asynchronous Distributed Key Generation (A-DKG) that is optimally resilient (can withstand $f<\frac{n}{3}$ faulty parties), has a constant expected number of rounds, has $\tilde{O}(n^3)$ expected communication…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-06-08 Ittai Abraham , Philipp Jovanovic , Mary Maller , Sarah Meiklejohn , Gilad Stern , Alin Tomescu

The problem of random number generation dates back to von Neumann's work in 1951. Since then, many algorithms have been developed for generating unbiased bits from complex correlated sources as well as for generating arbitrary distributions…

Information Theory · Computer Science 2015-03-18 David Lee , Jehoshua Bruck

Even if the output of a Random Number Generator (RNG) is perfectly uniformly distributed, it may be correlated to pre-existing information and therefore be predictable. Statistical tests are thus not sufficient to guarantee that an RNG is…

Quantum Physics · Physics 2013-11-20 Daniela Frauchiger , Renato Renner , Matthias Troyer

We describe a high-speed physical random number generator based on a hybrid Boolean network with autonomous and clocked logic gates, realized on a reconfigurable chip. The autonomous logic gates are arranged in a bidirectional ring topology…

Chaotic Dynamics · Physics 2013-04-30 David P. Rosin , Damien Rontani , Daniel J. Gauthier

Common randomness (CR), as a resource, is not commonly exploited in existing practical communication systems. In the CR generation framework, both the sender and receiver aim to generate a common random variable observable to both, ideally…

Signal Processing · Electrical Eng. & Systems 2024-06-27 Rami Ezzine , Wafa Labidi , Christian Deppe , Holger Boche

Optimization of a random processes by restart is a subject of active theoretical research in statistical physics and has long found practical application in computer science. Meanwhile, one of the key issues remains largely unsolved: when…

Statistical Mechanics · Physics 2024-04-23 Ilia Nikitin , Sergey Belan

Delay differential equations (DDE) can have "chaotic" solutions that can be used to mimic Brownian motion. Since a Brownian motion is random in its velocity, it is reasonable to think that a random number generator (RNG) might be…

Chaotic Dynamics · Physics 2016-06-22 Julian Self , Michael C. Mackey
‹ Prev 1 4 5 6 7 8 10 Next ›