Arithmetic Operations in the Polynomial Modular Number System - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2005

Arithmetic Operations in the Polynomial Modular Number System

Abstract

We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polynomial arithmetic and easy parallelization. The most important contribution of this paper is the fundamental theorem of a Modular Number System, which provides a bound for the coefficients of the polynomials used to represent the set Zp. However, we also propose a complete set of algorithms to perform the arithmetic operations over a PMNS, which make this system of practical interest for people concerned about efficient implementation of modular arithmetic.
No file

Dates and versions

lirmm-00387051 , version 1 (22-05-2009)

Identifiers

  • HAL Id : lirmm-00387051 , version 1

Cite

Jean-Claude Bajard, Laurent Imbert, Thomas Plantard. Arithmetic Operations in the Polynomial Modular Number System. ARITH'05: 17th IEEE Symposium on Computer Arithmetic, 2005, USA, pp.206-213. ⟨lirmm-00387051⟩
223 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More