Search arXiv⌕ Search

arXiv subjects

Ronald Rietman

Publications and source records attributed to Ronald Rietman.

6 recordsLinked to original sources
arXiv2018

A Multi-layer Recursive Residue Number System

We present a method to increase the dynamical range of a Residue Number System (RNS) by adding virtual RNS layers on top of the original RNS, where the required modular arithmetic for a modulus on any non-bottom layer is implemented by means of an RNS Montgomery multiplication algorithm that uses the RNS on the layer below. As a result, the actual arithmetic is deferred to the bottom layer. The multiplication algorithm that we use is based on an algorithm by Bajard and Imbert, extended to work with pseudo-residues (remainders with a larger range than the modulus). The resulting Recursive Residue Number System (RRNS) can be used to implement modular addition, multiplication, and multiply-and-accumulate for very large (2000+ bits) moduli, using only modular operations for small (for example 8-bits) moduli. A hardware implementation of this method allows for massive parallelization. Our method can be applied in cryptographic algorithms such as RSA to realize modular exponentiation with a large (2048-bit, or even 4096-bit) modulus. Due to the use of full RNS Montgomery algorithms, the system does not involve any carries, therefore cryptographic attacks that exploit carries cannot be applied.

cs.CR↗
arXiv2014

The MMO problem

We consider a two polynomials analogue of the polynomial interpolation problem. Namely, we consider the Mixing Modular Operations (MMO) problem of recovering two polynomials $f\in \Z_p[x]$ and $g\in \Z_q[x]$ of known degree, where $p$ and $q$ are two (un)known positive integers, from the values of $f(t)\bmod p + g(t)\bmod q$ at polynomially many points $t \in \Z$. We show that if $p$ and $q$ are known, the MMO problem is equivalent to computing a close vector in a lattice with respect to the infinity norm. We also implemented in the SAGE system a heuristic polynomial-time algorithm. If $p$ and $q$ are kept secret, we do not know how to solve this problem. This problem is motivated by several potential cryptographic applications.

math.RA↗
arXiv1995

Anyon trajectories and the systematics of the three-anyon spectrum

We develop the concept of trajectories in anyon spectra, i.e., the continuous dependence of energy levels on the kinetic angular momentum. It provides a more economical and unified description, since each trajectory contains an infinite number of points corresponding to the same statistics. For a system of non-interacting anyons in a harmonic potential, each trajectory consists of two infinite straight line segments, in general connected by a nonlinear piece. We give the systematics of the three-anyon trajectories. The trajectories in general cross each other at the bosonic/fermionic points. We use the (semi-empirical) rule that all such crossings are true crossings, i.e.\ the order of the trajectories with respect to energy is opposite to the left and to the right of a crossing.

hep-th↗
arXiv1994

Solution of the Three--Anyon Problem

We solve, by separation of variables, the problem of three anyons with a harmonic oscillator potential. The anyonic symmetry conditions from cyclic permutations are separable in our coordinates. The conditions from two-particle transpositions are not separable, but can be expressed as reflection symmetry conditions on the wave function and its normal derivative on the boundary of a circle. Thus the problem becomes one-dimensional. We solve this problem numerically by discretization. $N$-point discretization with very small $N$ is often a good first approximation, on the other hand convergence as $N\to\infty$ is sometimes very slow.

hep-th↗
arXiv1993

A Solvable Model for Intersecting Loops

We show that some models with non-local (and non-localizable) interactions have a property, called quasi-locality, which allows for the definition of a transfer matrix. We give the Yang-Baxter equation as a sufficient condition for the existence of a family of commuting transfer matrices and solve them for a loop model with intersections. This solvable model is then analyzed in some detail and its applications to a Lorentz gas are briefly discussed.

hep-th↗