-
[show abstract]
[hide abstract]
ABSTRACT: The hash algorithm forms the basis of many popular cryptographic protocols and it is therefore important to find throughput
optimal implementations. Though there have been numerous published papers proposing high throughput architectures, none of
them have claimed to be optimal. In this paper, we perform iteration bound analysis on the SHA2 family of hash algorithms.
Using this technique, we are able to both calculate the theoretical maximum throughput and determine the architecture that
achieves this throughput. In addition to providing the throughput optimal architecture for SHA2, the techniques presented
can also be used to analyze and design optimal architectures for some other iterative hash algorithms.
KeywordsSHA-256 (384;512)-Iteration Bound Analysis-Throughput Optimum Architecture
01/2008: pages 102-114;
-
Signal Processing Systems. 01/2008; 53:89-102.
-
Information Security Applications, 8th International Workshop, WISA 2007, Jeju Island, Korea, August 27-29, 2007, Revised Selected Papers; 01/2007
-
2006 IEEE International Conference on Application-Specific Systems, Architecture and Processors (ASAP 2006), 11-13 September 2006, Steamboat Springs, Colorado, USA; 01/2006
-
Proceedings of the 2006 International Conference on Engineering of Reconfigurable Systems & Algorithms, ERSA 2006, Las Vegas, Nevada, USA, June 26-29, 2006; 01/2006
-
2006 IEEE International Conference on Application-Specific Systems, Architecture and Processors (ASAP 2006), 11-13 September 2006, Steamboat Springs, Colorado, USA; 01/2006
-
[show abstract]
[hide abstract]
ABSTRACT: This paper describes a working implementation of a streaming encryption system for optical networks. The 10 Gbps data stream is encrypted on the physical level in both the wavelength and time domains. Security is obtained by applying a strong pseudo-random hopping pattern to both. The AES algorithm in counter mode is used to control the switches that implement the hopping permutations. Because of the high throughput requirements, aggressive parallelizing and pipelining techniques are used to achieve data rates of 10 Gbps.
03/2004;
-
International Conference on Information Technology: Coding and Computing (ITCC'04), Volume 2, April 5-7, 2004, Las Vegas, Nevada, USA; 01/2004
-
[show abstract]
[hide abstract]
ABSTRACT: This paper presents nonlinear trellis codes that produce codewords with a relatively low density of ones. These trellis codes are designed specifi-cally for the Z-Channel that arises in a multiple-user optical channel with non-coherent combining, when the other users are treated as noise. In con-junction with interleaver-division multiple access, these trellis codes provide a relatively low com-plexity solution for uncoordinated access in the optical multiple-user environment. Also, a union bound technique that predicts the performance of these codes is presented. An implementation on an FPGA is described and results are shown.