%0 Conference Proceedings
%T Shifting Primes: Extension of Pseudo-Mersenne Primes to Optimize ECC for MSP430-Based Future Internet of Things Devices
%+ Universidad de Murcia
%A Marin, Leandro
%A Jara, Antonio, J.
%A Skarmeta, Antonio
%Z Part 2: Workshop
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 1st Availability, Reliability and Security (CD-ARES)
%C Vienna, Austria
%Y A Min Tjoa
%Y Gerald Quirchmayr
%Y Ilsun You
%Y Lida Xu
%I Springer
%3 Availability, Reliability and Security for Business, Enterprise and Health Information Systems
%V LNCS-6908
%P 205-219
%8 2011-08-22
%D 2011
%R 10.1007/978-3-642-23300-5_16
%K Security
%K 6LoWPAN
%K ECC
%K pseudo-Mersenne primes
%K shifting prime
%K Internet of Things
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X Security support for small and smart devices is one of the most important issues in the Future Internet of things, since technologies such as 6LoWPAN are opening the access to the real world through Internet. 6LoWPAN devices are highly constrained in terms of computational capabilities, memory, communication bandwidth, and battery power. Therefore, in order to support security, it is necessary to implement new optimized and scalable cryptographic mechanisms, which provide security, authentication, privacy and integrity to the communications. Our research is focused on the mathematical optimization of cryptographic primitives for Public Key Cryptography (PKC) based on Elliptic Curve Cryptography (ECC) for 6LoWPAN. Specifically, the contribution presented is a set of mathematical optimizations and its implementation for ECC in the 6LoWPAN devices based on the microprocessor Texas Instrument MSP430. The optimizations presented are focused on Montgomery multiplication operation, which has been implemented with bit shifting, and the definition of special pseudo-Mersenne primes, which we have denominated ”shifting primes”. These optimizations allow to implement the scalar multiplication (operation used for ECC operations) reaching a time of 1,2665 seconds, which is 42,8% lower of the reached by the state of the art solution TinyECC (2,217 seconds).
%G English
%Z TC 8
%Z WG 8.4
%Z WG 8.9
%2 https://inria.hal.science/hal-01590400/document
%2 https://inria.hal.science/hal-01590400/file/978-3-642-23300-5_16_Chapter.pdf
%L hal-01590400
%U https://inria.hal.science/hal-01590400
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC8
%~ IFIP-CD-ARES
%~ IFIP-WG8-4
%~ IFIP-WG8-9
%~ IFIP-LNCS-6908