Destroying Fault Invariant with Randomization

摘要: Researchers have demonstrated the ineffectiveness of deterministic countermeasures and emphasized on use randomness for protecting cryptosystems against fault attacks. One such countermeasure AES was proposed in LatinCrypt 2012, which masks faulty output with secret values. However this does not affect erroneous byte computation last round is thus shown to be flawed FDTC 2013. In paper, we examine 2012 detail identify its additional flaws order develop a robust countermeasure. We bring out major weakness infection mechanism only makes attack 2013 much more flexible, but also enables us break seemingly complex using Piret & Quisquater's that requires 8 pairs correct ciphertexts. Finally, combine all our observations propose employs effectively prevent state-of-the-art differential attacks AES.