Software Implementation of Curve based Cryptography for Constrained Devices

Chatterjee, Kakali; Де, Асок; Gupta, Daya

doi:10.5120/2942-3914

Cited by 10 publications

(12 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To get an idea of the applicability of the algorithms based on elliptic curves on devices with computational constraints [31] argue that the efficiency of ECC cryptographic algorithm with key sizes of approximately 160 bits is the same obtained using the RSA algorithm with 1024 bit key. Algorithms several features are based on elliptic curves, including key management, encryption and digital signature.…”

Section: Ecc Algorithmmentioning

confidence: 99%

“…The HECC uses more complex operations, but works with smaller operands. According to Chatterjee [31] the hierarchy of operations in the HECC and ECC algorithms can be divided into three levels. The first level is the scalar multiplication on the second level are point operations group / splitter and the third level, finite field operations.…”

Section: Hecc Algorithmmentioning

confidence: 99%

“…[31] showed that in the encryption, the HECC reaches the same time of ECC using smaller keys. Regarding the time decrypting, the HECC always performed better.…”

Section: Algorithm 5: Non-linear Mapping P'mentioning

confidence: 99%

“…Only [36] and [31] presented a general analysis, comparison of ECC and HECC, which showed a trend of superiority of HECC on embedded systems. [31] showed that in the encryption, the HECC reaches the same time of ECC using smaller keys.…”

Section: Algorithm 5: Non-linear Mapping P'mentioning

confidence: 99%

“…The scalar multiplication of HECC is two times faster than ECC. [31] used the platform jdk1.6 in his assessment.…”

Section: Algorithm 5: Non-linear Mapping P'mentioning

confidence: 99%

See 4 more Smart Citations

Asymmetric Encryption in Wireless Sensor Networks

Quirino¹,

Ribeiro²,

Moreno³

2012

Wireless Sensor Networks - Technology and Protocols

View full text Add to dashboard Cite

Additional information is available at the end of the chapter http://dx.doi.org/10.5772/48464 IntroductionA Wireless Sensor Network (WSN) is composed of autonomous devices called sensor nodes that generally have low computational power, limited data transmission and power constraints. A WSN consists of sensor nodes that capturing information from an environment, processing data and transmitting them via radio signals. WSNs are increasingly present in our days and can be found in environmental area (climatic measurements, presence of smoke), in health area (measurement of vital signs, temperature), home automation (motion sensor and image sensor) and other areas. Generally, WSNs have no fixed structure, and in many cases there is no monitoring station of sensor nodes during the operational life of the network, so a WSN must have mechanisms for self-configuration and adaptation in case of failure, inclusion or exclusion of a sensor node. Security requirements of WSNs are similar to conventional computer networks, therefore parameters such as confidentiality, integrity, availability and authenticity must be taken into account in creation of a network environment. Due to limitations of WSNs, not all security solutions designed for conventional computer networks can be implemented directly in WSN. For a long time, it was believed that the public key cryptography was not suitable for WSNs because it was required high processing power, but through studies of encryption algorithms based on curves was verified the feasibility of that technique in WSN.The cryptographic algorithm RSA is currently the most used among the asymmetric algorithms, working from the difficulty of factoring large prime numbers. Standardized by NIST 1 , this algorithm is widely used in transactions on the Internet. The algorithms Elliptic / Hyperelliptic Curve Cryptography (ECC / HECC) were created in 80s, and are based on the difficulty of solving the discrete logarithm problem on elliptic curves and hyperelliptic respectively. Despite its complexity the algorithm based on elliptic and hyperelliptic curves have been extensively studied in academia. Recently, the public key algorithm called 1 U.S. Agency for technology that has a partnership with industry to develop and apply technology, measurements and standards. Further information: www.nist.gov

show abstract

Section: Ecc Algorithmmentioning

confidence: 99%

Section: Hecc Algorithmmentioning

confidence: 99%

“…[31] showed that in the encryption, the HECC reaches the same time of ECC using smaller keys. Regarding the time decrypting, the HECC always performed better.…”

Section: Algorithm 5: Non-linear Mapping P'mentioning

confidence: 99%