CryptoGraphics: Secret Key Cryptography Using Graphics Cards
Department of Computer Science, Columbia University, New York, New York, United StatesDOI: 10.1007/978-3-540-30574-3_23 Conference: Topics in Cryptology - CT-RSA 2005, The Cryptographers' Track at the RSA Conference 2005, San Francisco, CA, USA, February 14-18, 2005, Proceedings
We study the feasibility of using Graphics Processing Units (GPUs) for cryptographic processing, by exploiting the ability for GPUs to simultaneously process large quantities of pixels, to offload symmetric key encryption from the main processor. We demonstrate the use of GPUs for applying the key stream when using stream ciphers. We also investigate the use of GPUs for block ciphers, discuss operations that make certain ciphers unsuitable for use with a GPU, and compare the performance of an OpenGL-based implementation of AES with implementations utilizing general CPUs. While we conclude that existing symmetric key ciphers are not suitable for implementation within a GPU given present APIs, we discuss the applicability of moving encryption and decryption into the GPU to image processing, including the handling of displays in thin-client applications and streaming video, in scenarios in which it is desired to limit exposure of the plaintext to within the GPU on untrusted clients.
Full-text previewDOI: · Available from: columbia.edu
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.
[Show abstract] [Hide abstract]
- "Any change in the rule set requires the recompilation and regeneration of the automation, and resynthesis, replacement, and routing of the circuits, which are time-consuming and difficult procedures. Network processor architecture is used to pipeline the processing stages and the entire implementation of an NIDS on a processor  . In addition, network processor clusters were proposed to process intrusion detection by using numerous processors in parallel . "
ABSTRACT: In the past few years, the increase in interest usage has been substantial. The high network bandwidth speed and the large amount of threats pose challenges to current network intrusion detection systems, which manage high amounts of network traffic and perform complicated packet processing. Pattern matching is a computationally intensive process included in network intrusion detection systems. In this paper, we present an efficient graphics processing unit (GPU)-based network packet pattern-matching algorithm by leveraging the computational power of GPUs to accelerate pattern-matching operations and subsequently increase the overall processing throughput. According to the experimental results, the proposed algorithm achieved a maximal traffic processing throughput of over 2 Gbit/s. The results demonstrate that the proposed GPU-based algorithm can effectively enhance the performance of network intrusion detection systems.
- "According to design of FPGA, performance of encryption request at hardware is calculated. According to analysis mentioned in ,  , , ,  "
Conference Paper: Multilevel Cryptography Scheduler[Show abstract] [Hide abstract]
ABSTRACT: Cryptographic transformations are a fundamental building block in many security applications and protocols. To improve performance, several vendors market hardware accelerator cards. However, until now no operating system provided a mechanism that allowed both uniform and efficient use of this new type of resource. We have implemented the operating system service in Windows environment as Scheduler which automatically starts when operating system boots. As system always gives priority to hardware, kernel and applications in order, we have designed the scheduler which schedules the encryption requests at hardware, kernel and application level respectively. When request for encryption comes to scheduler, it schedules the requests at hardware, kernel and application level services in order and also according to availability. It is proved that the scheduler is able to save CPU utilization by scheduling the encryption request for AES, RSA and SHA1 at three levels. It is also proved that the developed system is reliable in case of any failure in hardware, as it proceeds by scheduling the load at kernel and application level processes. It also proved that the performance of AES is very fast at hardware level, performance of SHA1 is uniform at all three levels comparatively and performance of RSA is very low at application and kernel level as compared to AES and SHA1.
[Show abstract] [Hide abstract]
- "In addition to the special registers, implementers have considered other attached hardware for cryptographic use. For example, some display adapters possess considerable computing power, although implementers have had mixed success in adapting their instruction set and interface for cryptographic use  . Hardware targeted to cryptography has usually been an add-on, but the recent UltraSPARC T2 from Sun Microsystems may be a harbinger of widespread onchip cryptographic hardware on common systems. "
ABSTRACT: This chapter describes and compares the software implemen-tation of popular elliptic curve pairings on two architectures, of which the Intel Pentium 4 and Core2 are representatives.