Montgomery reduction within the context of residue number system arithmetic
نویسندگان
چکیده
منابع مشابه
Montgomery Modular Multiplication in Residue Arithmetic
We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery's method adapted to residue arithmetic. By choosing the moduli of the RNS system reasonably large, an eeect corresponding to a redundant high-radix implementation is achieved, due to the carry-free nature of residue arithmetic. The actual computation in the multiplication takes place in con...
متن کاملResidue Number System Arithmetic Assisted -ary Modulation
A residue number system based M -ary modem is proposed and its performance is evaluated over Gaussian channels. When one or two redundant moduli are employed, a signal-to-noise ratio gain of 1.2–2 dB was achieved for a 16-ary, 32-ary and 37-ary modem, respectively, at a bit error rate of 10 .
متن کاملFloating-Point Arithmetic Algorithms in the Symmetric Residue Number System
The residue number system is an integer number system and is inconvenient to represent numbers with fractional parts. In the symmetric residue system, a new representation of floating-point numbers and arithmetic algorithms for its addition, subtraction, multiplication, and division are proposed. A floating-point number is expressed as an integer multiplied by a product of the moduli. The propo...
متن کاملParallel Montgomery Multiplication in GF (2) using Trinomial Residue Arithmetic
We propose the first general multiplication algorithm in GF (2k) with a subquadratic area complexity of O(k8/5) = O(k1.6). We represent the elements of GF (2k) according to 2n pairwise prime trinomials, T1, . . . , T2n, of degree d, such that nd ≥ k. Our algorithm is based on Montgomery’s multiplication applied to the ring formed by the direct product of the n first trinomials.
متن کاملIntegrated Nanophotonics Architecture for Residue Number System Arithmetic
Residue number system (RNS) enables dimensionality reduction of an arithmetic problem by representing a large number as a set of smaller integers, where the number is decomposed by prime number factorization using the moduli as basic functions. These reduced problem sets can then be processed independently and in parallel, thus improving computational efficiency and speed. Here we show an optic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptographic Engineering
سال: 2017
ISSN: 2190-8508,2190-8516
DOI: 10.1007/s13389-017-0154-9