Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier
Related Key Attacks (RKAs) are powerful cryptanalytic attacks where an adversary can change the secret key and observe the effect of such changes at the output. The state of the art in RKA security protects against an a-priori unbounded number of certain algebraic induced key relations, e.g., affine functions or polynomials of bounded degree. In this paper, the authors show that it is possible to go beyond the algebraic barrier and achieve security against arbitrary key relations, by restricting the number of tampering queries the adversary is allowed to ask for.
Provided by: Aarhus University Topic: Security Date Added: Oct 2013 Format: PDF