arrow
返回

Generating Cryptographic S-Boxes Using the Reinforcement Learning

delete2021-01-01
delete3
delete
OA
AI
G
Giyoon Kim
H
Hangi Kim
Y
Yeachan Heo
Y
Yongjin Jeon
J
Jongsung Kim *
DOI:10.1109/ACCESS.2021.3085861delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Substitution boxes (S-boxes) are essential components of many cryptographic primitives. The Dijkstra algorithm, SAT solvers, and heuristic methods have been used to find bitsliced implementations of S-boxes. However, it is difficult to apply these methods for 8-bit S-boxes because of their size. Therefore, to implement these S-boxes so that the countermeasure of side-channel attack can be applied efficiently, using structures such as Feistel, Lai-Massey, and MISTY that can be bitsliced implemented with a small number of nonlinear operations has been widely used. Since S-boxes constructed with structures consist of small S-boxes and have specific designs, there are limitations to their cryptographic security and efficiency. In this paper, we propose a new method for generating S-boxes by stacking bitwise operations from the identity function, an approach that is different from existing methods. This method can be expressed in Markov decision process, and reinforcement learning is a suitable solver for Markov decision process. Our goal is to train this method to an agent through reinforcement learning to generate S-boxes to which the masking scheme, which is a countermeasure of side-channel attack, can be efficiently applied. In particular, our method provided various S-boxes superior or comparable to existing S-boxes. We produced 8-bit S-boxes with differential uniformity 16 (resp. 32) and linearity 128 (resp. 128), generated with nine (resp. eight) nonlinear operations, for the first time. To our best knowledge, this is the first study to construct cryptographic S-Box by incorporating reinforcement learning.
Keyword:
Cryptography
Reinforcement learning
Security
Linearity
Stacking
Markov processes
Side-channel attacks
S-box
masking efficiency
reinforcement learning
bitsliced implementation
linearity
differential uniformity
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

K
kookmin university
学者数:
3.0K
论文数: 3.3K
被引数: 2
引用论文

引用论文

Has spinocerebellar ataxia type 2 a distinct phenotype? Genetic and clinical study of an Italian family
err1995-04-01
err0
PREAI
errA. Filla; G. De Michele; S. Banfi; L. Santoro; A. Perretti; F. Cavalcanti; L. Pianese; I. Castaldo; F. Barbieri; G. Campanella; S. Cocozza
err分享
err收藏
RECTANGLE: a bit-slice lightweight block cipher suitable for multiple platforms
err2015-11-19
err236
PREAI
errZhang WenTao; Bao ZhenZhen; Lin DongDai; Rijmen, Vincent; Yang BoHan; Verbauwhede, Ingrid
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Identification of Klebsiella pneumoniae Producing OXA-232 and CTX-M-15 by Whole-Genome Sequencing Analysis
err2015-12-09
err0
errOAAI
errShangxin (Shaun) Yang; Peera Hemarajata; Janet Hindler; Kevin Ward; Fan Li; Helty Adisetiyo; Grace Aldrovandi; Romney M. Humphries
err分享
err收藏
Molecular Characteristics of High Amylose Starches
err2006-10-26
err0
PREAI
errWerner Praznik; Anton Huber; Sabine Watzinger; Roland H. F. Beck
err分享
err收藏
err分享
err收藏
学者 查看更多内容