A low-complexity combinatorial RNS multiplier

DOI10.1109/82.958337zbMath1011.94031OpenAlexW2162650663MaRDI QIDQ4553208

Konstantina Karagianni, Vassilis Paliouras, Thanos Stouraitis

Publication date: 25 November 2002

Published in: IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/82.958337

zbMATH Keywords

multiplicationdigital signal processing applicationsresidue arithmeticdigital arithmeticvery large-scale integration

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Analytic circuit theory (94C05) Congruences; primitive roots; residue systems (11A07) Mathematical problems of computer architecture (68M07)

Related Items (1)

Efficient hardware implementation of finite fields with applications to cryptography

This page was built for publication: A low-complexity combinatorial RNS multiplier