Title :
Residue number systems: a key to parallelism in public key cryptography
Author :
Posch, K.C. ; Posch, R.
Author_Institution :
Inst. for Appl. Inf. Process., Graz Univ. of Technol., Austria
Abstract :
Public key cryptography and parallel algorithms are considered. Special attention is paid to algorithms using long integer modulo arithmetic. A modification of the commonly known RSA algorithm is taken as a candidate. So far all implementations have been more or less sequential in the sense that no partitions of a long integer among various processing elements have been performed. The proposed approach allows the use of a dedicated processor for each group of about 30 to 50 bits of a long integer. Efficiency is primarily gained when special-purpose processors are used. In this regard this work is the basis of a VLSI approach to a multiprocessor-based cryptographic design with 15 to 100 processors involved
Keywords :
digital arithmetic; parallel algorithms; public key cryptography; RSA algorithm; VLSI approach; dedicated processor; long integer modulo arithmetic; multiprocessor-based cryptographic design; parallel algorithms; parallelism; public key cryptography; residue number systems; Arithmetic; Delay; Information processing; Information representation; Parallel algorithms; Partitioning algorithms; Public key cryptography; Very large scale integration;
Conference_Titel :
Parallel and Distributed Processing, 1992. Proceedings of the Fourth IEEE Symposium on
Conference_Location :
Arlington, TX
Print_ISBN :
0-8186-3200-3
DOI :
10.1109/SPDP.1992.242713