A Parallel Processing Hardware Architecture for Elliptic Curve Cryptosystems
暂无分享,去创建一个
Ingrid Verbauwhede | Bart Preneel | Kazuo Sakiyama | Elke De Mulder | B. Preneel | I. Verbauwhede | E. D. Mulder | K. Sakiyama
[1] Christof Paar,et al. A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware , 2001, CHES.
[2] Johann Großschädl,et al. A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m) , 2001, CHES.
[3] Akashi Satoh,et al. A Scalable Dual-Field Elliptic Curve Cryptographic Processor , 2003, IEEE Trans. Computers.
[4] P. L. Montgomery. Modular multiplication without trial division , 1985 .
[5] N. Koblitz. Elliptic curve cryptosystems , 1987 .
[6] Erkay Savas,et al. A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m) , 2000, CHES.
[7] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[8] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[9] Victor S. Miller,et al. Use of Elliptic Curves in Cryptography , 1985, CRYPTO.
[10] Christof Paar,et al. A High Performance Reconfigurable Elliptic Curve Processor for GF(2m) , 2000, CHES.
[11] Alfred Menezes,et al. Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.
[12] Patrick Schaumont,et al. Interactive cosimulation with partial evaluation , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.
[13] Lejla Batina,et al. Flexible Hardware Design for RSA and Elliptic Curve Cryptosystems , 2004, CT-RSA.