New Scientist

We’ve finally cracked how to make truly random numbers

From machine learning to voting, the workings of the world demand randomisation, but true sources of randomness are ...
IEEE

Proof of Random Leader: A Fast and Manipulation-Resistant Proof-of-Authority Consensus Algorithm for Permissioned Blockchains Using Verifiable Random Function

Abstract: Proof of Authority (PoA) is a widely adopted consensus algorithm for permissioned blockchain networks, where a group of trusted entities governs the network. PoA is known for achieving rapid ...
archive

Problems In Probability Theory, Mathematical Statistics And Theory Of Random Functions

An illustration of a magnifying glass. An illustration of a magnifying glass.
IEEE

Harvesting RTN for True Random Number Generators and Physical Unclonable Functions

Abstract: Random Telegraph Noise (RTN) is an intriguing entropy source that can be exploited to develop lightweight cryptographic primitives. Its utility in Physical Unclonable Functions (PUFs) has ...
Scientific American

How to Identify a Prime Number without a Computer

Is 170,141,183,460,469,231,731,687,303,715,884,105,727 prime? Before you ask the Internet for an answer, can you consider how you might answer that question without a ...