You are looking at a specific version 20160310:180945 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- Category
- Implementation
- Publication info
- Preprint. MINOR revision.
- Keywords
- cryptographyimplementationResidue Number System
- Contact author(s)
- shinichi2 kawamura @ toshiba co jp
- History
- 2016-03-10: received
- Short URL
- https://ia.cr/2016/266
- License
-
CC BY