Browse > Article
http://dx.doi.org/10.13089/JKIISC.2019.29.3.511

Efficient Modular Reduction for NIST Prime P-256  

Chang, Nam Su (Department of Information Security, Sejong Cyber University)
Publication Information
Journal of the Korea Institute of Information Security & Cryptology / v.29, no.3, 2019 , pp. 511-514 More about this Journal
Abstract
Elliptic Curves Cryptosystem(ECC) provides the same level of security with relatively small key sizes, as compared to the traditional cryptosystems. The performance of ECC over GF(2m) and GF(p) depends on the efficiency of finite field arithmetic, especially the modular multiplication which is based on the reduction algorithm. In this paper, we propose a new modular reduction algorithm which provides high-speed ECC over NIST prime P-256. Detailed experimental results show that the proposed algorithm is about 25% faster than the previous methods.
Keywords
Elliptic Curve Cryptosystem; Fast Reduction; Finite Field Arithmetic;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. E. Knuth, "The Art of Computer Programming," Addison-Wesley Publis hing Company, Reading, MA, 1981
2 H. Cohen, "'A Course in Computation al Algebric Number Theory," Springer-Verlag, Berlin, Heidelberg, 1993
3 American National Standard for Financial Services, "Public Key Cryptography for the financial services industry: ECDSA, X9.62," 1998
4 D. Hankerson, A. Menezes, S. Vanstone, "Guide to Elliptic Curve Cryptography," Springer, 2004
5 M. Brown, D. Hankerson, A. Menezes, "Software Implementation of the NIST Elliptic Curves over Prime Fields", Proceedings of CT-RSA 2001, LNCS2020, Springer Verlag, pp.250-265, 2001
6 N. S. Chang, C. H. Kim, S. Hong, Y. Park, "Efficeint Bit-Parallel Polynomi ial Basis Multipliers fo All Irreducible Trinomial," Jonornal of The Korea Institute of information Security & Cryptology, 19(2), pp. 49-61, Apr. 2009
7 S. Gueron, V. Krasnov, "Fast prime field elliptic-curve cryptography with 256-bit primes," J. Cryptographic Engin., vol. 5, pp. 141-151, Jun, 2015   DOI
8 J. Chung, M. A. Hasan, "Low-weight polynomial form integers for efficient modular multiplication" IEEE Tran sactions on Computers, 56(1), pp. 44-57, Jan. 2007   DOI