Fault-tolerant data transmission models based on the redundant residue number system are proposed in this paper; they can transmit data correctly between two ends unless the residue errors exceed the error-correction ...Fault-tolerant data transmission models based on the redundant residue number system are proposed in this paper; they can transmit data correctly between two ends unless the residue errors exceed the error-correction capability. The expressions for the probability of error are presented when the channel noise is additive Gaussian noise and each branch is M-ary orthogonal signaling modulation. The expressions of the probabilities of undetected and uncorrected error are also obtained when the redundant residue number system are single error-checking and single error-correcting model, respectively.展开更多
Montgomery modular multiplication in the residue number system （RNS） can be applied for elliptic curve cryptography. In this work, unified modular multipliers over generalized Mersenne numbers are proposed for RNS M...Montgomery modular multiplication in the residue number system （RNS） can be applied for elliptic curve cryptography. In this work, unified modular multipliers over generalized Mersenne numbers are proposed for RNS Montgomery modular multiplication, which enables efficient elliptic curve point multiplication （ECPM）. Meanwhile, the elliptic curve arithmetic with ECPM is performed by mixed coordinates and adjusted for hardware implementation. In addition, the conversion between RNS and the binary number system is also discussed. Compared with the results in the literature, our hardware architecture for ECPM demonstrates high performance. A 256-bit ECPM in Xilinx XC2VP100 field programmable gate array device （FPGA） can be performed in 1.44 ms, costing 22147 slices, 45 dedicated multipliers, and 8.25K bits of random access memories （RAMs）.展开更多
基金Supported by the National Natural Science Foundation of China
文摘Fault-tolerant data transmission models based on the redundant residue number system are proposed in this paper; they can transmit data correctly between two ends unless the residue errors exceed the error-correction capability. The expressions for the probability of error are presented when the channel noise is additive Gaussian noise and each branch is M-ary orthogonal signaling modulation. The expressions of the probabilities of undetected and uncorrected error are also obtained when the redundant residue number system are single error-checking and single error-correcting model, respectively.
基金supported by the National Natural Science Foundation of China under Grant No. 61073173
文摘Montgomery modular multiplication in the residue number system （RNS） can be applied for elliptic curve cryptography. In this work, unified modular multipliers over generalized Mersenne numbers are proposed for RNS Montgomery modular multiplication, which enables efficient elliptic curve point multiplication （ECPM）. Meanwhile, the elliptic curve arithmetic with ECPM is performed by mixed coordinates and adjusted for hardware implementation. In addition, the conversion between RNS and the binary number system is also discussed. Compared with the results in the literature, our hardware architecture for ECPM demonstrates high performance. A 256-bit ECPM in Xilinx XC2VP100 field programmable gate array device （FPGA） can be performed in 1.44 ms, costing 22147 slices, 45 dedicated multipliers, and 8.25K bits of random access memories （RAMs）.
