Time dependent solitons of noncommutative Chern-Simons theory coupled to scalar fields

We study one- and two-soliton solutions of noncommutative Chern-Simons theory coupled to a nonrelativistic or a relativistic scalar field. In the nonrelativistic case, we find a tower of new stationary time-dependent solutions, all with the same charge density, but with increasing energies. The dynamics of these solitons cannot be studied using traditional moduli space techniques, but we do find a nontrivial symplectic form on the phase space indicating that the moduli space is not flat. In the relativistic case we find the metric on the two soliton moduli space.Comment: 22 pages, 2 figures, JHEP3 style. v2: This paper is a thoroughly revised version. We thank P.A. Horvathy, L. Martina and P.C. Stichel for illuminating comments that led us to reconsider some of our previously reported results; see note added at the end of the paper. v3: Acknowledgements adde

Efficient Acceleration of Asymmetric Cryptography on Graphics Hardware

Graphics processing units (GPU) are increasingly being used for general purpose computing. We present implementations of large integer modular exponentiation, the core of public-key cryptosystems such as RSA, on a DirectX 10 compliant GPU. DirectX 10 compliant graphics processors are the latest generation of GPU architecture, which provide increased programming flexibility and support for integer operations. We present high performance modular exponentiation implementations based on integers represented in both standard radix form and residue number system form. We show how a GPU implementation of a 1024-bit RSA decrypt primitive can outperform a comparable CPU implementation by up to 4 times and also improve the performance of previous GPU implementations by decreasing latency by up to 7 times and doubling throughput. We present how an adaptive approach to modular exponentiation involving implementations based on both a radix and a residue number system gives the best all-around performance on the GPU both in terms of latency and throughput. We also highlight the usage criteria necessary to allow the GPU to reach peak performance on public key cryptographic operations