Advanced SearchSearch Tips
A New Scalar Recoding Method against Side Channel Attacks
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A New Scalar Recoding Method against Side Channel Attacks
Ryu, Hyo Myoung; Cho, Sung Min; Kim, TaeWon; Kim, Chang han; Hong, Seokhie;
  PDF(new window)
In this paper we suggest method for scalar recoding which is both secure against SPA and DPA. Suggested method is countermeasure to power analysis attack through scalar recoding using negative expression. Suggested method ensures safety of SPA by recoding the operation to apply same pattern to each digit. Also, by generating the random recoding output according to random number, safety of DPA is ensured. We also implement precomputation table and modified scalar addition algorithm for addition to protect against SPA that targets digit`s sign. Since suggested method itself can ensure safety to both SPA and DPA, it is more effective and efficient. Through suggested method, compared to previous scalar recoding that ensures safety to SPA and DPA, operation efficiency is increased by 11%.
Elliptic curve cryptosystem;Power analysis attack;SPA;DPA;Scalar recoding;
 Cited by
차분 전력 분석 공격에 대한 캐리 기반 랜덤 리코딩 방법의 취약성,하재철;

정보보호학회논문지, 2016. vol.26. 5, pp.1099-1103 crossref(new window)
Vulnerability of Carry Random Scalar Recoding Method against Differential Power Analysis Attack, Journal of the Korea Institute of Information Security and Cryptology, 2016, 26, 5, 1099  crossref(new windwow)
P. Kocher, J. Jaffe, and B. Jun, "Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Others Systems." CRYPTO'96, LNCS 1109, pp. 104-113, Aug. 1996.

P. Kocher, J. Jaffe, and B. Jun, "Differential Power Analysis", CRYPTO'99, LNCS 1666, pp. 388-397, 1999.

D. Hankerson, A. Menezes, and S. Vanstone, "Guide to elliptic curve cryptography", Springer Professional Computing. Springer-Verlag, New York, 2004.

M. Joye, M. Tunstall, "Exponent recoding and regular exponentiation algorithms." Africacrypt 2003, ed. by M. Joye. LNCS, vol.5580, pp. 334-349, Springer. 2009.

J.-S. Coron, "Resistance Against Differential Power Analysis for Elliptic Curve Cryptography.", Advances in Cryptology - CHES'99, volume 1717 of LNCS, pages 292-302. Springer-Verlag, 1999.

Liping Wang, Weike Wang, Rong, Zhang, and Xiang Wang, "A New ECC scalar Multiplication Algorithm with Randomized Power Consumption", ICSICT2014, Guilin, China, 2014.

E. Guerrini, L. Imbert, and T. Winterhalter, "Randomizing scalar multiplication using exact covering systems of congruences." Cryptology ePrint Archive, Report 2015/475, 2015.

Peng LUO, Dengguo FENG, Yongbin Zhou, "An New Anti-SPA Algorithm of NAF scalar Multiplication used in ECC", International Journal of Advancements in Computing Technology, Nov2012, Vol.4 Issue 20, p692, Nov. 2012.

JaeCheol Ha, SangJae Moon, "Randomized signed-scalar multiplication of ECC to resist power attacks.", in Pre-Proceedings of Workshop on Cryptographic Hardware and Embedded Systems CHES'02, Springer-Verlag, pp.553-565, Springer. 2002.

MahnKi Ahn, JaeCheol Ha, HoonJae Lee, SangJae Moon, "A Random M-ary Mehtod-Based Countermeasure against Power Analysis Attacks on ECC", Journal of the Korean Institute of Information Security and Cryptology v.13 no.3, pp.35 - 43, 2003

Feng, M., Zhu, B.B., Xu, M., Li, S. "Efficient comb elliptic curve multiplication methods resistant to power analysis." Cryptology ePrint Archive, Report 2005/222, 2005.

Jean-Sebastien Coron. "Resistance against differential power analysis for elliptic curve cryptosystems." In C.K. Koc and C.Paar, editors, Cryptographic Hardware and Embedded Systems (CHES '99), volume 1717 of Lecture Notes in Computer Science, pages 292-302. Springer-Verlag, 1999.

Peter L. Montgomery. "Speeding the Pollard and elliptic curve methods of factorization." Mathematics of Computation, 48(177):243-264, January 1987. crossref(new window)

Marc Joye and Sung-Ming Yen. "The Montgomery powering ladder." In B.S. Kaliski Jr., C.K. Koc, and C. Paar, editors, Cryptographic Hardware and Embedded Systems - CHES2002, Lecture Notes in Computer Science. Springer-Verlag, To appear.

V. Dimitrov, L. Imbert, and P.K. Mishra, "Efficient and Secure Elliptic Curve Point Multiplication using Double Base Chain. In: Roy, B. (ed.)," ASIACRYPT 2005, LNCS 3788, pp. 59-79, 2005.

T. Izu and T. Takagi, "A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks," PKC 2002, LNCS 2274, pp. 280-296, 2002.

R. L. Rivest, A. Shamir, and L.M. Adelman, "A method for obtaining digital signatures and public key cryptosystems", Communications of the ACM, 21, pp.120-126, 1978. crossref(new window)

N. Koblitz, "Elliptic curve cryptosystems", Mathematics of Computation, vol. 48, pp.203-209, 1987. crossref(new window)

Josyula R. Rao and Pankaj Rohatgi. "EMpowering Side-Channel Attacks", Available at

C. H. Lim and P. J. Lee, "More flexible exponentiation with precomputation", CRYPTO'94, LNCS2200, pp.324-334, Springer-Verlag, 1994.

Y. J. Choi, D. H. Cho, J. C. Ryou, "Implementing Side Channel Analysis Evaluation Boards of KLA-SCARF system." Journal of The Korea Institude of Information Security & Cryptology, Vol.24, no. 1 pp.229-240. 2014 crossref(new window)

Yoo-Jin Baek, 'Scalar recoding and regular 2w-ary right-to-left EC scalar multiplication algorithm', Information Processing Letters 113, pp. 357-360, 2013. crossref(new window)