Optimizing implementations of linear layers
In this paper, we propose a new heuristic algorithm to search efficient implementations (in terms of Xor count) of linear layers used in symmetric-key cryptography. It is observed that the implementation cost of an invertible matrix is related to its matrix decomposition if sequential-Xor (s-Xor) me...
Saved in:
Main Authors: | Xiang, Zejun, Zeng, Xiangyong, Lin, Da, Bao, Zhenzhen, Zhang, Shasha |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/145106 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes
by: Luo, Gaojun, et al.
Published: (2022) -
Three new constructions of optimal linear codes with few weights
by: Cheng, Yingjie, et al.
Published: (2024) -
On two-dimensional linear waves in Blasius boundary layer over viscoelastic layers
by: Wang, Z., et al.
Published: (2014) -
Expected size of random Tukey layers and convex layers
by: Guo, Zhengyang, et al.
Published: (2022) -
A truly exact perfect absorbing layer for time-harmonic acoustic wave scattering problems
by: Yang, Zhiguo, et al.
Published: (2022)