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...
-
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...
-
-
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...
-
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...
-
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...
-
New nonexistence results on circulant weighing matrices
A weighing matrix W = ( w i , j ) is a square matrix of order n and entries w i , j in {0,± 1} such that W W T = k I n . In his thesis, Strassler gave a table of...
-
-
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...
-
On the construction of near-MDS matrices
The optimal branch number of MDS matrices makes them a preferred choice for designing diffusion layers in many block ciphers and hash functions....
-
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...
-
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...
-
On optimal constant weight codes derived from \(\omega \)-circulant balanced generalized weighing matrices
Balanced generalized weight matrices are used to construct optimal constant weight codes that are monomially inequivalent to codes derived from the...
-
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...
-
Structured Matrices and Their Application in Neural Networks: A Survey
Modern neural network architectures are becoming larger and deeper, with increasing computational resources needed for training and inference. One...
-
Security analysis of P-SPN schemes against invariant subspace attack with inactive S-boxes
The security requirements of new applications such as cloud computing, big data, and the Internet of Things have promoted the development and...
-
Solving the Problem of Blockwise Isomorphism of Polynomials with Circulant Matrices
The problem of Isomorphism of Polynomials (IP problem) is known to be important to study the security of multivariate public key cryptosystems, one...