Multiple-radix arithmetic on parallel machines and applications to cryptology

The multiple-radix representation of integers is a candidate for improving computations involving large integers using parallel processors. Results are found for efficiently comparing two numbers in multiple-radix form, and also for reducing one number modulo a fixed number in multiple-radix form. Results of the implementations of these methods, and of their applications to cryptology, on the CM-2 Connection Machine are discussed.<
>