Modular multiplication using the core function in the residue number system

DOI10.1007/S00200-015-0268-1zbMath1342.68031OpenAlexW933374218MaRDI QIDQ2634582

Yinan Kong, Shahzad Asif, Mohammad A. U. Khan

Publication date: 16 February 2016

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-015-0268-1

zbMATH Keywords

residue number systemmodular multiplicationcore functiondigital arithmetic

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Related Items (3)

Highly parallel modular multiplier for elliptic curve cryptography in residue number system ⋮ Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system ⋮ An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code

Cites Work

• Highly parallel modular multiplication in the residue number system using sum of residues reduction
• A Two's Complement Parallel Array Multiplication Algorithm
• The application of core functions to residue number systems
• Majority Gate Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Modular multiplication using the core function in the residue number system