Side Channel Attack Based on Time Series Analysis

Jianbo ZHAO; Min WANG; Wei XI; Zhen WU; Zhibo DU; Yi WANG; Tian LAN

doi:10.13648/j.cnki.issn1674-0629.2020.01.002

PDF(3996 KB)

South Power Sys Technol ›› 2020, Vol. 14 ›› Issue (1) : 10-17. DOI: 10.13648/j.cnki.issn1674-0629.2020.01.002

Safety and Defense Technology for Power Terminals

Side Channel Attack Based on Time Series Analysis

Jianbo ZHAO ¹ ,
Min WANG ¹ ,
Wei XI ² ,
Zhen WU ¹ ,
Zhibo DU ¹ ,
Yi WANG ¹ ,
Tian LAN ³

Author information +

History +

Abstract

The cryptographic device generates a large amount of physical information such as electromagnetic，energy consumption，heat，etc. during encryption and decryption. The attackers use these physical information to perform a side channel attack on the cryptographic device and steal the key of the cryptographic device. In the case of a traditional simple power analysis attack of elliptic curve cryptography algorithm，the attacker recovers the key by manually identifying similar modules in the power consumption data of the double point calculation. But this way results in low attack efficiency and low attack accuracy. This paper proposes the SPAMD algorithm based on the time series of motif discovery. The algorithm realizes the automatic recognition of similar modules in the power consumption data of the double point calculation，and completes the conversion of the attack mode from manual recognition to automatic recognition. Experiment results show that SPAMD attacks have a significant improvement in efficiency and accuracy.

Key words

side channel attack / simple power analysis attack / double point calculation / motif discovery

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations

Jianbo ZHAO , Min WANG , Wei XI , et al . Side Channel Attack Based on Time Series Analysis[J]. Southern Power System Technology. 2020, 14(1): 10-17 https://doi.org/10.13648/j.cnki.issn1674-0629.2020.01.002

References

List( Publishing order | Descend order by publishing year | Descend order by cited within ) Chart analysis

[1]	SHOKOOHI-YEKTA M, CHEN Y, CAMPANA B, et al. Discovery of meaningful rules in time series[C]// ACM Sigkdd International Conference on Knowledge Discovery & Data Mining, August 10-13, 2015, Sydney, Australia. New York: ACM, 2015: 1085-1094. Cited in this article [1]

[2]	SENIN P, LIN J, WANG X, et al. GrammarViz 2.0: a tool for grammar-based pattern discovery in time series[C]// ECML/PKDD. Springer Berlin Heidelberg, September 15-19, 2014, Nancy, France. Paris: ECML/PKDD, 2014: 468-472. Cited in this article [1]

[3]	BUZA K, SCHMIDT-THIEME L. Motif-based classification of time series with bayesian networks and SVMs[C]// Proceedings of the 32nd Annual Conference of BCS and VOC, July 16-18, 2008, Hamburg, Germany. Berlin: BCS/VOC, 2008. Cited in this article [1]

[4]	KEOGH E, LIN J, FU A. HOT SAX: efficiently finding the most unusual time series subsequence[C]// Fifth IEEE International Conference on Data Mining (ICDM’05). IEEE, 2006. Cited in this article [1]

[5]	SKALETSKY H, KURODA-KAWAGUCHI T, MINX P, et al. The male-specific region of the human Y chromosome is a mosaic of discrete sequence classes[J]. Nature, 2003, 423(6942): 825-837. Cited in this article [1]

[6]	LIN J, KEOGH E, LONARDI S, et al. Finding Motifs in time series[C]// Proceedings of 2nd workshop on temporal data mining at KDD, Edmonton, Canada. New York: SIGKDD, 53-68. Cited in this article [2]

[7]	MUEEN A, KEOGH E, ZHU Q, et al. Exact Discovery of time series motifs[C]// Proceedings of the Ninth SIAM International Conference on Data Mining, April 30-May 2, 2009, Sparks, NV, USA. New York: SIAM, 2009: 473-484. Cited in this article [1]

[8]	KEOGH E, CHAKRABARTI K, PAZZANI M, et al. Dimensionality reduction for fast similarity search in large time series databases[J]. Knowledge and Information Systems, 2002, 3(3): 263-286. Cited in this article [1]

[9]	CHAKRABARTI K, KEOGH E, MEHROTRA S, et al. Locally adaptive dimensionality reduction for indexing large time series databases[J]. ACM Transactions on Database Systems, 2002, 27(2): 188-228. Cited in this article [1]

[10]

LIN

, KEOGH

E J

, LONARDI

, et al. A symbolic representation of time series, with implications for streaming algorithms[C]// Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery, June 13, 2003, San Diego, California, USA. New York: ACM, 2003.

Cited in this article [1]

[11]	KEOGH E, LIN J, FU A. HOT SAX: efficiently finding the most unusual time series subsequence[C]// Fifth IEEE International Conference on Data Mining. November 27-30, 2005, Houston, TX, USA. New York: IEEE, 2006. Cited in this article [1]

[12]	LIN J, KEOGH E, WEI L, et al. Experiencing SAX: a novel symbolic representation of time series[J]. Data Mining and Knowledge Discovery, 2007, 15(2): 107-144. Cited in this article [1]

[13]	MUEEN A. Enumeration of time series motifs of all lengths[C]// 2013 IEEE International Conference on Data Mining, July 16-21, 2013, New York, USA. New York: IEEE, 2013. Cited in this article [1]

[14]

YEH

C C M

, ZHU

, ULANOVA

, et al. Matrix profile i: all pairs similarity joins for time series:a unifying view that includes motifs, discords and shapelets[C]// 2016 IEEE 16th International Conference on Data Mining, December 12-15, 2016, Barcelona, Spain. New York: IEEE, 2016.

Cited in this article [2]

[15]	KOCHER P C. Timing attacks on implementations of diffie-Hellman, RSA, DSS, and other systems[C]// Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology, August 18-22, 1996, Santa Barbara, CA, USA. New York: Crypto, 1999: 104-113. Cited in this article [1]

[16]	KOCHER P, JAFFE J, JUN B. Differential power analysis[EB/OL]. (1999-12-16). https://doi.org/10.1007/3-540-48405-1_25. Cited in this article [2]

[17]	KEOGH E, LIN J. Clustering of time-series subsequences is meaningless: implications for previous and future research[J]. 2005, 8(2): 154-177. Cited in this article [1]

[18]	RAKTHANMANON T, KEOGH E J, LONARDI S, et al. Time series epenthesis: clustering time series streams requires ignoring some data[C]// 11th IEEE International Conference on Data Mining, ICDM 2011, December 11-14, 2011, Vancouver, BC, Canada. New York: IEEE, 2011. Cited in this article [1]

[19]	GAI Y F, LIN J. Exploring variable-length time series motifs in one hundred million length scale[J]. Data Mining and Knowledge Discovery, 2018, 32(5): 1200-1228. Cited in this article [2]