P. Brisk, A. Kaplan, and M. Sarrafzadeh (USA)
Parallel Algorithms and Architectures, Parallel and Distributed Algorithms, Security and Reliability, Cryptography.
In this paper, we present the first theoretical study of the parallelism inherent in the Rijndael Advanced Encryption Standard (AES). We derive the asymptotic sequential runtime for the algorithm and describe two parallel implementations: one that is optimal in terms of time, and another that is optimal in terms of cost (the asymptotic product of time and number of processors required). The cost-optimal implementation sacrifices acceleration to reduce the number of processors required for encryption.
Important Links:
Go Back
