Searching for the right pairs of inputs in difference-based distinguishers is an important task for the experimental verification of the distinguishers in symmetric-key ciphers. In this paper …
Y Jiang, T He - Complexity, 2022 - Wiley Online Library
Compared to a charging scheduling and management problem characterized by predetermined trip assignment, this study takes bus and driver scheduling into account, and …
H Liu, W Zhang, J Zhang, X Sun - International Journal of …, 2022 - Wiley Online Library
CRAFT is an substitution‐permutation network tweakable block cipher proposed at fast software encryption 2019 by Beierle et al., which is designed to optimize the efficient …
X Gong, Y Hao, Q Wang - Designs, Codes and Cryptography, 2024 - Springer
Abstract The Mixed Integer Linear Programming (MILP) technique has been widely applied in the realm of symmetric-key cryptanalysis. In this paper, we propose a new bitwise …
F Liu, Z Sun, X Luo, C Li, J Wan - Mathematics, 2024 - mdpi.com
This paper delves into the realm of cryptographic analysis by employing mixed-integer linear programming (MILP), a powerful tool for automated cryptanalysis. Building on this …
Search for the right pairs of inputs in difference-based distinguishers is an important task for the experimental verification of the distinguishers in symmetric-key ciphers. In this paper, we …
In this paper, we propose a GPU-accelerated branch-and-bound algorithm. The proposed approach substantially increases the performance of the differential cluster search. We were …
H Qin, B Wu - arXiv preprint arXiv:2203.09741, 2022 - arxiv.org
ARX-based ciphers, constructed by the modular addition, rotation and XOR operations, have been receiving a lot of attention in the design of lightweight symmetric ciphers. For their …
ДВ Коледа - Теоретическая и прикладная криптография, 2023 - elibrary.ru
В статье рассматривается моделирование с помощью задачи целочисленного линейного программирования разностного (по операции⊕) перехода сквозь сложение …