References
- H. Lin, and N. Bergmann, "IoT Privacy and Security Challenges for Smart Home Environments," information, pp. 1-15, 2016. DOI:10.3390/info7030044
- O. Toshihiko, "Lightweight Cryptography Applicable to various IoT Devices," NEC Technical Journal, vol.12, no.1, pp. 67-71, 2017.
- T. Eisenbarth and S. Kumar, "A Survey of Lightweight Cryptography Implementations," IEEE Design & Test of Computers, vol.24, pp. 522-533, 2007. DOI:10.1109/MDT.2007.178
- R. Rivest, A. Shamir, and L. Adleman, "A method for obtaining Digital Signatures and Public-Key Crypto-systems," Communications of the ACM, vol. 21, no. 2, pp. 120-126, 1978. DOI:10.1145/359340.359342
- N. Koblitz, "Elliptic curve cryptosystems," Mathematics of Computation, vol.48, no.177, pp. 203-209, 1987. DOI:10.1090/S0025-5718-1987-0866109-5
- V. S. Miller, "Use of elliptic curve in cryptography," in CRYPTO85: Proceedings of the Advances in Cryptology, Springer-Verlag, pp. 417-426, 1986.
- M. Amara and A. Siad, "Hardware implementation of Elliptic Curve Point Multiplication over GF(2^m) for ECC protocols," International Journal for Information Security Research (IJISR), vol.2, no.1, pp. 106-112, March. 2012. https://doi.org/10.20533/ijisr.2042.4639.2012.0013
- F. Morain and J. Olivos, "Speeding up the computations on an elliptic curve using additionsubtraction chains," RAIRO Theoretical Informatics and Applications, vol.24, no.6, pp. 531-543, 1990. https://doi.org/10.1051/ita/1990240605311
- P. L. Montgomery, "Speeding the Pollard and elliptic curve methods of factorization," Mathematics of Computation, vol.48, no.177, pp. 243-264, 1987. DOI:10.1090/S0025-5718-1987-0866113-7
- J. H. Silverman, The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics (GTM) 106, Springer-Verlag, 1986.
- J. Lopez and R. Dahab, "Improved Algorithms for Elliptic Curve Arithmetic in GF(2^n)," International Workshop on Selected Areas in Cryptography (SAC), pp. 201-212, 1998. Also in Lecture Notes in Computer Science, vol.1556, Springer.
- NIST Std. FIPS PUB 186-2, Digital Signature Standard (DSS), National Institute of Standard and Technology (NIST), Jan. 2000.
- J. Guajardo et al, "Efficient hardware implementation of finite fields with applications to cryptography," in Acta Applicandae Mathematicae, vol.93, pp. 75-118, 2006. DOI:10.1007/s10440-006-9072-z
- Miyamoto et al, "Systematic design of highradix Montgomery multipliers for RSA processors," IEEE International Conference on Computer Design (ICCD), pp. 416-421, 2008. DOI:10.1109/ICCD.2008.4751894
- M. D. Shieh and W. C. Lin, "Word-Based Montgomery Modular Multiplication Algorithm for Low-Latency Scalable Architectures," IEEE Transactions on Computers, vol.59, no.8, pp. 1145-1151, 2010. DOI:10.1109/TC.2010.72
- A. Bellemou, M. Anane, N. Benblidia, and M. Issad, "FPGA Implementation of Scalar Multiplication over F_p for Elliptic Curve Cryptosystem," 2015 10th International Design & Test Symposium (IDT), pp. 135-140, 2015. DOI:10.1109/IDT.2015.7396750
- K. Javeed, X. Wang, and M. Scott, "High performance hardware support for elliptic curve cryptography over general prime field," Microprocessors and Microsystems, pp. 331-342, 2017. DOI:10.1016/j.micpro.2016.12.005
- K. Javeed, and X. Wang "FPGA Based High Speed SPA Resistant Elliptic Curve Scalar-Multiplier Architecture," International Journal of Reconfigurable Computing, pp. 1-10, 2016. DOI:10.1155/2016/6371403
- B. Song, K. Kawakami, K. Nakano, and Y. Ito, "An RSA Encryption Hardware Algorithm using a Single DSP Block and a Single Block RAM on the FPGA," First International Conference on Networking and Computing, pp. 140-147, 2010. DOI:10.15803/ijnc.1.2_277
- W. L. Cho, and K. W. Shin, “2,048 bits RSA public-key cryptography processor based on 32-bit Montgomery modular multiplier,” Journal of the Korea Institute of Information and Communication Engineering, Vol. 21, No. 8, pp. 1471-1479, Aug. 2017. https://doi.org/10.6109/JKIICE.2017.21.8.1471