Distributed programming paradigms with cryptography applications
This monograph contains an exposition of the author's thesis work at Syracuse University. The work stems from the notion of a programming paradigm as a class of algorithms that solve different problems but have the same control structure. A parallel generic program is first written that implements the common control structure. A parallel application program is obtained by replacing the types and procedures to solve a particular problem. The monograph describes five parallel algorithms for RSA cryptosystems, including enciphering, deciphering, factorization and two methods for the generation of large primes. The parallel performance of these algorithms was tested on a Meiko Computing Surface with 48 T800 transputers. The work is a blend of the theory and practice of parallel computing. Of special note in the work is the development of a message block chaining technique (as compared to the more usual serial cipher block chaining) for RSA encipherment that allows fast encipherment and decipherment of message blocks on a parallel machine. In addition, a new deterministic primality testing algorithm is proposed for a particular class of large random integers. To achieve the results of the work, two programming paradigms were invented, the synchronized servers and the competing servers paradigms. The last one demonstrates that non-determinism is necessary for the efficient use of parallel computing in some applications. The work is essentially self contained and gives a clear exposition of the concepts involved.
This page was built for publication: Distributed programming paradigms with cryptography applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5906614)
