A detailed Analysis of Lightweight Cryptographic techniques on Internet-of-Things

Multi-stage cryptography technique for wireless networks

“…Scientists introduced two algorithms to analyze mathematical problems, polynomial and exponential. These two algorithms are used to analyze the difficulty level of any cryptosystem's algorithms where complicated equations equate with exponential and easy ones with polynomial [21]. It was found that the best algorithm formed so far to solve the hard mathematical problems in ECC takes full exponential time.…”

“…Based on that, ECC can achieve a higher security level with fewer parameters compared with RSA and DSA [19]- [23]. For example, for an ECC system to have the same security as 1,024-bit RSA or DSA system, it will require only 160-bit [21]- [23]. ECC could be implemented either using a discrete logarithm problem or by using points on an elliptic curve.…”

“…Elliptic curves graphs. On the left, y2=x3−4x+1 and on the right y2=x3−5x+5 [21] Pursuing this further, by using the scale point multiplication of a starting point on an elliptic graph (P) and a positive integer value (k) as in k.P, this will result in a new point on the elliptic curve and will repeated the process n times, which is the private key value. Moving to the implementation of ECC using discrete logarithmic problems, with the aid of (1), a point on the curve can be generated by substituting a and b in ( 1) and (2).…”

“…The point chosen on the elliptic curve has to be delicately chosen such that when added to itself multiple times generates as many new points as possible before going in a loop of pre-generated points. In general, a very extensive literature has analyzed several approaches using an elliptic curve in securing data [21]- [25].…”