Parity Detection for Some Three-Modulus Residue Number System

2014 Ninth Asia Joint Conference on Information Security Pub Date : 2014-09-01 DOI:10.1109/AsiaJCIS.2014.13

D. Guan, Yu-Shan Cheng

引用次数: 3

Abstract

In this paper, we present a parity detection algorithm for residue number system using three-modulus set {2p -- 1, 2p + 1, 2p² -- 1}, where p is a positive integer. Given residue number system representation of X = (x1, x2, x3) where x1 = X mod 2p-1, x2 = X mod 2p+1, x₃ = X mod 2p² -- 1. We show that the parity of X can be computed by (x1 + x2 + x₃ + G (d) mod 2, where d = p (x2 -- x1) + (2x₃ -- x1 -- x2), G (d) = 1, if d > 2 (2p² -- 1) or d <; 0, otherwise, G(d) = 0.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

一类三模剩余数系统的奇偶检测

本文利用三模集{2p—1,2p + 1,2p2—1}给出了残数系统的奇偶检测算法，其中p为正整数。给定X = (x1, x2, x3)的剩数系统表示，其中x1 = X mod 2p-1, x2 = X mod 2p+1, x3 = X mod 2p2 -1。我们证明了X的奇偶性可以用(x1 + x2 + x3 + G (d) mod 2来计算，其中d = p (x2—x1) + (2x3—x1—x2)， G (d) = 1，如果d > 2 (2p2—1)或d <;0，否则G(d) = 0。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2014 Ninth Asia Joint Conference on Information Security

自引率

0.00%

发文量

期刊最新文献

Data Hiding Based on Radix-2 Parity Detection for Some Three-Modulus Residue Number System Gen2v2-Security-and-Privacy-Features-Leveraged Application Designs Acceleration of AES Encryption with OpenCL Detecting Advertisement Module Network Behavior with Graph Modeling