Base extension using a convolution sum in residue number systems

DOI10.1007/BF02238608zbMath0796.68109OpenAlexW22972424MaRDI QIDQ2366292

K. C. Posch, R. Posch

Publication date: 29 June 1993

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02238608

zbMATH Keywords

distributed systemsparallel algorithmscomputer arithmeticbase extensionresidue number systemslong integer arithmetic

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Distributed algorithms (68W15)

Related Items (5)

Highly parallel modular multiplier for elliptic curve cryptography in residue number system ⋮ Division in residue number systems involving length indicators ⋮ Toward Acceleration of RSA Using 3D Graphics Hardware ⋮ Data-Driven Analysis Strategies for Proportion Studies in Adaptive Group Sequential Test Designs ⋮ A New Operator for Multi-addition Calculations

Cites Work

• Fast base extension using a redundant modulus in RNS
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Base extension using a convolution sum in residue number systems