Pseudorandom Vector Generation Using Elliptic Curves And Applications
Abstract
In this paper we present, using the arithmetic of elliptic curves over finite fields, an algorithm for the efficient generation of a sequence of uniform pseudorandom vectors in high dimensions, that simulates a sample of a sequence of i.i.d. random variables, with values in the hypercube [0,1]d with uniform distribution. As an application, we obtain, in the discrete time simulation, an efficient algorithm to simulate, uniformly distributed sample path sequence of a sequence of independent standard Wiener processes. This could be employed for use, in the full history recursive multi-level Picard approximation method, for numerically solving the class of semilinear parabolic partial differential equations of the Kolmogorov type.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.