⚡ 本页包含 AI 生成的分析内容，仅供参考
该论文提出了一种支持双域（GF(p)和GF(2^m)）的椭圆曲线密码（ECC）处理器，能够抵抗侧信道攻击。通过优化算法和架构，实现了在GF(p521)上3.40ms、在GF(2^521)上2.77ms的运算速度，解决了ECC处理器在安全性和性能之间的平衡问题。
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(2m) 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-a
Jen-Wei Lee, Szu-Chi Chung, Hsie-Chia Chang, Chen-Yi Lee
National Chiao Tung University, Hsinchu, Taiwan