Accelerating the Best Trail Search on AES-Like Ciphers
In this study, we accelerate Matsui’s search algorithm to search for the best differential and linear trails of AES-like ciphers. Our acceleration points are twofold. The first exploits the structure and branch number of an AES-like round function to apply strict pruning conditions to Matsui’s sear...
Main Authors: | Seonggyeom Kim, Deukjo Hong, Jaechul Sung, Seokhie Hong |
---|---|
Format: | Article |
Language: | English |
Published: |
Ruhr-Universität Bochum
2022-06-01
|
Series: | IACR Transactions on Symmetric Cryptology |
Subjects: | |
Online Access: | https://tosc.iacr.org/index.php/ToSC/article/view/9719 |
Similar Items
-
Proving Resistance Against Infinitely Long Subspace Trails: How to Choose the Linear Layer
by: Lorenzo Grassi, et al.
Published: (2021-06-01) -
Traals for the twenty-first century : planning, design, and managemant manual for multi use-trails /
by: Ryan, Karen-Lee
Published: (1993) -
Urban trails : a preliminary list of trails and sources/
by: 409605 Goodey, Brian
Published: (1974) -
Planning for urban trails/
by: 8697 American Society of Planning Officials, et al.
Published: (1969) -
Optimal Differential Trails in SIMON-like Ciphers
by: Zhengbin Liu, et al.
Published: (2017-03-01)