최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기한국정보통신학회논문지 = Journal of the Korea Institute of Information and Communication Engineering, v.25 no.12, 2021년, pp.1882 - 1889
양현준 (Department of Electronic Engineering, Kumoh National Institute of Technology) , 신경욱 (School of Electronic Engineering, Kumoh National Institute of Technology)
This paper describes a high-performance hardware implementation of modular multiplication used as a core operation in elliptic curve cryptography. A 521-bit high-performance modular multiplier for NIST P-521 curve was designed by adopting 3-way Toom-Cook integer multiplication and fast reduction alg...
S. Sugiyama, H. Awano, and M. Ikeda, "Low Latency 256-bit Fp ECDSA Signature Generation Crypto Processor," IEICE Transaction on Fundamentals of Electronics, Communications and Computer Sciences, vol. E101-A, no. 12, pp. 2290-2296, Dec. 2018. DOI: 10.1587/transfun.E101.A.2290.
M. Knezevic, V. Nikov, and P. Rombouts, "Low-latency ECDSA signature verification-A road toward safer traffic," IEEE Transaction on Very Large Scale Integration (VLSI) Systems, vol. 24, no. 11, pp. 3257-3267, 2016.
P. L. Montgomery, "Modular multiplication without trial division," Mathematics of Computation, vol. 44, no. 170, pp. 519-521, May. 1985.
A. Karatsuba and Y. Ofman, "Multiplication of many-digital numbers by automatic computers," Proceedings of the USSR Academy of Sciences, vol. 145, no. 2, pp. 293-294, 1962.
A. L. Toom, "The complexity of a scheme of functional elements realizing the multiplication of integers," Soviet Math. Doklady, vol. 3, no. 4, pp. 714-716, 1963.
S. Li and Z. Gu, "Lazy Reduction and Multi-Precision Division Based on Modular Reductions," 2018 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS), Chengdu, pp. 407-410, 2018.
P. Barrett, "Implementing the Rivest Shamirand Adleman public key encryption algorithm on a standard digital signal processor," Conference on the Theory and Application of Cryptographic Techniques, Springer, vol. 263, pp. 311-323, Aug. 1986.
D. Hankerson, A. Menezes, and S. Vanstone, Guide to elliptic curve cryptography, Springer Science & Business Media, 2006.
J. M. B. Mera, A. Karmakar, and I. Verbauwhed, "Timememory trade-off in Toom-Cook multiplication: an application to module-lattice based cryptography," International Association for Cryptologic Research (IACR) Transactions on Cryptographic Hardware and Embedded Systems, vol. 2020, no. 2, pp. 222-244, Mar. 2020. DOI: 10.13154/tches.v2020.i2.222-244.
J. Ding, S. Li, and Z. Gu, "High-speed ECC processor over NIST prime fields applied with Toom-Cook multiplication," IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 66, no. 3, pp. 1003-1016, Mar. 2019.
M. Bodrato and A. Zanoni, "Integer and polynomial multiplication: Towards optimal black Toom-Cook matrices," Proceedings of the 2007 international symposium on Symbolic and algebraic computation, pp. 17-24, Jul./Aug. 2007.
L. Chen, D. Moody, A. Regenscheid, and K. Randall, "Recommendations for discrete logarithm-based cryptography: elliptic curve domain parameters," Computer Security Recource Center, SP 800-186 (draft), Oct. 2019.
J. Y. Choi and K. Y. Shin, "A High Performance Modular Multiplier for ECC," Journal of Institute of Korean Electrical and Electronics Engineers, vol. 24, no. 4, pp. 961-968, Dec. 2020.
M. Islam, S. Hossain, Shahjalal, K. Hasan, and Y. M. Jang, "Area-Time Efficient Hardware Implementation of Modular Multiplication for Elliptic Curve Cryptography," IEEE Access, vol. 8, pp. 73898-73906, Apr. 2020.
H. Alrimeih and D. Rakhmatov, "Pipelined modular multiplier supporting multiple standard prime fields," 2014 IEEE 25th International Conference on Application- Specific Systems, Architectures and Processors, Jun. 2014.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
오픈액세스 학술지에 출판된 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.