VLSI implementation of the keyed-hash message authentication code for the wireless application protocol

Selimis, Georgios; Sklavos, Nicolas; Koufopavlou, O.

doi:10.1109/icecs.2003.1301967

Cited by 22 publications

(21 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The latter works are exploiting the characteristics of the SHA-1 hash function that requires a different non-linear function every 20 clock cycles (operations), assigning a pipeline stage to each round. Borrowing design elements from the implementations of [8] and [9], operation blocks are back rolled in a loop in order to minimize area requirements. This approach enables full operation of the four rounds in parallel and introduction of a 20 cycle latency to quadruple the throughput compared to [9].…”

Section: Insertion Of Pipeline Stagesmentioning

confidence: 99%

“…Borrowing design elements from the implementations of [8] and [9], operation blocks are back rolled in a loop in order to minimize area requirements. This approach enables full operation of the four rounds in parallel and introduction of a 20 cycle latency to quadruple the throughput compared to [9]. In [12,17] more or less the same main concept has been used in order to implement the SHA-1 hash function applying in various ways four pipeline stages.…”

Section: Insertion Of Pipeline Stagesmentioning

confidence: 99%

“…In [9] loop rolling was applied to the non-linear functions, exploiting the similarity of the rest of the operation block, as it is shown in Figure 2(a). Modifying the operation block to include the four non-linear functions, the non-linear function that corresponds to the time instance t is selected through a multiplexer.…”

Section: Loop Rollingmentioning

confidence: 99%

See 2 more Smart Citations

High-Speed FPGA Implementation of Secure Hash Algorithm for IPSec and VPN Applications

et al. 2006

View full text Add to dashboard Cite

Hash functions are special cryptographic algorithms, which are applied wherever message integrity and authentication are critical. Implementations of these functions are cryptographic primitives widely used in common cryptographic schemes and security protocols such as Internet Protocol Security (IPSec) and Virtual Private Network (VPN). In this paper, a novel FPGA implementation of the Secure Hash Algorithm 1 (SHA-1) is proposed. The proposed architecture exploits the benefits of pipeline and re-timing of execution through pre-computation of intermediate temporal values. Pipeline allows division of the calculation of the hash value in four discreet stages, corresponding to the four required rounds of the algorithm. Re-timing is based on the decomposition of the SHA-1 expression to separate information dependencies and independencies. This allows pre-computation of intermediate temporal values in parallel to the calculation of other independent values. Exploiting the information dependencies, the fundamental operational block of SHA-1 is modified so that maximum operation frequency is increased by 30% approximately with negligible area penalty compared to other academic and commercial implementations. The proposed SHA-1 hash function was prototyped and verified using a XILINX FPGA device. The implementation's characteristics are compared to alternative implementations proposed by the academia and the industry, which are available in the international IP market. The proposed implementation achieved a throughput that exceeded 2,5 Gbps, which is the highest among all similar IP cores for the targeted XILINX technology.

show abstract

Section: Insertion Of Pipeline Stagesmentioning

confidence: 99%

Section: Insertion Of Pipeline Stagesmentioning

confidence: 99%

See 1 more Smart Citation

High-Speed FPGA Implementation of Secure Hash Algorithm for IPSec and VPN Applications

et al. 2006

View full text Add to dashboard Cite

show abstract

“…The table shows that our design outperforms most of the other designs in speed. The only exceptions are the works of Selimis et al (2003) and Kitsos et al (2002). However, these two designs include only one hash function, whereas ours includes six integrated hash functions.…”

Section: Comparisonmentioning

confidence: 99%

“…Most of these works focus on HMAC-SHA-1 (McLoone and McCanny, 2002;Selimis et al, 2003). Some others implemented HMAC-MD5 and HMACSHA-1 (Haa et al, 2004;Lu and Lockwood, 2005;Wang et al, 2004).…”

Section: Introductionmentioning

confidence: 99%