Exact Error Bound of Cox-Rower Architecture for RNS Arithmetic

Shinichi Kawamura; Tomoko Yonemura; Yuichi Komano; Hideo Shimizu

Paper 2016/266 Original: eprint.iacr.org/2016/266 ↗

Exact Error Bound of Cox-Rower Architecture for RNS Arithmetic

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.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Preprint.
History: 2016-03-10: last updated; 2016-03-10: published
Short URL: https://ia.cr/2016/266
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2016/266,
      author = {Shinichi Kawamura and Tomoko Yonemura and Yuichi Komano and Hideo Shimizu},
      title = {Exact Error Bound of Cox-Rower Architecture for RNS Arithmetic},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/266},
      year = {2016},
      url = {https://eprint.iacr.org/2016/266}
}