Efficient Hardware Operations for the Residue Number System by Boolean Minimization

DOI10.1007/978-3-030-20323-8_11MaRDI QIDQ6181737zbMATH OpenOpenAlexFDO

Authors Tiziano Villa

Publication date 23 January 2024

Published in Advanced Boolean Techniques (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.03083

zbMATH Keywords

Boolean minimizationcomputer arithmeticmodular multiplicationmodulo functionresidue number system

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Abstract: Residue number systems (RNS) represent numbers by their remainders modulo a set of relatively prime numbers. This paper pro- poses an efficient hardware implementation of modular multiplication and of the modulo function (X(mod P)), based on Boolean minimiza- tion. We report experiments showing a performance advantage up to 30 times for our approach vs. the results obtained by state-of-art industrial tools.

Recommendations

• Implementation schemes for basic modular operations
• Modular multiplication using the core function in the residue number system
• Highly parallel modular multiplication in the residue number system using sum of residues reduction
• Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system
• Parallel Processing and Applied Mathematics

Cites work

• A New Approach to the Design of Efficient Residue Generators for Arbitrary Moduli
• A universal architecture for designing efficient modulo 2/sup n/+1 multipliers
• Computers, software engineering and digital devices.
• Cryptographic Hardware and Embedded Systems - CHES 2004
• scientific article; zbMATH DE number 1122449 (Why is no real title available?)
• Modular Multiplication Without Trial Division
• Residue number systems. Theory and applications
• Residue number systems. Theory and implementation.

Cited in

(1)

• Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system

This page was built for publication: Efficient Hardware Operations for the Residue Number System by Boolean Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181737)