Leandro Marín

Optimized ECC Implementation for Secure Communication between Heterogeneous IoT Devices

The Internet of Things is integrating information systems, places, users and billions of constrained devices into one global network. This network requires secure and private means of communications. The building blocks of the Internet of Things are devices manufactured by various producers and are designed to fulfil different needs. There would be no common hardware platform that could be applied in every scenario. In such a heterogeneous environment, there is a strong need for the optimization of interoperable security. We present optimized elliptic curve Cryptography algorithms that address the security issues in the heterogeneous IoT networks. We have combined cryptographic algorithms for the NXP/Jennic 5148- and MSP430-based IoT devices and used them to created novel key negotiation protocol.

DCapBAC: embedding authorization logic into smart things through ECC optimizations

In recent years, the increasing development of wireless communication technologies and IPv6 is enabling a seamless integration of smart objects into the Internet infrastructure. This extension of technology to common environments demands greater security restrictions, since any unexpected information leakage or illegitimate access to data could present a high impact in our lives. Additionally, the application of standard security and access control mechanisms to these emerging ecosystems has to face new challenges due to the inherent nature and constraints of devices and networks which make up this novel landscape. While these challenges have been usually addressed by centralized approaches, in this work we present a set of Elliptic Curve Cryptography optimizations for point and field arithmetic which are used in the design and implementation of a security and capability-based access control mechanism (DCapBAC) on smart objects. Our integral solution is based on a lightweight and flexible design that allows this functionality is embedded on resource-constrained devices, providing the advantages of a distributed security approach for Internet of Things (IoT) in terms of scalability, interoperability and end-to-end security. Additionally, our scheme has been successfully validated by using AVISPA tool and implemented on a real scenario over the Jennic/NXP JN5148 chipset based on a 32-bit RISC CPU. The results demonstrate the feasibility of our work and show DCapBAC as a promising approach to be considered as security solution for IoT scenarios.

Morita equivalence based on contexts for various categories of modules over associative rings

In this paper we consider the subcategories CMod-R (M ∈ MOD-R s.t. M ∼- HomR(R, M)) and DMod-R (M ∈ MOD-R s.t. M ⊗R R ∼- R) of the category of all right R-modules, MOD-R, for an associative ring R, possibly without identity. If R and S are associative rings and we have a Morita context between R and S with epimorphic pairings, it can be deduced from [6, 8] that the induced functors provide equivalences CMod-R ∼- CMod-S R-CMod ∼- S-CMod, DMod-R ∼- DMod-S R-DMod ∼- S-DMod. We find hypotheses weaker than the surjectivity that let us prove also a converse of this result. As a consequence, we give an example of a ring R such that CMod-R is not equivalent to DMod-R.

Rings having a morita-like equivalence

The notion of Morita-like equivalence has been introduced by Xu, Shum and Turner-Smith in [13]. Their definition extends the usual Morita equivalence for unital rings to a wider subclass of the class of all(non-unital)associative rings, namely the xst-rings. We study here this class of rings, showing its strong connections to other known classes of rings(s-unital rings, local right identity rings, idempotent rings)and giving a complete description of xst-rings in terms of these known classes. We also show that right xst-rings which are Morita-like equivalent to unital rings come from dense subrings of the endomorphism ring End( AM)of some generator module AM over a unital ring A.

Shifting Primes: Optimizing Elliptic Curve Cryptography for Smart Things

The new generation of devices connected to Internet are moving towards billion of small and smart objects, so-called Smart Things. These Smart Things are destined to manage the security of our houses, watch our health, and optimize the energy consumption of our cities. They bring a new set of opportunities, but they also present high challenges regarding scalability, management, bootstrapping, identity verification and authentication. For that reason, this work is focused on addressing the security requirements for Smart Things providing an optimized family of primes for Elliptic Curve Cryptography(ECC), denominated Shifting Primes. ECC on Smart Things needs special optimizations for the cryptographic primitives that requires a precise study of the instruction set and the number of cycles for those instructions. The modular multiplication is the basic operation, critical for highly constrained microprocessors, in terms of which ECC is built. It is optimized and also analyzed the interaction between partial results in the chain of modular multiplications needed for ECC. This optimizations have been carried out over the MSP430, which is a widely extended microprocessor for Smart Things. MSP430 is featured by not offering hardware multiplier. For that reason, we have defined a special kind of prime numbers, the Shifting Primes. They are featured by offering a very fast multiplication algorithm for ECC through addition and shifting operations for the multiplications. It is presented the full faster multiplication algorithm for Shifting Primes. These results are presenting a lowest time and number of operations for the multiplication in ECC than the existing solutions. Finally, note that the presented primes can be applied also to other similar architectures with fast shifting operation on registers.

WATTS THEOREMS FOR ASSOCIATIVE RINGS

Let R be an associative ring. In this paper we consider the category CMod-R of right R-modules M such that M ≃ Hom R (R, M) and the category DMod-R of right R-modules M such that M ⊗ R R ≃ M. Given two associative rings R and R′, we study the functors F : CMod-R → CMod-R′ that can be written as Hom R (P, −) and the functors G : DMod-R → DMod-R′ that can be written as – ⊗ R Q and we give some results that extend the known Watts theorems for rings with identity to associative rings that need not be unital.

YOAPY: a data aggregation and pre-processing module for enabling continuous healthcare monitoring in the internet of things

Wireless transmissions of continuous vital signs are gaining importance for providing rich patient-care data in ambient assisted living environments, these monitoring systems are moving towards the Internet of Things, which offers a global and end-to-end connectivity with technologies such as 6LoWPAN. This work analyzes the requirements to transmit the continuous vital sign from an electrocardiogram to a remote server. Specifically, this presents the impact from the security in the performance, in issues such as overload, latency, and power consumption i.e. patient monitoring system lifetime, for different cryptographic primitives. For that reason, a pre-processing module is also proposed, denominated YOAPY, to reach a trade-off among the requirements from the continuous vital signs data transmission, security/privacy level, and lifetime.

Mobility Modeling and Security Validation of a Mobility Management Scheme Based on ECC for IP-based Wireless Sensor Networks (6LoWPAN)

Future Internet of Things requires mobility support for extending and adapting the network to changes of location and infrastructure, increases the fault tolerance capacity, connectivity, dependability and scalability. The current Future Internet architectures are based on ID/Locator split to support the mobility, but these approaches are not, on the one hand, considering the security needs for the mobility management, presenting the majority of the defined solutions several vulnerabilities and security challenges, and on the other hand, considering the requirements and constrains from the Future Internet of Things technologies such as IP-Based Wireless Sensor Networks (6LoWPAN). Hence, secure mobility management support for the Future Internet of Things is necessary. This paper proposes a trust extension protocol for mobility management based on an extension of Return Rout ability with Diffie-Hellman key agreement and Elliptic Curve Cryptography, which has been defined and optimized for the mentioned requirements, constrains and capacity of the Internet of Things architecture. The proposed scheme has been verified and evaluated successfully with the AVISPA tool.

MORITA THEORY FOR ASSOCIATIVE RINGS

In this paper we develop a Morita theory for associative rings without identity using the categories CMod-R of modules M such that M ≃ Hom(R,M) and DMod-R of modules M such that M ⊗ R ≃ M. This extends the main results of Morita theory to a wide class of rings, that properly includes the idempotent rings.

Shifting primes on OpenRISC processors with hardware multiplier

Shifting primes have proved its efficiency in CPUs without hardware multiplier such as the located at the MSP430 from Texas Instruments. This work analyzes and presents the advantages of the shifting primes for CPUs with hardware multiplier such as the JN5139 from NXP/Jennic based on an OpenRISC architecture. This analysis is motivated because Internet of Things is presenting several solutions and use cases where the integrated sensors and actuators are sometimes enabled with higher capabilities. This work has concluded that shifting primes are offering advantages with respect to other kind of primes for both with and without hardware multiplier. Thereby, offering a suitable cryptography primitives based on Elliptic Curve Cryptography (ECC) for the different families of chips used in the Internet of Things solutions. Specifically, this presents the guidelines to optimize the implementation of ECC when it is presented a limited number of registers.