A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes

Abstract

A fault injection framework for the decryption algorithm of the Niederreiter public-key cryptosystem using binary irreducible Goppa codes and classical decoding techniques is described. In particular, we obtain low-degree polynomial equations in parts of the secret key. For the resulting system of polynomial equations, we present an efficient solving strategy and show how to extend certain solutions to alternative secret keys. We also provide estimates for the expected number of required fault injections, apply the framework to state-of-the-art security levels, and propose countermeasures against this type of fault attack.

Keywords

• computer science - information theory
• mathematics - algebraic geometry
• 94a60, 14g50
• e.3