Arithmetic Operations in the Polynomial Modular Number System

Authors:
Jean-Claude Bajard;Thomas Plantard
Affiliations:
CNRS LIRMM UMR;CNRS LIRMM UMR
Venue:
ARITH '05 Proceedings of the 17th IEEE Symposium on Computer Arithmetic
Year:
2005

Citing 0
Cited 2

Low-Weight Polynomial Form Integers for Efficient Modular Multiplication

IEEE Transactions on Computers
Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation

ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

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 Z_p. 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.