Efficient Algorithm and Architecture for Elliptic Curve Cryptographic Processor
Authors:
- Tuy Tan NguyenTNTuy Tan Nguyen
- Hanho LeeHLHanho Lee
- 28 February 2016
- journal article
- Published by The Institute of Electronics Engineers of Korea in JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE
- Vol. 16 (1) , 118-125
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Novel Architecture for Efficient FPGA Implementation of Elliptic Curve Cryptographic Processor Over ${\rm GF}(2^{163})$IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2013
- Efficient Elliptic Curve Point Multiplication Using Digit-Serial Binary Field OperationsIEEE Transactions on Industrial Electronics, 2012
- Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)IEEE Transactions on Computers, 2009
- Concurrent error detection and correction in dual basis multiplier over GF(2
m
)IET Circuits, Devices & Systems, 2009
- Elliptic-Curve-Based Security Processor for RFIDIEEE Transactions on Computers, 2008
- Fast Elliptic Curve Cryptography on FPGAIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2008
- High-speed hardware implementations of Elliptic Curve Cryptography: A surveyJournal of Systems Architecture, 2007
- Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange RepresentationIEEE Transactions on Computers, 2006
- A fast parallel implementation of elliptic curve point multiplication over GF(2m)Microprocessors and Microsystems, 2004
- The State of Elliptic Curve CryptographyDesigns, Codes and Cryptography, 2000