Go home now Header Background Image
Search
Submission Procedure
share: |
 
Follow us
 
 
 
 
Volume 19 / Issue 16

available in:   PDF (151 kB) PS (275 kB)
 
get:  
Similar Docs BibTeX   Write a comment
  
get:  
Links into Future
 
DOI:   10.3217/jucs-019-16-2368

 

Multiplication and Squaring with Shifting Primes on OpenRISC Processors with Hardware Multiplier

Leandro Marin (University of Murcia, Spain)

Antonio J. Jara (University of Murcia, Spain)

Antonio F. Skarmeta (University of Murcia, Spain)

Abstract: Cryptographic primitives are the key component in the security protocols to support the authentication, key management and secure communication establishment. For that reason, this work presents the optimization of the Elliptic Curve Cryptography through the usage of Shifting Primes for constrained devices. Specifically, this presents the optimization for the chipsets JN51XX from NXP/Jennic, which are based on OpenRISC architecture and offer a class-2 constrained device. In details, Shifting Primes features have allowed to optimize the multiplication and squaring through a double accumulator and shifting reduction. This work is ancillary to the previous works about optimization of Shifting Primes for class-1 constrained devices. The optimization of the Elliptic Curve Cryptography for the class-2 constrained devices brings several opportunities for realistic scenarios, where the security interoperability between a gateway (class-2 device) and end-nodes (class 1 devices) is a major requirement.

Keywords: Internet of Things, OpenRISC, Security GT, Shifting Primes,, lliptic Curve Cryptography

Categories: B.2.1, B.4.1, E.3, G.1.1