Results 71 to 80 of about 2,339 (216)
A Novel Hybrid Image Encryption Scheme Using Henon Map for Secure Image Communication
IET Information Security, Volume 2026, Issue 1, 2026.The combination of chaos theory and cryptographic methodologies constitutes a pivotal aspect of the information security. Owing to certain attributes of images, like their large data capacity and significant redundancy, image encryption needs specialized techniques instead of conventional text encryption.
Saba Inam +6 more
wiley +1 more source
Chebyshev polynomials and r-circulant matrices
, 2022 This paper connects two attractive topics in applied mathematics, r-circulant matrices and the Chebyshev polynomials. The r-circulant matrices whose entries are the Chebyshev polynomials of the first or second kind are considered.
Pešović, Marko, Pucanović, Zoran
core +1 more source
Basic Properties of Circulant Matrices and Anti-Circular Matrices [PDF]
Formalized Mathematics, 2008 For simplicity, we adopt the following convention: i, j, k, n, l denote elements of N, K denotes a field, a, b, c denote elements of K, p, q denote finite sequences of elements of K, and M1, M2, M3 denote square matrices over K of dimension n. Next we state two propositions: (1) 1K · p = p. (2) (−1K) · p = −p.
Xiaopeng Yue, Xiquan Liang
openaire +1 more source
Periodic Solutions to a Ring of Identical Cells With Delay via the Equivariant Degree Method
International Journal of Differential Equations, Volume 2026, Issue 1, 2026.We investigate the existence and multiplicity of bifurcating solutions in a Hopfield–Cohen–Grossberg network with n identical components and time delays. Applying the equivariant degree method, we derive sufficient conditions guaranteeing periodic solutions and their multiplicities. Two examples are provided to exemplify the theoretical results.
Shi Yu, Igor Freire
wiley +1 more source
Abstract and Applied Analysis, 2014 Circulant matrices play an important role in solving ordinary and partial differential equations. In this paper, by using the inverse factorization of polynomial of degree n, the explicit determinants of circulant and left circulant matrix involving ...
Juan Li, Zhaolin Jiang, Fuliang Lu
doaj +1 more source
Exhaustive Search for Various Types of MDS Matrices
IACR Transactions on Symmetric Cryptology, 2019 MDS matrices are used in the design of diffusion layers in many block ciphers and hash functions due to their optimal branch number. But MDS matrices, in general, have costly implementations. So in search for efficiently implementable MDS matrices, there
Abhishek Kesarwani +2 more
doaj +1 more source
Algebraic Connectivity Maximizing Regular Graphs: Special Case Analysis and Depth‐First Search
Concurrency and Computation: Practice and Experience, Volume 37, Issue 27-28, 25 December 2025.ABSTRACT The algebraic connectivity is an indicator of how well connected a graph is. It also characterizes the convergence speed of some dynamic processes over networks. In this paper, taking into account that homogeneous networks are modeled as regular graphs, we tackle the following problem: given a pair (n,k)$$ \left(n,k\right) $$ of positive ...
Masashi Kurahashi +3 more
wiley +1 more source
La Jolla Circulant Weighing Matrices Repository
<p>Dataset of circulant weighing matrices I've constructed or found in the literature, along with existence results.</p>If you use this dataset, please cite it using the metadata from this ...
Gordon, Daniel M.
core +1 more source
Circulant matrices: norm, powers, and positivity [PDF]
Opuscula Mathematica, 2018 In their recent paper "The spectral norm of a Horadam circulant matrix", Merikoski, Haukkanen, Mattila and Tossavainen study under which conditions the spectral norm of a general real circulant matrix \({\bf C}\) equals the modulus of its row/column sum.
Marko Lindner
doaj +1 more source
Johnson‐Lindenstrauss lemma for circulant matrices** [PDF]
Random Structures & Algorithms, 2011 AbstractWe prove a variant of a Johnson‐Lindenstrauss lemma for matrices with circulant structure. This approach allows to minimize the randomness used, is easy to implement and provides good running times. The price to be paid is the higher dimension of the target space k = O(ε−2 log3 n) instead of the classical bound k = O(ε−2 log n).
Aicke Hinrichs, Jan Vybíral
openaire +2 more sources