Search

The Internet of Things (IoT) has gained popularity in various fields, including components such as embedded devices and wireless sensors. However, ensuring the security of data transmission from these devices is of critical importance. In light of these challenges, a novel lightweight encryption method called DRcipher is proposed in this paper for resource-constrained IoT devices. DRcipher has a 64-bit block size and supports either 96-bit or 128-bit key sizes. In order to improve the security, DRcipher employs a pseudo-random number of encryption rounds determined by the primary key. DRcipher adopts the structure of Generalized Feistel Network (GFN) with 4 branches, and its round functions consist of F-function, FF-function and RP permutation components. In particular, there is a negative feedback mechanism between the FF-function and the overall round of encryption functions. In addition, DRcipher is synthesised using Synopsys Design Compiler version A-2007.12-SP1 and the UMCL18G212T3 standard cell library. DRcipher-96 has an area footprint of 1546 Gate Equivalents (GE), while DRcipher-128 has a slightly larger area footprint of 1646 GE. Moreover, a comprehensive security analysis shows that the proposed DRcipher ensures high-level security redundancy against differential cryptanalysis, linear cryptanalysis, and so on.

This paper is to analyze the approximation solution of a split variational inclusion problem in the framework of Hilbert spaces. For this purpose, inertial hybrid and shrinking projection algorithms are proposed under the effect of a self-adaptive stepsize which does not require information of the norms of the given operators. The strong convergence properties of the proposed algorithms are obtained under mild constraints. Finally, a numerical experiment is given to illustrate the performance of proposed methods and to compare our algorithms with an existing algorithm.

A class of Dirichlet-Morrey spaces $ D_{\beta, \lambda} $ is introduced in this paper. For any positive Borel measure $ \mu $, the boundedness and compactness of the identity operator from $ D_{\beta, \lambda} $ into the tent space $ \mathcal{T}_s^1(\mu) $ are characterized. As an application, the boundedness of the Volterra integral operator $ T_g: D_{\beta, \lambda} \to F(1, \beta-s, s) $ is studied. Moreover, the essential norm and the compactness of the operator $ T_g $ are also investigated.

Let $ \mu $ be a positive Borel measure on the interval $ [0, 1) $. The Hankel matrix $ {\mathcal H}_\mu = (\mu_{n+k})_{n, k\geq 0} $ with entries $ \mu_{n, k} = \mu_{n+k} $ induces the operatoron the space of all analytic functions $ f(z) = \sum^\infty_{n = 0}a_nz^n $ in the unit disk $ {\mathbb{D}} $. In this paper, we characterize the boundedness and compactness of $ {\mathcal H}_\mu $ from Bloch type spaces to the BMOA and the Bloch space. Moreover we obtain the essential norm of $ {\mathcal H}_\mu $ from $ {\mathcal{B}}^\alpha $ to $ {\mathcal{B}} $ and BMOA.

In this paper, we study 2-complex symmetric composition operators with the conjugation J, defined by Jf(z)=(f(z¯))¯, on the Hardy space H2. More precisely, we obtain the necessary and sufficient condition for the composition operator Cϕ to be 2-complex symmetric with J when ϕ is an automorphism of D. We also characterize 2-complex symmetric with J when ϕ is a linear fractional self-map of D.

In this paper, some characterizations are given in terms of the boundary value and Poisson extension for the Dirichlet-type space Dμ. The multipliers of Dμ and Hankel-type operators from Dμ to L2PμdA are also investigated.

We investigated two new modified inertial Mann Halpern and inertial Mann viscosity algorithms for solving fixed point problems. Strong convergence theorems under some fewer restricted conditions are established in the framework of infinite dimensional Hilbert spaces. Finally, some numerical examples are provided to support our main results. The algorithms and results presented in this paper can generalize and extend corresponding results previously known in the literature.

In this paper, we introduce two modified inertial hybrid and shrinking projection algorithms for solving fixed point problems by combining the modified inertial Mann algorithm with the projection algorithm. We establish strong convergence theorems under certain suitable conditions. Finally, our algorithms are applied to convex feasibility problem, variational inequality problem, and location theory. The algorithms and results presented in this paper can summarize and unify corresponding results previously known in this field.

The logarithmic Bloch space Blog⁡ is the Banach space of analytic functions on the open unit disk 𝔻 whose elements f satisfy the condition ∥f∥=sup⁡z∈𝔻(1-|z|2)log⁡ (2/(1-|z|2))|f'(z)|

We provide a representation of elements of the space lp(A,X) for a locally convex space X and 1≤p

The boundedness and the compactness of the two integral operators Jgf(z)=∫0zf(ξ)g′(ξ)dξ; Igf(z)=∫0zf′(ξ)g(ξ)dξ, where g is an analytic function on the open unit disk in the complex plane, on the Zygmund space are studied.

Let Dn be the unit polydisc of ℂn, ϕ(z)=(ϕ1(z),…,ϕn(z)) be a holomorphic self-map of Dn, and ψ(z) a holomorphic function on Dn. Let H(Dn) denote the space of all holomorphic functions with domain Dn, H∞(Dn) the space of all bounded holomorphic functions on Dn, and B(Dn) the Bloch space, that is, B(Dn)={f∈H(Dn)|‖f‖B=|f(0)|+supz∈Dn∑k=1n|(∂f/∂zk)(z)|(1−|zk|2)

We study the following integral operators: Jgf(z)=∫0zf(ξ)g′(ξ)dξ; Igf(z)=∫0zf′(ξ)g(ξ)dξ, where g is an analytic function on the open unit disk in the complex plane. The boundedness and compactness of Jg, Ig between the Bergman-type spaces and the α-Bloch spaces are investigated.

We study the problem of finding a common solution to the variational inequality problem with a pseudomonotone and Lipschitz continuous operator and the fixed point problem with a demicontractive mapping in real Hilbert spaces. Inspired by the inertial method and the subgradient extragradient method, two improved viscosity-type efficient iterative methods with a new adaptive non-monotonic step size criterion are proposed. We prove that the strong convergence theorems of these new methods hold under some standard and mild conditions. Numerical examples in finite-and infinite-dimensional spaces are provided to illustrate the effectiveness and potential applicability of the suggested iterative methods compared to some known ones. [ABSTRACT FROM AUTHOR]

The purpose of this paper is concerned with the approximate solution of split equality problems. Two types of CQ algorithms with a new self-adaptive stepsize criterion are presented without prior knowledge of operator norms. The corresponding strong convergence theorems are obtained under mild conditions. Moreover, some numerical examples including an application in signal recovery problems, are provided to show the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

In this paper, a self-adaptive algorithm involving inertial technique will be introduced to solve bilevel pseudo-monotone variational inequality problems in Hilbert spaces. The main advantages of our algorithm is that the strong convergence theorem of the stated iterative method is proved without Lipschitz continuity condition of the associated mapping. Finally, the effectiveness and superiority of the proposed algorithm are proposed by numerical experiments. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the complex symmetric structure of generalized weighted composition operators Dm ψ,ϕ on the weighted Hardy space H²(β). We obtain explicit conditions for Dm ψ,ϕ to be complex symmetric with the conjugation Jw. Under the assumption that Dm ψ,ϕ is Jw -symmetric, some sufficient and necessary conditions for Dm ψ,ϕ to be Hermitian and normal are given. [ABSTRACT FROM AUTHOR]