论文信息 - Accelerating next-generation public-key cryptosystems on general-purpose CPUs

Accelerating next-generation public-key cryptosystems on general-purpose CPUs

This article describes low-cost techniques for accelerating the ECC and RSA public-key cryptosystems on general-purpose processor architectures. We focus on hardware acceleration of public-key cryptosystems on 64-bit server machines. A prototype based on a Sparc CPU data path shows a clear performance advantage of ECC over RSA.

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

[2] Atsuko Miyaji,et al. Efficient Elliptic Curve Exponentiation Using Mixed Coordinates , 1998, ASIACRYPT.

[3] Ruby B. Lee,et al. Efficient permutation instructions for fast software cryptography , 2001 .

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

[5] Todd M. Austin,et al. Architectural support for fast symmetric-key cryptography , 2000, SIGP.

[6] Arjen K. Lenstra,et al. Selecting Cryptographic Key Sizes , 2000, Public Key Cryptography.

[7] Hans Eberle,et al. A cryptographic processor for arbitrary elliptic curves over GF(2/sup m/) , 2003, Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003.

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

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

[10] J. Grossschadl. Instruction set extension for long integer modulo arithmetic on RISC-based smart cards , 2002, 14th Symposium on Computer Architecture and High Performance Computing, 2002. Proceedings..

[11] Shreyas Sundaram,et al. A public-key cryptographic processor for RSA and ECC , 2004 .

[12] T. Austin,et al. Architectural support for fast symmetric-key cryptography , 2000, ASPLOS IX.