Cryptology ePrint Archive: Report 2016/266

Exact Error Bound of Cox-Rower Architecture for RNS Arithmetic

Shinichi Kawamura and Tomoko Yonemura and Yuichi Komano and Hideo Shimizu

Abstract: Residue Number System (RNS) is a method for representing an integer as an n-tuple of its residues with respect to a given base. Since RNS has inherent parallelism, it is actively researched to implement fast public-key cryptography using RNS. This paper derives the exact error bound of approximation on the Cox-Rower architecture which was proposed for RNS modular multiplication. This is the tightest bound ever found and enables us to find new parameter sets for the Cox-Rower architecture, which cannot be found with old bounds.

Category / Keywords: implementation / cryptography, implementation, Residue Number System

Date: received 8 Mar 2016

Contact author: shinichi2 kawamura at toshiba co jp

Available format(s): PDF | BibTeX Citation

Version: 20160310:180945 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]