Long word addition: A statistical approach for high speed arithmetic applications

Encryption algorithms need high performance computations based on large data width operators. Traditional improvements of the carry propagation delay have often implied increasing the silicon surface. This paper presents a formalized approach for arithmetic operators using large data width. We will focus on the arithmetic adder. Our approach uses a statistical evaluation of the carry propagation delay which is considered better than the critical path delay. The designed operator will be used to implement Modular Multiplication intended for RSA cryptography applications.