Performance Comparison of Signcryption Schemes – A Step towards Designing Lightweight Cryptographic Mechanism
Anuj Kumar Singh, B. D. K. Patro · International Journal of Engineering and Technology · 2017
With the advancement of technology and use of heterogeneous devices in today's communication, computing has become ubiquitous involving devices that are low on computing power and therefore securing communication is necessary in this type of environment.The fundamental security attributes which any system must have includes confidentiality, integrity, authentication and nonrepudiation.Signcryption is a new way to achieve confidentiality and authentication simultaneously.Before the advent of signcryption the approach was to first encrypt and then to sign the message, but this scheme had more computational cost and communication overhead.Many signcryption schemes have been developed and implemented so far, but differ in security attributes they provide and computational cost they incur.The strength of these schemes depend upon the difficulty of solving any one problem namely IFP (Integer Factorization Problem), (DLP) Discrete Logarithmic Problem, ECDLP (Elliptic Curve Discrete Logarithmic Problem) or Bilinear Diffie Hellman Problem.This paper analyzes and compares the performance of various signcryption schemes in terms of security attributes and computational cost they take.This analysis provides a way to design Lightweight Cryptographic Mechanism suitable for low computing environments.The last section of the paper provides a generic approach for designing lightweight cryptographic mechanism.