A high speed coprocessor for elliptic curve scalar multiplication over Fp
暂无分享,去创建一个
[1] H. Edwards. A normal form for elliptic curves , 2007 .
[2] Thanos Stouraitis,et al. An RNS Implementation of an $F_{p}$ Elliptic Curve Point Multiplier , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.
[3] Victor S. Miller,et al. Use of Elliptic Curves in Cryptography , 1985, CRYPTO.
[4] Milos D. Ercegovac,et al. Combining leak-resistant arithmetic for elliptic curves defined over Fp and RNS representation , 2010, IACR Cryptol. ePrint Arch..
[5] LuChen,et al. AN IMPLEMENTATION OF FAST ALGORITHM FOR ELLIPTIC CURVE CRYPTOSYSTEM OVER GF(p) , 2004 .
[6] Reinhard Posch,et al. Modulo Reduction in Residue Number Systems , 1995, IEEE Trans. Parallel Distributed Syst..
[7] Kimmo Järvinen,et al. High-Speed Elliptic Curve Cryptography Accelerator for Koblitz Curves , 2008, 2008 16th International Symposium on Field-Programmable Custom Computing Machines.
[8] Tim Güneysu,et al. Ultra High Performance ECC over NIST Primes on Commercial FPGAs , 2008, CHES.
[9] P. L. Montgomery. Modular multiplication without trial division , 1985 .
[10] Laurent Imbert,et al. Leak Resistant Arithmetic , 2004, CHES.
[11] Robert H. Sloan,et al. Power Analysis Attacks of Modular Exponentiation in Smartcards , 1999, CHES.
[12] Jean-Claude Bajard,et al. An RNS Montgomery Modular Multiplication Algorithm , 1998, IEEE Trans. Computers.
[13] Faculteit Ingenieurswetenschappen,et al. Secure and Efficient Coprocessor Design for Cryptographic Applications on FPGAs , 2007 .
[14] Atsushi Shimbo,et al. Implementation of RSA Algorithm Based on RNS Montgomery Multiplication , 2001, CHES.
[15] Atsushi Shimbo,et al. Cox-Rower Architecture for Fast Parallel Montgomery Multiplication , 2000, EUROCRYPT.
[16] Akashi Satoh,et al. A Scalable Dual-Field Elliptic Curve Cryptographic Processor , 2003, IEEE Trans. Computers.
[17] Tim Güneysu,et al. Exploiting the Power of GPUs for Asymmetric Cryptography , 2008, CHES.
[18] Jean-Sébastien Coron,et al. Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems , 1999, CHES.
[19] Frédéric Valette,et al. The Doubling Attack - Why Upwards Is Better than Downwards , 2003, CHES.
[20] Ingrid Verbauwhede,et al. Reconfigurable Modular Arithmetic Logic Unit for High-Performance Public-Key Cryptosystems , 2006, ARC.
[21] Ramdas Kumaresan,et al. Fast Base Extension Using a Redundant Modulus in RNS , 1989, IEEE Trans. Computers.
[22] Jean-Jacques Quisquater,et al. High-speed hardware implementations of Elliptic Curve Cryptography: A survey , 2007, J. Syst. Archit..
[23] Marc Joye,et al. The Montgomery Powering Ladder , 2002, CHES.