Search
Search Results
-
On the circulant matrix MDS testing and the search for circulant MDS matrices
MDS matrices are used in symmetric cryptography to hinder differential and linear cryptanalysis. This article proposes and examines a new...
-
Numerical algorithms for determinant evaluation of the block circulant tridiagonal matrices arising from convolution equations
In this paper, we first propose a novel block diagonalization approach for evaluating the determinant of the block circulant tridiagonal matrix....
-
-
One-bit distributed compressed sensing with partial gaussian circulant matrices
One-bit distributed compressed sensing has been widely used in multi-node networks and many other fields. Conventional approaches often employ random...
-
New Digital Signature Scheme Based on RSA Using Circulant Matrix
One of the most important outcomes of public key cryptography is digital signature methods. These digital signature techniques allow digital...
-
Combinatorial refinement on circulant graphs
The combinatorial refinement techniques have proven to be an efficient approach to isomorphism testing for particular classes of graphs. If the...
-
On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies
In this article, we investigate the convergence behavior of two classes of gathering protocols with fixed circulant topologies using tools from...
-
An algebraic approach to circulant column parity mixers
Circulant Column Parity Mixers (CCPMs) are a particular type of linear maps, used as the mixing layer in permutation-based cryptographic primitives...
-
Fast newton method to solve KLR based on multilevel circulant matrix with log-linear complexity
Kernel logistic regression (KLR) is a conventional nonlinear classifier in machine learning. With the explosive growth of data size, the storage and...
-
Two party key exchange protocol based on duo circulant matrices for the IoT environment
This paper proposes a new two-party key exchange protocol based on the max-plus semiring, which is the set of matrices over the set of integers along...
-
Canonization of a Random Circulant Graph by Counting Walks
It is well known that almost all graphs are canonizable by a simple combinatorial routine known as color refinement. With high probability, this...
-
Quaternary Hermitian self-dual codes of lengths 26, 32, 36, 38 and 40 from modifications of well-known circulant constructions
In this work, we give three new techniques for constructing Hermitian self-dual codes over commutative Frobenius rings with a non-trivial involutory...
-
On the two-sided matrix action problem in tropical semirings
The search for optimal cryptographic protocols and algebraic structures has been a persistent challenge in modern cryptography. Among the proposed...
-
A note on cyclic MDS and non-MDS matrices
In 1998, Daemen et al.introduced a circulant Maximum Distance Separable (MDS) matrix in the diffusion layer of the Rijndael block cipher, drawing...
-
Time-Aware Circulant Matrices for Question-Based Temporal Localization
Episodic memory involves the ability to recall specific events, experiences, and locations from one’s past. Humans use this ability to understand the...
-
Circulant Tensor Graph Convolutional Network for Text Classification
Graph convolutional network (GCN) has shown promising performance on the text classification tasks via modeling irregular correlations between word...
-
The Two-Stripe Symmetric Circulant TSP is in P
The symmetric circulant TSP is a special case of the traveling salesman problem in which edge costs are symmetric and obey circulant symmetry....
-
On the counting of involutory MDS matrices
The optimal branch number of MDS matrices has established their importance in designing diffusion layers for various block ciphers and hash...
-
Self-dual codes from a block matrix construction characterised by group rings
We give a new technique for constructing self-dual codes based on a block matrix whose blocks arise from group rings and orthogonal matrices. The...
