Adaptive loops with kaapi on multicore and grid: applications in symmetric cryptography
Proceedings of the 2007 international workshop on Parallel symbolic computation
Processor-Oblivious Parallel Stream Computations
PDP '08 Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Design of a parallel AES for graphics hardware using the CUDA framework
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
RouteBricks: exploiting parallelism to scale software routers
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Improved Forwarding Architecture and Resource Management for Multi-Core Software Routers
NPC '09 Proceedings of the 2009 Sixth IFIP International Conference on Network and Parallel Computing
Solving bivariate polynomial systems on a GPU
ACM Communications in Computer Algebra
Hi-index | 0.00 |
In this work we study the feasibility of high-bandwidth, secure communications on generic machines equipped with the latest CPUs and General-Purpose Graphical Processing Units (GPGPU). We first analyze the suitability of current Nehalem CPU architectures. We show in particular that high performance CPUs are not sufficient by themselves to reach our performance objectives, and that encryption is the main bottleneck. Therefore we also consider the use of GPGPU, and more particularly we measure the bandwidth of the AES ciphering on CUDA. These tests lead us to the conclusion that finding an appropriate solution is extremely difficult.