13,427 research outputs found
Attacks on Pseudo Random Number Generators Hiding a Linear Structure
We introduce lattice-based practical seed-recovery attacks against two efficient number-theoretic pseudo-random number generators: the fast knapsack generator and a family of combined multiple recursive generators. The fast knapsack generator was introduced in 2009 by Von Zur Gathen and Shparlinski. It generates pseudo-random numbers very efficiently with strong mathematical guarantees on their statistical
properties but its resistance to cryptanalysis was left open since 2009. The given attacks are surprisingly efficient when the truncated bits do not represent a too large proportion of the internal states. Their complexities do not strongly increase with the size of parameters, only with the proportion of discarded bits.
A multiple recursive generator is a pseudo-random number generator based on a constant-recursive sequence. A combined multiple recursive generator is a pseudo-random number generator based on combining two or more multiple recursive generators. L’Écuyer presented the general
construction in 1996 and a popular instantiation deemed MRG32k3a in 1999. We use algebraic relations of both pseudo-random generators with underlying algebraic generators to show that they are cryptographically
insecure. We provide a theoretical analysis as well as efficient implementations
Comparison of Randomized Solutions for Constrained Vehicle Routing Problem
In this short paper, we study the capacity-constrained vehicle routing
problem (CVRP) and its solution by randomized Monte Carlo methods. For solving
CVRP we use some pseudorandom number generators commonly used in practice. We
use linear, multiple-recursive, inversive, and explicit inversive congruential
generators and obtain random numbers from each to provide a route for CVRP.
Then we compare the performance of pseudorandom number generators with respect
to the total time the random route takes. We also constructed an open-source
library github.com/iedmrc/binary-cws-mcs on solving CVRP by Monte-Carlo based
heuristic methods.Comment: 6 pages, 2nd International Conference on Electrical, Communication
and Computer Engineering (ICECCE), 12-13 June 2020, Istanbul, Turke
CAMORRA: a C++ library for recursive computation of particle scattering amplitudes
We present a new Monte Carlo tool that computes full tree-level matrix
elements in high-energy physics. The program accepts user-defined models and
has no restrictions on the process multiplicity. To achieve acceptable
performance, CAMORRA evaluates the matrix elements in a recursive way by
combining off-shell currents. Furthermore, CAMORRA can be used to compute
amplitudes involving continuous color and helicity final states.Comment: 22 page
- …