Performance analysis of speck cipher using different adder architectures

Abstract

This paper explores the performance of speck cipher based on different adder structures and is implemented incorporating two architectures namely folded (round based) and unfolded. Folded architecture reduces huge areas at the cost of an increment in delay which can be negligible when the area is primary metric. VLSI implementations show that Kogge–Stone tree has delay improvement in the range of (6.31–29.28)% at the cost of an increment in the area by (22.03–30.44)% when compared with the Sklansky tree, whereas Han-Carlson tree when compared with Sklansky tree, achieves an improvement in the delay for about (2.24–22.16)% at the cost of an increment in the area less than 5%.