Welcome to the resource topic for 2016/266
Title:
Exact Error Bound of Cox-Rower Architecture for RNS Arithmetic
Authors: Shinichi Kawamura, Tomoko Yonemura, Yuichi Komano, 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.
ePrint: https://eprint.iacr.org/2016/266
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .