Skip to Main content Skip to Navigation
Journal articles

An Alternative Approach to Polynomial Modular Number System Internal Reduction

Abstract : The Polynomial Modular Number System (PMNS) is an alternative to the binary multi-precision representation that allows to transport the arithmetic of a finite field to a polynomial ring. The most important operation in that system is the internal reduction that follows any arithmetic operation. All recent works on the subject use the same algorithm derived from Montgomery's modular multiplications to perform this internal reduction. This paper designs and analyzes two new algorithms to perform the internal reduction, both based on Babai's Closest Vector algorithms. It allows to significantly reduce the number of additions needed to perform this operation. A comprehensive experimental analysis shows that one of those algorithms is also faster in practice. For that matter, a C code generation tool has been developed in order to produce implementations for any prime number field.
Complete list of metadata

https://hal-univ-tln.archives-ouvertes.fr/hal-03635347
Contributor : Nicolas Méloni Connect in order to contact the contributor
Submitted on : Wednesday, June 8, 2022 - 9:12:33 AM
Last modification on : Thursday, August 25, 2022 - 10:24:06 AM

File

pmns_babai_major_revision.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Nicolas Méloni. An Alternative Approach to Polynomial Modular Number System Internal Reduction. IEEE Transactions on Emerging Topics in Computing, Institute of Electrical and Electronics Engineers, 2022, ⟨10.1109/TETC.2022.3190368⟩. ⟨hal-03635347v2⟩

Share

Metrics

Record views

48

Files downloads

32