The primary purpose of parallel computation is the fast execution of computational tasks that are too slow to perform sequentially. However, it was shown recently that a second equally important motivation for using parallel computers exists: Within the paradigm of real-time computation, some classes of problems have the property that a solution to a problem in the class computed in parallel is better than the one obtained on a sequential computer. What constitutes a better solution depends on the problem under consideration. Thus, for optimization problems, `better' means `closer to optimal'. The present paper continues this line of inquiry by exploring another class enjoying the aforementioned property, namely, cryptographic problems in a real-time setting. In this class, `better' means `more secure'. A real-time cryptographic problem is presented for which the parallel solution is signi cantly better than a sequential one. Key words and phrases: Parallelism, rea...
Selim G. Akl, Stefan D. Bruda