论文信息 - A 920MHz quad-core cryptography processor accelerating parallel task processing of public-key algorithms

A 920MHz quad-core cryptography processor accelerating parallel task processing of public-key algorithms

The wireless access point (AP) devices of the next generation demand low-latency, high-security, and flexible authentication and authorization for heterogeneous clients. This makes it necessary to implement the high-complexity public-key ciphers efficiently on programmable processors. Therefore, this paper presents a quad-core processor that accelerates public-key computations by enabling high-speed parallel task processing. A test chip (1.925×3 um2) of the proposed processor is implemented in 65nm process. This chip is superior to the powerful platforms like Nvidia GPU and AMD Opteron workstation with regard to the performance: 0.13ms for the decryption of RSA-1024 and 0.095ms for the scalar multiplication of ECC-256 in Fp.

Yang Li | Shuai Wang | Xiaoyang Zeng | Jun Han | Yifan Bo

[1] William F. Bond. 64-bit architecture speeds RSA by 4x , 2002 .

[2] Stuart Jacobs. WiMAX subscriber and mobile station authentication challenges , 2011, IEEE Communications Magazine.

[3] Patrick Longa,et al. Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields , 2008, IEEE Transactions on Computers.

[4] Whitfield Diffie. The first ten years of public-key cryptography , 1988 .

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

[6] Fadi J. Kurdahi,et al. A novel systolic VLSI architecture for fast RSA modular multiplication , 2002, Proceedings. IEEE Asia-Pacific Conference on ASIC,.

[7] Tim Güneysu,et al. Exploiting the Power of GPUs for Asymmetric Cryptography , 2008, CHES.

[8] Akashi Satoh,et al. Systematic Design of RSA Processors Based on High-Radix Montgomery Multipliers , 2011, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[9] Ingrid Verbauwhede,et al. FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction , 2011, CHES.

[10] Holger Orup,et al. Simplifying quotient determination in high-radix modular multiplication , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[11] Patrick Longa,et al. Efficient Techniques for High-Speed Elliptic Curve Cryptography , 2010, CHES.

[12] Chun Chen,et al. Secure and Efficient Handover Authentication Based on Bilinear Pairing Functions , 2012, IEEE Transactions on Wireless Communications.