An Efficient Pipelined Technique for Signcryption Algorithms

Signcryption algorithms are based on public key cryptography. The main advantage of signcryption algorithms is to provide both confidentiality and authenticity in one step. Hence, signcryption algorithms lower both communication and computation overheads. This reduction, in communication and computation overheads, makes signcryption algorithms more suitable for realtime applications than other algorithms that combine encryption and digital signature in separate blocks. Although, the signcryption algorithms overcome the communication overhead problem, they still suffer from the need to perform arithmetic modular operations. The arithmetic modular operations have high computation overhead. In this paper, we use a pipelined technique to reduce the computation overhead of signcryption algorithms. We apply the proposed pipelined technique to Rasslan et. al signcryption algorithm. The proposed pipelined technique is suitable for the selected signcryption algorithm. Rasslan et. al. signcryption algorithm is more efficient than all the previously presented algorithms. Rasslan et. al. signcryption algorithm allows the recipient to recover the message blocks upon receiving their corresponding signature blocks. This makes Rasslan et. al signcryption algorithm perfect for some real-time applications. Also, we illustrate the performance analysis of the proposed solution. The performance analysis shows that the proposed technique reduces the computation time required to execute Rasslan et. al. signcryption algorithm with respect to its corresponding values of sequential execution.