3 citations · 3 across the 7 of their papers we have counts for
7 papers
Quantum approaches to learning parity with noise
Daniel Shiu
The learning parity with noise (LPN) problem is a well-established computational challenge whose difficulty is critical to the security of several post-quantum cryptographic primit…
Systematic study of the validity of the eikonal model including uncertainties
Daniel Shiu, Chloë Hebborn, Filomena M. Nunes
Nuclear reactions at intermediate beam energies are often interpreted using the eikonal model. In the analysis of complex reaction probes, where few-body reaction methods are neede…
The Fibonacci numbers are not a Heilbronn set
Daniel Shiu
For a real number , let denote the distance from to the nearest integer. A set of positive integers is a Heilbronn set if for every $α\in \mathbb…
Identifying reducible k-tuples of vectors with subspace-proximity sensitive hashing/filtering
Gabriella Holden, Daniel Shiu, Lauren Strutt
We introduce and analyse a family of hash and predicate functions that are more likely to produce collisions for small reducible configurations of vectors. These may offer practica…
Efficient computation of tight approximations to Chernoff bounds
D. K. L. Shiu
Chernoff bounds are a powerful application of the Markov inequality to produce strong bounds on the tails of probability distributions. They are often used to bound the tail probab…
Analysis of Solitaire
Daniel Shiu
The Solitaire cipher was designed by Bruce Schneier as a plot point in the novel Cryptonomicon by Neal Stephenson. The cipher is intended to fit the archetype of a modern stream ci…
Increasing and decreasing prime gaps
D. K. L. Shiu
Let denote the th prime and the th prime gap. We demonstrate the existence of infinitely many values of for which wi…