scholarly journals Vector-Circulant Matrices and Vector-Circulant Based Additive Codes over Finite Fields

Information ◽  
2017 ◽  
Vol 8 (3) ◽  
pp. 82
Author(s):  
Somphong Jitman
Author(s):  
Chaoyun Li ◽  
Qingju Wang

Near-MDS matrices provide better trade-offs between security and efficiency compared to constructions based on MDS matrices, which are favored for hardwareoriented designs. We present new designs of lightweight linear diffusion layers by constructing lightweight near-MDS matrices. Firstly generic n×n near-MDS circulant matrices are found for 5 ≤ n ≤9. Secondly, the implementation cost of instantiations of the generic near-MDS matrices is examined. Surprisingly, for n = 7, 8, it turns out that some proposed near-MDS circulant matrices of order n have the lowest XOR count among all near-MDS matrices of the same order. Further, for n = 5, 6, we present near-MDS matrices of order n having the lowest XOR count as well. The proposed matrices, together with previous construction of order less than five, lead to solutions of n×n near-MDS matrices with the lowest XOR count over finite fields F2m for 2 ≤ n ≤ 8 and 4 ≤ m ≤ 2048. Moreover, we present some involutory near-MDS matrices of order 8 constructed from Hadamard matrices. Lastly, the security of the proposed linear layers is studied by calculating lower bounds on the number of active S-boxes. It is shown that our linear layers with a well-chosen nonlinear layer can provide sufficient security against differential and linear cryptanalysis.


1990 ◽  
Vol 28 (3) ◽  
pp. 271-285 ◽  
Author(s):  
Marcelo J. Weinberger ◽  
Abraham Lempel

1994 ◽  
Vol 62 (2) ◽  
pp. 126-133 ◽  
Author(s):  
Dieter Jungnickel ◽  
Thomas Beth ◽  
Willi Geiselmann

2017 ◽  
Vol 09 (03) ◽  
pp. 1750037
Author(s):  
Taranjot Kaur ◽  
Anuradha Sharma

Let [Formula: see text] denote the finite field of order [Formula: see text] and characteristic [Formula: see text] [Formula: see text] be a positive integer coprime to [Formula: see text] and let [Formula: see text] be an integer. In this paper, we develop the theory of constacyclic additive codes of length [Formula: see text] over [Formula: see text] and provide a canonical form decomposition for these codes. By placing ordinary, Hermitian and ∗ trace bilinear forms on [Formula: see text] we determine some isodual constacyclic additive codes of length [Formula: see text] over [Formula: see text] Moreover, we explicitly determine basis sets of all self-orthogonal, self-dual and complementary-dual negacyclic additive codes of length [Formula: see text] over [Formula: see text] when [Formula: see text] and enumerate these three class of codes for any integer [Formula: see text] with respect to the aforementioned trace bilinear forms on [Formula: see text]


2018 ◽  
Vol 17 (10) ◽  
pp. 1850198 ◽  
Author(s):  
Jay A. Wood

When [Formula: see text] is a linear code over a finite field [Formula: see text], every linear Hamming isometry of [Formula: see text] to itself is the restriction of a linear Hamming isometry of [Formula: see text] to itself, i.e. a monomial transformation. This is no longer the case for additive codes over non-prime fields. Every monomial transformation mapping [Formula: see text] to itself is an additive Hamming isometry, but there may exist additive Hamming isometries that are not monomial transformations.The monomial transformations mapping [Formula: see text] to itself form a group [Formula: see text], and the additive Hamming isometries form a larger group [Formula: see text]: [Formula: see text]. The main result says that these two subgroups can be as different as possible: for any two subgroups [Formula: see text], subject to some natural necessary conditions, there exists an additive code [Formula: see text] such that [Formula: see text] and [Formula: see text].


2020 ◽  
Vol 8 (1) ◽  
pp. 242-256
Author(s):  
Somphong Jitman

AbstractCirculant matrices over finite fields and over commutative finite chain rings have been of interest due to their nice algebraic structures and wide applications. In many cases, such matrices over rings have a closed connection with diagonal matrices over their extension rings. In this paper, the determinants of diagonal and circulant matrices over commutative finite chain rings R with residue field 𝔽q are studied. The number of n × n diagonal matrices over R of determinant a is determined for all elements a in R and for all positive integers n. Subsequently, the enumeration of nonsingular n × n circulant matrices over R of determinant a is given for all units a in R and all positive integers n such that gcd(n, q) = 1. In some cases, the number of singular n × n circulant matrices over R with a fixed determinant is determined through the link between the rings of circulant matrices and diagonal matrices. As applications, a brief discussion on the determinants of diagonal and circulant matrices over commutative finite principal ideal rings is given. Finally, some open problems and conjectures are posted


2015 ◽  
Vol 421 ◽  
pp. 268-295 ◽  
Author(s):  
Swee Hong Chan ◽  
Henk D.L. Hollmann ◽  
Dmitrii V. Pasechnik

Sign in / Sign up

Export Citation Format

Share Document