On the importance of protecting Δ in SFLASH against side channel attacks

Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume

研究成果: Chapter in Book/Report/Conference proceedingChapter

抄録

SFLASH was chosen as one of the final selection of the project in 2003. It is one of the most efficient digital signature scheme and is suitable for implementation on memory-constrained devices such as smartcards. Side channel attacks (SCA) are a serious threat to memory-constrained devices. If the implementation on them is careless, we are able to break the secret key. In this chapter, we experimentally analyze the effectiveness of a side channel attack on SFLASH. There are two different secret keys for SFLASH, namely the proper secret key (s, t) and the random seed △ used for the hash function SHA-1. Whereas many papers discussed the security of (s, t), little is known about that of △. Steinwandt et al. proposed a theoretical DPA which aims at finding △ by observing XOR operations. We propose another DPA on △ using the addition operation modulo 232, and present an experimental result of the DPA. After obtaining the secret key △, the underlying problem of SFLASH can be reduced to the C* problem broken by Patarin. From our simulation, about 1408 pairs of messages and signatures are needed to break SFLASH. Consequently, one has to carefully implement SHA-1 in order to resist SCA on SFLASH. Very recently, Courtois et al. have proposed a new version of SFLASH, called SFLASHv3 [2]. However, the attacks described in this chapter are applicable to the new version.

本文言語英語
ホスト出版物のタイトルEmbedded Cryptographic Hardware
ホスト出版物のサブタイトルDesign and Security
出版社Nova Science Publishers, Inc.
ページ67-82
ページ数16
ISBN(印刷版)1594541450, 9781594541452
出版ステータス出版済み - 2005
外部発表はい

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

フィンガープリント 「On the importance of protecting Δ in SFLASH against side channel attacks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル