Montgomery multiplication and squaring for Optimal Prime Fields

Optimal Prime Fields (OPFs) are considered to be one of the best choices for lightweight elliptic curve cryptography implementations on resource-constraint embedded processors. In this paper, we revisit the efficient modular arithmetic over the special prime fields, and present improved implementations of modular multiplication and squaring for OPFs, called Optimal Prime Field Coarsely Integrated Operand Caching (OPF-CIOC) and Coarsely Integrated Sliding Block Doubling (OPF-CISBD) methods. The OPF-CIOC and OPF-CISBD methods follow the general ideas of (consecutive) operand caching and sliding block doubling techniques, respectively. The methods have been carefully optimized and redesigned for Montgomery multiplication and squaring in an integrated fashion. We then evaluate the practical performance of proposed methods on representative 8-bit AVR processor. Experimental results show that the proposed OPF-CIOC and OPF-CISBD methods outperform the previous best known results in ACNS'14 by a factor of 8% and 32%. Furthermore, our methods are implemented in a regular way which helps to reduce the leakage of side-channel information.

[1]  Manuel Koschuch,et al.  Smart Elliptic Curve Cryptography for Smart Dust , 2010, QSHINE.

[2]  Johann Großschädl,et al.  TinySA: a security architecture for wireless sensor networks , 2006, CoNEXT '06.

[3]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[4]  Zhe Liu,et al.  Efficient Implementation of NIST-Compliant Elliptic Curve Cryptography for Sensor Nodes , 2013, ICICS.

[5]  Zhe Liu,et al.  Low-Weight Primes for Lightweight Elliptic Curve Cryptography on 8-bit AVR Processors , 2013, Inscrypt.

[6]  Zhe Liu,et al.  Multi-precision Squaring for Public-Key Cryptography on Embedded Microprocessors , 2013, INDOCRYPT.

[7]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[8]  Michael Scott,et al.  Optimizing Multiprecision Multiplication for Public Key Cryptography , 2007, IACR Cryptol. ePrint Arch..

[9]  Paul G. Comba,et al.  Exponentiation Cryptosystems on the IBM PC , 1990, IBM Syst. J..

[10]  Yang Zhang,et al.  Twisted edwards-form elliptic curve cryptography for 8-bit AVR-based sensor nodes , 2013, AsiaPKC '13.

[11]  Hans Eberle,et al.  Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs , 2004, CHES.

[12]  Hwajeong Seo,et al.  Multi-precision Multiplication for Public-Key Cryptography on Embedded Microprocessors , 2012, WISA.

[13]  Zhe Liu,et al.  MoTE-ECC: Energy-Scalable Elliptic Curve Cryptography for Wireless Sensor Networks , 2014, ACNS.

[14]  C. D. Walter,et al.  Distinguishing Exponent Digits by Observing Modular Subtractions , 2001, CT-RSA.

[15]  Erich Wenger,et al.  Fast Multi-precision Multiplication for Public-Key Cryptography on Embedded Microprocessors , 2011, CHES.

[16]  Tolga Acar,et al.  Analyzing and comparing Montgomery multiplication algorithms , 1996, IEEE Micro.

[17]  Yang Zhang,et al.  Efficient prime-field arithmetic for elliptic curve cryptography on wireless sensor nodes , 2011, Proceedings of 2011 International Conference on Computer Science and Network Technology.

[18]  Zhe Liu,et al.  New Speed Records for Montgomery Modular Multiplication on 8-Bit AVR Microcontrollers , 2014, AFRICACRYPT.

[19]  Younho Lee,et al.  Improved multi-precision squaring for low-end RISC microcontrollers , 2013, J. Syst. Softw..

[20]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.