A Framework with Improved Heuristics to Optimize Low-Latency Implementations of Linear Layers

Abstract: In recent years, lightweight cryptography has been a hot field in symmetric cryptography. One of the most crucial problems is to find low-latency implementations of linear layers. The current main heuristic search methods include the Boyar-Peralta (BP) algorithm with depth limit and the backward search. In this paper we firstly propose two improved BP algorithms with depth limit mainly by minimizing the Euclidean norm of the new distance vector instead of maximizing it in the tie-breaking process of the BP algorithm. They can significantly increase the potential for finding better results. Furthermore, we give a new framework that combines forward search with backward search to expand the search space of implementations, where the forward search is one of the two improved BP algorithms. In the new framework, we make a minor adjustment of the priority of rules in the backward search process to enable the exploration of a significantly larger search space. As results, we find better .... https://tosc.iacr.org/index.php/ToSC/article/view/11297

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch

Bibliographic citation
A Framework with Improved Heuristics to Optimize Low-Latency Implementations of Linear Layers ; volume:2023 ; number:4 ; year:2023
IACR transactions on symmetric cryptology ; 2023, Heft 4 (2023)

Creator
Shi, Haotian
Feng, Xiutao
Xu, Shengyuan

DOI
10.46586/tosc.v2023.i4.489-510
URN
urn:nbn:de:101:1-2023122717540635014847
Rights
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
15.08.2025, 7:27 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Associated

  • Shi, Haotian
  • Feng, Xiutao
  • Xu, Shengyuan

Other Objects (12)