検索に戻る
案件記録

REDUNDANCY AES MASKING BASIS FOR ATTACK MITIGATION USING LOOKUP TABLES

発明審査中
1閲覧数
51請求項 · 3 独立
§ Ⅰ

案件概要

発明者

Ury Kreimer; Yaacov Belenky; Alexander Kesler

IPC分類

H4L 9/6G6F 17/16H4L 9/

CPC分類

H4L9/631G6F17/16H4L9/2

Techniques include replacing many of the functions used in finite-field-based arithmetic with lookup tables (LUTs) and combining such LUTs with redundancy-based protection. Advantageously, using LUTs makes it possible to dramatically decrease the redundancy level (e.g., from d=8 to d=3 or 4) and the power consumption and increase the maximal frequency, while preserving the same protection level, latency and performance. The improvement is applicable not only to AES, but also to other algorithms based on a finite field arithmetic, and in particular SM4, ARIA, and Camellia which use Sboxes very similar to or the same as the AES Sbox.

原文(中国語)

Techniques include replacing many of the functions used in finite-field-based arithmetic with lookup tables (LUTs) and combining such LUTs with redundancy-based protection. Advantageously, using LUTs makes it possible to dramatically decrease the redundancy level (e.g., from d=8 to d=3 or 4) and the power consumption and increase the maximal frequency, while preserving the same protection level, latency and performance. The improvement is applicable not only to AES, but also to other algorithms based on a finite field arithmetic, and in particular SM4, ARIA, and Camellia which use Sboxes very similar to or the same as the AES Sbox.

外部リソース