搜索结果: 1-15 共查到“军事学 MDS”相关记录26条 . 查询时间(0.074 秒)
Constructing Low-latency Involutory MDS Matrices with Lightweight Circuit
Lightweight cryptography MDS matrix Involutory matrix
2019/2/27
MDS matrices are important building blocks providing diffusion functionality for the design of many symmetric-key primitives. In recent years, continuous efforts are made on the construction of MDS ma...
Construction of Lightweight MDS Matrices from Generalized Feistel Structures
Lightweight cryptography MDS matrix Generalized Feistel Structures
2018/11/12
This paper investigates the construction of lightweight MDS matrices with generalized Feistel structures (GFS). The approach developed by this paper consists in deriving MDS matrices from the product ...
Recently a lot of attention is paid to the search for efficiently implementable MDS matrices for lightweight symmetric primitives. Previous work concentrated on locally optimizing the multiplication w...
Lightweight MDS Serial-type Matrices with Minimal Fixed XOR Count
MDS matrix Serial matrix lightweight cryptography
2017/11/13
Many block ciphers and hash functions require the diffusion property of Maximum Distance Separable (MDS) matrices. Serial matrices with the MDS property obtain a trade-off between area requirement and...
Construction and Filtration of Lightweight Formalized MDS Matrices
block cipher linear diffusion layer MDS matrix
2017/5/23
The 4x4 MDS matrix over F2 is widely used in the design of block cipher's linear diffusion layers. However, considering the cost of a lightweight cipher's implementation, the sum of XOR operations of ...
This work considers the problem of constructing efficient MDS matrices over the field \F2m\F2m. Efficiency is measured by the metric XOR count which was introduced by Khoo et al. in CHES 2014. Recentl...
On the Efficient Construction of Lightweight Orthogonal MDS Matrices
MDS matrix XOR count polynomial residue ring
2017/5/2
In present paper, we mainly investigate the problem of efficiently constructing lightweight orthogonal MDS matrices over the matrix polynomial residue ring. Surprisingly, this problem did not receive ...
Design of Lightweight Linear Diffusion Layers from Near-MDS Matrices
lightweight cryptography diffusion layer near-MDS matrix
2017/3/6
Near-MDS matrices provide better trade-offs between security and efficiency compared to constructions based on MDS matrices, which are favored for hardware-oriented designs. We present new designs of ...
Construction of Lightweight MDS Matrices over Matrix Polynomial Residue Ring
MDS matrix XOR count matrix polynomial residue ring
2016/12/29
In this article, we investigate the construction of lightweight MDS matrices. The key contribution of present paper is constructing MDS matrices over matrix polynomial residue ring. To the best of our...
On the Construction of the lightest Circulant MDS Matrices
MDS matrix circulant matrix XOR operation
2016/12/12
4x4 MDS matrices with few XORs have a wide range of applications in plenty of mainstream lightweight ciphers. For 4x4 circulant MDS matrices over GL(4; F2), they have at least 12 XOR operations. In t...
Direct Construction of Lightweight Rotational-XOR MDS Diffusion Layers
Lightweight Cryptography MDS Diffusion Layers Bit-wise Circulant Matrices
2016/12/7
As a core component of Substitution-Permutation Networks, diffusion layer is mainly introduced by matrices from maximum distance separable (MDS) codes. Surprisingly, up to now, most constructions of M...
Direct construction of quasi-involutory recursive-like MDS matrices from $2$-cyclic codes
MDS matrices involutions cyclic codes
2016/12/7
A good linear diffusion layer is a prerequisite in the design of block ciphers. Usually it is obtained by combining matrices with optimal diffusion property over the Sbox alphabet. These matrices are ...
MDS matrices are important parts for block ciphers. We searched the 4×44×4 MDS matrices over GL(4, F2F2), and found the lightest MDS matrices only have 10 XOR operations. Besides, all these lightest M...
The QARMA Block Cipher Family -- Almost MDS Matrices Over Rings With Zero Divisors, Nearly Symmetric Even-Mansour Constructions With Non-Involutory Central Rounds, and Search Heuristics for Low-Latency S-Boxes
Tweakable Block Ciphers Almost MDS Matrices Even-Mansour Schemes
2016/5/9
We introduce and analyse a family of Almost MDS matrices defined over a ring with zero divisors that allows us to encode rotations in its operation while maintaining the minimal latency associated to ...
On the Construction of Lightweight Circulant Involutory MDS Matrices
secret-key cryptography MDS
2016/4/26
In the present paper, we investigate the problem of constructing MDS matrices with as few bit XOR operations as possible. The key contribution of the present paper is constructing MDS matrices with en...