We point out that off-shell four-dimensional spacetime-supersymmetry implies strange hermiticity properties for the N=1 RNS superstring. However, these hermiticity properties become natural when the N=1 superstring is embedded into an N=2 superstring.

The pure spinor formalism for the superstring has recently been used to compute massless four-point two-loop amplitudes in a manifestly super-Poincaré covariant manner. In this paper, we show that when all four external states are Neveu-Schwarz, the two-loop amplitude coincides with the RNS result.

Residue Number Systems (RNS) are useful for distributing large dynamic range computations over small modular rings, which allows the speed up of computations. This feature is well known, and already used in both DSP and cryptography. In this paper we deal with implementation for huge numbers like those used for ciphering as with RSA or ECC on prime finite fields. Modular multiplication is the m...

This paper explores the security of a single-stage residue number system (RNS) pseudorandom generator (PRNG), which has previously been shown to provide extremely high-quality outputs when evaluated through available RNG statistical test suites or in using Shannon and Kolmogorov entropy metrics. In contrast, rather than blindly performing analyses on RNS PRNG, this provides both white box black...

Graphics processing units (GPUs) are increasingly being used for general purpose processing. 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 int...

Reversible computing is an emerging technique to achieve ultra-low-power circuits. arithmetic circuits allow for achieving energy-efficient high-performance computational systems. Residue number systems (RNS) provide parallel and fault-tolerant additions multiplications without carry propagation between residue digits. The parallelism fault-tolerance features of RNS can be leveraged reversible ...

over the past few decades, the intense growth of portable communication devices leads to stringent need of efficient system performance. The system performance is upgraded by reducing the computation time. The Residue Number System performs the computations fast and makes use of the power and energy efficiently. In this paper, the modified prefix adders are proposed to perform the fast modulo c...

In this paper, a new method is introduced for improving the efficiency of the Residue Number System, which uses both binary and residue representations in order to represent a number. A residue number system uses the remainder of the division in several different modules. Conversion of a number to smaller ones and carrying out parallel calculations on these numbers greatly increase the speed of...

A special moduli set Residue Number System (RNS) of high dynamic range (DR) can speed up the execution of very-large word-length repetitive multiplications found in applications like public key cryptography. The modulo 2n − 1 multiplier is usually the noncritical datapath among all modulo multipliers in such high-DR RNS multiplier. This timing slack can be exploited to reduce the system area an...

A special moduli set Residue Number System (RNS) of high dynamic range (DR) can speed up the execution of very large word-length repetitive multiplications found in applications like public key cryptography. The modulo 2 − 1 multiplier is usually the noncritical datapath among all modulo multipliers in such high-DR RNS multiplier. This timing slack can be exploited to reduce the system area and...