Masking with Randomized Look Up Tables

摘要: We propose a new countermeasure to protect block ciphers implemented in leaking devices, at the intersection between One-Time Programs and Boolean masking schemes. First, we show that this prevents side-channel attacks of all orders during execution protected cipher implementation, given some secure precomputations can be performed. Second, taking advantage linear diffusion layer modern allows deriving clear arguments for security their implementations, easily interpreted by hardware designers. Masking with randomized look up tables fast times but its memory requirements are high and, depending on protect, prohibitive. believe proposal brings an interesting connection former countermeasures against recent formal solutions cope physical leakage. It illustrates vs. performance tradeoff these complementary approaches as result, highlights simple design guidelines leakage resilient ciphers.