Implementation and Evaluation of BSD Elliptic Curve Cryptography

نویسنده

  • Oriol Piñol Piñol
چکیده

Security is recently arising as an important issue for the Internet of Things (IoT). Efficient ways to provide secure communication between devices and sensors is crucial for the IoT devices, which are becoming more and more used and spread in a variety of fields. In this context, Elliptic Curve Cryptography (ECC) is considered as a strong candidate to provide security while being able to be functional in an environment with strong requirements and limitations such as wireless sensor networks (WSN). The solutions used need to be efficient for devices that have some important restrictions on memory availability and battery life. In this master thesis we present a lightweight BSD-based implementation of the Elliptic Curve Cryptography (ECC) for the Contiki OS and its evaluation. We show the feasibility of the implementation and use of this cryptography in the IoT by a thorough evaluation of the solution by analyzing the performance using different implementations and optimizations of the used algorithms, and also by evaluating it in a real hardware environment. The evaluation of ECC shows that it can adapt to the upcoming challenges, thanks to the level of security that it provides with a smaller size of keys when compared to other legacy cryptography schemes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The new protocol blind digital signature based on the discrete logarithm problem on elliptic curve

In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind  digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

Elliptic Curve Algorithm Integration in the Secure Shell Transport Layer

This document describes algorithms based on Elliptic Curve Cryptography (ECC) for use within the Secure Shell (SSH) transport protocol. In particular, it specifies Elliptic Curve Diffie-Hellman (ECDH) key agreement, Elliptic Curve Menezes-Qu-Vanstone (ECMQV) key agreement, and Elliptic Curve Digital Signature Algorithm (ECDSA) for use in the SSH Transport Layer protocol. Status of This Memo Thi...

متن کامل

Integration in the Secure Shell Transport Layer

This document describes algorithms based on Elliptic Curve Cryptography (ECC) for use within the Secure Shell (SSH) transport protocol. In particular, it specifies Elliptic Curve Diffie-Hellman (ECDH) key agreement, Elliptic Curve Menezes-Qu-Vanstone (ECMQV) key agreement, and Elliptic Curve Digital Signature Algorithm (ECDSA) for use in the SSH Transport Layer protocol. Status of This Memo Thi...

متن کامل

Kato’s Euler System and the Mazur-tate Refined Conjecture of Bsd Type

Mazur and Tate proposed a conjecture which compares the Mordell-Weil rank of an elliptic curve overQwith the order of vanishing of Mazur-Tate elements, which are analogues of Stickelberger elements. Under some relatively mild assumptions, we prove this conjecture. Our strategy of the proof is to study divisibility of certain derivatives of Kato’s Euler system. CONTENTS

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014