References
- Korea Internet & Security Agency (KISA). IoT Common Security Principle v1.0 [Internet]. Available: http://www.kisa.or.kr/public/laws/laws3_View.jsp?mode=view&p_No=259&b_No=259&d_No=67&ST=T&SV=/.
- R. Rivest, A. Shamir, and L. Adleman, "A method for obtaining Digital Signatures and Public-Key Cryptosystems," Communications of the ACM, vol. 21, no. 2, pp. 120-126, Feb. 1978. https://doi.org/10.1145/359340.359342
- NIST Std. FIPS PUB 186-2: Digital Signature Standard (DSS), NIST, Jan. 2000.
- J. Shao, L. Wu, and X. Zhang, "Design and implimentation of RSA for dual interface bank IC card," 2013 IEEE 10th International Conference on ASIC (ASICON), Shenzhen, pp. 1-4, 2013.
- M. S. Kim, Y. S. Kim, and H. S. Cho, "Design of Cryptographic Hardware Architecture for Mobile Computing," Journal of Information Processing Systems, vol. 5, no. 4, pp. 187-196, Dec. 2009. https://doi.org/10.3745/JIPS.2009.5.4.187
- X. Zheng, Z. Liu, and B. Peng, "Design and Implementation of Ultra low power RSA coprocessor," in proceeding of the 4th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM'08), Dalian, pp. 1-5, 2008.
- 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 (KIICE), vol. 21, no. 8, pp. 1471-1479, Aug. 2017. https://doi.org/10.6109/JKIICE.2017.21.8.1471
- P. L. Montgomery, "Modular multiplication without trial division," Mathematics of computation, vol. 44, no. 170, pp. 519-521, Apr. 1985. https://doi.org/10.1090/S0025-5718-1985-0777282-X
- A. Kauther, S. Sami, and A. Ahmed, "Enhancement of hardware modular multiplier radix-4 algorithm for fast RSA cryptosystem," International Conference on Computing, Electrical and Electronic Engineering (ICCEEE), pp. 692-696, Khartoum, 2013.
- A. Nadjia, and A. Mohamed, "High throughput parallel montgomery modular exponentiation on FPGA," in Proceeding of the 9th International Symposium on Design and Test, Algiers, pp. 225-230, 2014.
- B. Hanindhito, N. Ahmadi, H. Hogantara, A. I. Arrahmah, and T. Adiono, "FPGA implementation of modified serial montgomery modular multiplication for 2048-bit RSA cryptosystems," 2015 International Seminar on Intelligent Technology and its Applications (ISITIA), Surabaya, pp. 113-118, 2015.
- A. Rezai, and P. keshavarzi, "High-throughput modular multiplication and exponentiation algorithms using multibit-scan-multibit-shift technique," IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 23, no. 9, pp. 1710-1719, Sep. 2015. https://doi.org/10.1109/TVLSI.2014.2355854
- C. K. koc, T. Acar, and B. S. Kaliski, "Analyzing and comparing Montgomery multiplication algorithms," IEEE Micro, vol. 16, no. 3, pp. 26-33, Jun. 1996. https://doi.org/10.1109/40.502403
- S. Tamura, C. Yamada, and S. Ichikawa, "Implementation and Evaluation of modular multiplication based on Coarsely Integrated Operand Scanning," IEEE 2012 Third International Conference on Networking and Computing (ICNC), Hangzhou, pp. 334-335, 2012.
- R. Verma, M. Duttam, and R. Vig, "FPGA Implementation of Modified Montgomery for RSA Cryptosystem," International Journal of Computer Science and Telecommunications, Vol. 4, no. 1, pp. 42-46, Jan. 2013.
- M. Huang, K. Gai, and T. EI-Ghazawi, "New Hardware Architectures for Montgomery Modular Multiplication Algorithm," IEEE Transactions on computers, vol. 60, no. 7, pp. 923-936, Jul. 2011. https://doi.org/10.1109/TC.2010.247
- S. Erdem, T. Yanik, and A. Celebi, "A General Digit-Serial Architecture for Montgomery Modular Multiplication," IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 25, no. 5, pp. 1658-1668, May 2017. https://doi.org/10.1109/TVLSI.2017.2652979
Cited by
- 공개키 암호 구현을 위한 경량 하드웨어 가속기 vol.23, pp.12, 2019, https://doi.org/10.6109/jkiice.2019.23.12.1609
- A Study on the Contents Security Management Model for Multi-platform Users vol.10, pp.2, 2018, https://doi.org/10.7236/ijasc.2021.10.2.10