A fault attack on KCipher-2

ABSTRACT

For the stream cipher KCipher-2 of the Japanese e-Government Recommended Ciphers List, we present fault attacks requiring only the possibility to reset the cipher and to inject byte faults into certain registers. For the polynomial systems resulting from an injection sequence into one register, we develop a dedicated algebraic solving technique. Using the Marking Algorithm of Horn Logic and the computation of certain Gröbner bases, we optimize the number and locations of fault injection sequences which allow the recovery of the full state of the cipher. The optimal attack requires only about 21 fault injections and 100 seconds for solving the polynomial systems and finding the internal state.

Keywords:

• KCipher-2
• stream cipher
• side-channel analysis
• fault attack
• guess-and-determine attack

2010 Mathematics Subject Classifications:

• 94A60
• 13P15

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

This research was supported by DFG (German Research Foundation) project ‘Algebraische Fehlerangriffe’ grant KR 1907/6-2.