TY - GEN
T1 - A 3.40ms/GF(p521) and 2.77ms/GF(2521) DF-ECC processor with side-channel attack resistance
AU - Lee, Jen Wei
AU - Chung, Szu Chi
AU - Chang, Hsie-Chia
AU - Lee, Chen-Yi
PY - 2013
Y1 - 2013
N2 - Public-key cryptosystems (Fig. 3.3.1) have been widely developed for ensuring the security of information exchange in network communications, financial markets, private data storage, and personal identification devices. In contrast to the well-known RSA algorithm, elliptic curve cryptography (ECC) provides the same security level with a shorter key size. As specified in IEEE P1363 (Standard Specifications for Public Key Cryptography), ECC arithmetic is required to provide not only dual-field operations over GF(p) and GF(2 m) but also arbitrary elliptic curves (EC) for different requirements, such as encryption, signature, and key exchange. In this paper, a solution supporting a 521b key size is proposed to accelerate the most time-critical elliptic curve scalar multiplication (ECSM). It computes multiple points KP = P + P +... + P, where K is the private key and P is an EC point. In addition, side-channel attack resistance is implemented to prevent information leakage from simple power-analysis (SPA), differential power-analysis (DPA) [1], zero-value point (ZVP) [2], and doubling attacks [3].
AB - Public-key cryptosystems (Fig. 3.3.1) have been widely developed for ensuring the security of information exchange in network communications, financial markets, private data storage, and personal identification devices. In contrast to the well-known RSA algorithm, elliptic curve cryptography (ECC) provides the same security level with a shorter key size. As specified in IEEE P1363 (Standard Specifications for Public Key Cryptography), ECC arithmetic is required to provide not only dual-field operations over GF(p) and GF(2 m) but also arbitrary elliptic curves (EC) for different requirements, such as encryption, signature, and key exchange. In this paper, a solution supporting a 521b key size is proposed to accelerate the most time-critical elliptic curve scalar multiplication (ECSM). It computes multiple points KP = P + P +... + P, where K is the private key and P is an EC point. In addition, side-channel attack resistance is implemented to prevent information leakage from simple power-analysis (SPA), differential power-analysis (DPA) [1], zero-value point (ZVP) [2], and doubling attacks [3].
UR - http://www.scopus.com/inward/record.url?scp=84876514850&partnerID=8YFLogxK
U2 - 10.1109/ISSCC.2013.6487632
DO - 10.1109/ISSCC.2013.6487632
M3 - Conference contribution
AN - SCOPUS:84876514850
SN - 9781467345132
T3 - Digest of Technical Papers - IEEE International Solid-State Circuits Conference
SP - 50
EP - 51
BT - 2013 IEEE International Solid-State Circuits Conference, ISSCC 2013 - Digest of Technical Papers
T2 - 2013 60th IEEE International Solid-State Circuits Conference, ISSCC 2013
Y2 - 17 February 2013 through 21 February 2013
ER -