A parallelized design for an elliptic curve cryptosystem coprocessor
暂无分享,去创建一个
[1] Christof Paar,et al. High-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware , 2001, IEEE Trans. Computers.
[2] O. Bratislava. Practical cryptography-the key size problem : PGP after years , 2001 .
[3] M. McLoone,et al. Fast Montgomery modular multiplication and RSA cryptographic processor architectures , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.
[4] 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.
[5] Thomas Blum,et al. Montgomery modular exponentiation on reconfigurable hardware , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).
[6] A. Antola,et al. Parallel architectures for elliptic curve cryptoprocessors over binary extension fields , 2003, 2003 46th Midwest Symposium on Circuits and Systems.
[7] M. Anwar Hasan,et al. Area efficient high speed elliptic curve cryptoprocessor for random curves , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..
[8] Ricardo Dahab,et al. Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation , 1999, CHES.
[9] Jürgen Teich,et al. Reconfigurable implementation of elliptic curve crypto algorithms , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.
[10] Alfred Menezes,et al. Software Implementation of Elliptic Curve Cryptography over Binary Fields , 2000, CHES.