HIGHLIGHTS
- who: Annapurna Valiveti and Srinivas Vivek from the IIIT Bangalore, Bangalore, India have published the research: Higher-Order Lookup Table Masking in Essentially Constant Memory, in the Journal: (JOURNAL)
- what: The authors solve the above problem by implementing a higher-order lookup table-based scheme using an amount of RAM that is independent of the masking order. The authors show that for lookup table-based masking schemes the use of a PRG not only reduces the randomness complexity (now logarithmic in the size of the S-box) but also the complexity and without any significant . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.