Year: 2026
Type: article
Abstract: Re-keying is one of the most effective techniques to protect symmetric ciphers against side-channel attacks. Since its introduction, numerous re-keying schemes have been developed. This paper proposes two new index-based re-keying schemes, HOP-1 and HOP-2, which are variants of Kocher's re-keying scheme. Specifically, through tree-based analysis of Kocher's re-keying scheme, we identify strategies to minimize key repetition in Kocher's approach. We compare HOP-1 and HOP-2 with existing re-keying schemes and evaluate their application to two leakage-resilient authenticated encryption schemes, highlighting their effectiveness relative to these other re-keying schemes.
DOI: 10.62056/avl8ksuc2
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W7119476195
