Efficient java implementation of elliptic curve cryptography for J2ME-Enabled mobile devices

Authors:
Johann Großschädl;Dan Page;Stefan Tillich
Affiliations:
CSC Research Unit, LACS, University of Luxembourg, Luxembourg, Luxembourg;Department of Computer Science, University of Bristol, Bristol, U.K.;Department of Computer Science, University of Bristol, Bristol, U.K.
Venue:
WISTP'12 Proceedings of the 6th IFIP WG 11.2 international conference on Information Security Theory and Practice: security, privacy and trust in computing systems and ambient intelligent ecosystems
Year:
2012

Citing 15
Cited 0

Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor

Proceedings on Advances in cryptology---CRYPTO '86
Exponentiation cryptosystems on the IBM PC

IBM Systems Journal
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Compiling Java Just in Time

IEEE Micro
Faster Attacks on Elliptic Curve Cryptosystems

SAC '98 Proceedings of the Selected Areas in Cryptography
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
CM-Curves with Good Cryptographic Properties

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Securing Elliptic Curve Point Multiplication against Side-Channel Attacks

ISC '01 Proceedings of the 4th International Conference on Information Security
Hardware/software tradeoffs for increased performance

ASPLOS I Proceedings of the first international symposium on Architectural support for programming languages and operating systems
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography
Java(TM) Programming Language, The (4th Edition)

Java(TM) Programming Language, The (4th Edition)
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Energy-efficient software implementation of long integer modular arithmetic

CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Curve25519: new diffie-hellman speed records

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition

Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Micro Edition of the Java 2 platform (J2ME) provides an application environment specifically designed to address the demands of embedded devices like cell phones, PDAs or set-top boxes. Since the J2ME platform does not include a crypto package, developers are forced to use third-party classes or to implement all cryptographic primitives from scratch. However, most existing implementations of elliptic curve (EC) cryptography for J2ME do not perform well on resource-restricted devices, in most cases due to poor efficiency of the underlying arithmetic operations. In this paper we present an optimized Java implementation of EC scalar multiplication that combines efficient finite-field arithmetic with efficient group arithmetic. More precisely, our implementation uses a pseudo-Mersenne (PM) prime field for fast modular reduction and a Gallant-Lambert-Vanstone (GLV) curve with an efficiently computable endomorphism to speed up the scalar multiplication with random base points. Our experimental results show that a conventional mobile phone without Java acceleration, such as the Nokia 6610, is capable to execute a 174-bit scalar multiplication in roughly 400 msec, which is more than 45 times faster than the widely-used Bouncy Castle Lightweight Crypto API for J2ME.