A Unified Architecture for Supporting Operations of AES and ECC

In the recent years, embedded systems began to be used in sensitive applications such as personal digital assistants and smart cards. Due to very strict cost and power constrains, the support for cryptography provided by these devices is often limited to either public or private key primitives. This limitation is much more evident in devices where the cryptographic algorithms are implemented using hardware resources. In this paper, we propose an extension of a public-key cryptosystem to support also private-key, and we evaluate our architecture on FPGA platforms. In particular, we propose a new arithmetic unit in which the polynomial modular multiplication of ECC is extended to compute also the polynomial arithmetic operations over binary extended field of AES. We compare our design with an architecture obtained by instantiating state of the art implementation of AES and ECC and we evaluate the trade-offs. The experimental results show that our proposed architecture takes up less hardware resources. Nevertheless, the achieved performances are better compared to the ECC reference core, while the ones compared to AES only implementation are comparable with the state of the art.

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

[2]  Christof Paar,et al.  Are standards compliant Elliptic Curve Cryptosystems feasible on RFID ? , 2006 .

[3]  Johann Großschädl,et al.  VLSI Implementation of a Functional Unit to Accelerate ECC and AES on 32-Bit Processors , 2007, WAIFI.

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

[5]  Johann Großschädl,et al.  Light-Weight Instruction Set Extensions for Bit-Sliced Cryptography , 2008, CHES.

[6]  Annie Pérez,et al.  AES Implementation on FPGA: Time - Flexibility Tradeoff , 2002, FPL.

[7]  Christof Paar,et al.  New Lightweight DES Variants , 2007, FSE.

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

[9]  William Stallings,et al.  THE ADVANCED ENCRYPTION STANDARD , 2002, Cryptologia.

[10]  Vincent Rijmen,et al.  AES implementation on a grain of sand , 2005 .

[11]  Sandra Dominikus,et al.  Efficient AES Implementations on ASICs and FPGAs , 2004, AES Conference.

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

[13]  Johannes Wolkerstorfer,et al.  A Cryptographic Processor for Low-Resource Devices: Canning ECDSA and AES Like Sardines , 2011, WISTP.

[14]  Ricardo Dahab,et al.  Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation , 1999, CHES.

[15]  ÇETIN K. KOÇ,et al.  Montgomery Multiplication in GF(2k) , 1998, Des. Codes Cryptogr..

[16]  Tim Kerins,et al.  An Elliptic Curve Processor Suitable For RFID-Tags , 2006, IACR Cryptol. ePrint Arch..

[17]  Andrey Bogdanov,et al.  PRESENT: An Ultra-Lightweight Block Cipher , 2007, CHES.

[18]  Cheng-Wen Wu,et al.  An Efficient Multimode Multiplier Supporting AES and Fundamental Operations of Public-Key Cryptosystems , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.