Nahum, E., et at., "Towards High Performance Cryptographic Software", Proceedings of the Third IEEE Workshop on the Architecture and Implementation of High Performance Communications Subsystems (HPCS '95), August 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....In addition, the computation associated with many cryptographic protocols is highly parallelizable. When performing encryption or message authentication, a multiprocessor system can achieve nearly linear speedup by assigning individual packets or connections to single processing elements [15] [16]. In this paper, we investigate the performance benefit of compressing IP packet payloads when using IPsec to implement a virtual private network. We restrict our investigation to the performance impact of compression on bulk data encryption and message authentication. Data compression does not ....

Nahum, E., et at., "Towards High Performance Cryptographic Software", Proceedings of the Third IEEE Workshop on the Architecture and Implementation of High Performance Communications Subsystems (HPCS '95), August 1995.

....feedback on how our security mechanisms work in practical situations. It seems certain that encryption performance will be a bottleneck in many situations. Hence, we will experiment with various performance enhancement techniques, including specialized protocols [1] parallel encryption algorithms [20, 21], and use of dedicated encryption processors. Another interesting direction for further work will be to investigate the feasibility of using the Nexus resource database to determine when secure communication mechanisms must be employed, for example because communication occurs over insecure ....

E. Nahum, S. O'Malley, H. Orman, and R. Schroeppel. Towards high performance cryptographic software. In 3rd IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems, 1995.

....feedback on how our security mechanisms work in practical situations. It seems certain that encryption performance will be a bottleneck in many situations. Hence, we will experiment with various performance enhancement techniques, including specialized protocols [1] parallel encryption algorithms [22, 23], and use of dedicated encryption processors. Another interesting direction for further work will be to investigate the feasibility of using the Metacomputing Directory Service to determine when secure communication mechanisms must be employed, for example because communication occurs over ....

E. Nahum, S. O'Malley, H. Orman, and R. Schroeppel. Towards high performance cryptographic software. In 3rd IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems, 1995.

....MD5 and IDEA, are designed to run quickly in software on current microprocessor architectures. Specialized hardware for these algorithms may not improve performance much. Touch [118] gives an analysis of this for MD5. Many approaches are available for improving software based cryptographic support [85], including improved algorithm design and algorithm independent hardware support. In this chapter, we demonstrate how parallelism can improve software cryptographic performance for secure servers. We show that parallelism is an effective vehicle for improving software cryptographic performance, ....

Nahum, E., O'Malley, S., Orman, H., and Schroeppel, R. Towards highperformance cryptographic software. In Proceedings of the Third IEEE Workshop on the Architecture and Implementation of High Performance Communications Subsystems (HPCS), Mystic, Conn, Aug. 1995.

....algorithms, such as MD5 and IDEA, are designed to run quickly in software on current microprocessor architectures. Specialized hardware for them may not improve performance much. An analysis of this is given for MD5 [37] Many approaches are available for improving software cryptographic support [23], including improved algorithm design and algorithm independenthardware support. In this paper, we focus on how parallelism can improve software cryptographic performance. A common approach to parallelism is through symmetric shared memory multiprocessors. These machines are becoming more common, ....

E. Nahum, S. O'Malley, H. Orman, and R. Schroeppel. Towards high-performance cryptographic software. In Proceedings of the Third IEEE Workshop on the Architecture and Implementation of High Performance Communications Subsystems (HPCS), Mystic, Conn, Aug. 1995.

....issues and how parallelism can be used for secure connection establishment. For example, Diffie Hellman key exchange is typically used to produce a private key for a particular connection. However, current implementations of this algorithm can only exchange 5 keys second on a 175 MHz Alpha [2]. This is clearly insufficient for businesses wishing to conduct large numbers of secure transactions electronically. Memory Reference Behavior of Network Protocols. By evaluating parallelism on a number of different platforms, I found that speedup was more difficult to obtain on faster machines. ....

Erich Nahum, Sean O'Malley, Hilarie Orman, and Richard Schroeppel. Towards high-performance cryptographic software. In Proceedings of the Third IEEE Workshop on the Architecture and Implementation of High Performance Communications Subsystems (HPCS), Mystic, Conn, August 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC