A Compact FPGA-Based Application Specific Elliptic Curve Cryptography Over Prime Field
C¸ . K. Koc¸, T. Acar, and B. S. Kaliski. Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro, 16(3):26–33, 1996.
T. G¨uneysu and C. Paar. Ultra high performance ECC over NIST primes on commercial FPGAs. In E. Oswald and P. Rohatgi, editors, Proceedings of the 10th international workshop on Cryptographic Hardware and Embedded Systems (CHES), number 5154 in Lecture Notes in Computer Science, pages 62–78. Springer-Verlag, 2008.
C. McIvor, M. McLoone, and J.V. McCanny. An FPGA Elliptic Curve Cryptographic accelerator over GF(p). IEE Conference Publications, 2004(CP506):589–594, 2004.
National Institute of Standards and Technology. FIPS 186-3: Digital Signature Standard, 2009.
S. B. O¨ rs, L. Batina, B. Preneel, and J. Vandewalle. Hardware implementation of an Elliptic Curve Processor over GF(p). In In 14th IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP), pages 433–433. IEEE Computer Society, 2003.
K. Sakiyama, N. Mentens, L. Batina, B. Preneel, and I. Verbauwhede. Reconfigurable modular arithmetic logic unit supporting high-performance RSA and ECC over GF(p). International Journal of Electronics, 94(5):501–514, 2007.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.