• Communications of the Korean Mathematical Society
• /
• v.35 no.4
• /
• pp.1159-1170
• /
• 2020

We consider the weighted spaces ℓ^p(𝕊, 𝜑) and ℓ^p(𝕊, 𝜓) for 1 < p < +∞, where 𝜑 and 𝜓 are weights on 𝕊 (= ℕ or ℤ). We obtain a sufficient condition for ℓ^p(𝕊, 𝜓) to be multiplier weighted-space of ℓ^p(𝕊, 𝜑) and ℓ^p(𝕊, 𝜓). Our condition characterizes the last multiplier weighted-space in the case where 𝕊 = ℤ. As a consequence, in the particular case where 𝜓 = 𝜑, the weighted space ℓ^p(ℤ,𝜓) is a convolutive algebra.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.371-374
• /
• 2000

This paper proposes a 16-bit ${\times}$ 16-bit multiplier for 2 twos-complement binary numbers with tree-like structure and implements it on a FPGA. The space and time complexity analysis shows that the 16-bit Tree-like multiplier represents lower circuit complexity and computes more quickly than both Booth array multiplier md Modified array multiplier.

• ETRI Journal
• /
• v.35 no.3
• /
• pp.523-529
• /
• 2013

Subquadratic space complexity multipliers for optimal normal bases (ONBs) have been proposed for practical applications. However, for the Gaussian normal basis (GNB) of type t > 2 as well as the normal basis (NB), there is no known subquadratic space complexity multiplier. In this paper, we propose the first subquadratic space complexity multipliers for the type 4 GNB. The idea is based on the fact that the finite field GF($2^n$) with the type 4 GNB can be embedded into fields with an ONB.

• Journal of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.455-466
• /
• 2008

Current studies on products of analytic functionals have been based on applying convolution products in D' and the Fourier exchange formula. There are very few results directly computed from the ultradistribution space Z'. The goal of this paper is to introduce a definition for the product of analytic functionals and construct a new multiplier space $F(N_m)$ for $\delta^{(m)}(s)$ in a one or multiple dimension space, where Nm may contain functions without compact support. Several examples of the products are presented using the Cauchy integral formula and the multiplier space, including the fractional derivative of the delta function $\delta^{(\alpha)}(s)$ for $\alpha>0$.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.5
• /
• pp.11-22
• /
• 2010

Recently, Fan and Dai introduced a Shifted Polynomial Basis and construct a non-pipeline bit-parallel multiplier for $F_{2^n}$. As the name implies, the SPB is obtained by multiplying the polynomial basis 1, ${\alpha}$, ${\cdots}$, ${\alpha}^{n-1}$ by ${\alpha}^{-\upsilon}$. Therefore, it is easy to transform the elements PB and SPB representations. After, based on the Modified Shifted Polynomial Basis(MSPB), SPB bit-parallel Mastrovito type I and type II multipliers for all irreducible trinomials are presented. In this paper, we present a bit-parallel architecture to multiply in SPB. This multiplier have a space complexity efficient than all previously presented architecture when n ${\neq}$ 2k. The proposed multiplier has more efficient space complexity than the best-result when 1 ${\leq}$ k ${\leq}$ (n+1)/3. Also, when (n+2)/3 ${\leq}$ k < n/2 the proposed multiplier has more efficient space complexity than the best-result except for some cases.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.12
• /
• pp.29-40
• /
• 2008

The efficient hardware design of finite field multiplication is an very important research topic for and efficient $f(x)=x^n+x^k+1$ implementation of cryptosystem based on arithmetic in finite field GF($2^n$). We used special generating trinomial to construct a bit-parallel multiplier over finite field with low space complexity. To reduce processing time, The hardware architecture of proposed multiplier is similar with existing Mastrovito multiplier. The complexity of proposed multiplier is depend on the degree of intermediate term $x^k$ and the space complexity of the new multiplier is $2k^2-2k+1$ lower than existing multiplier's. The time complexity of the proposed multiplier is equal to that of existing multiplier or increased to $1T_X(10%{\sim}12.5%$) but space complexity is reduced to maximum 25%.

• Journal of the Chungcheong Mathematical Society
• /
• v.20 no.4
• /
• pp.367-373
• /
• 2007

For a unital *-subalgebra of the space $\mathcal{L}^a(X)$ of all adjointable maps on a Hilbert $\mathcal{B}$-module X with a $C^*$-algebra $\mathcal{B}$, we study unitary operator (in such algebra)-valued multiplier ${\sigma}$ on a normal, generating subsemigroup S of a group G with its extension to G. A dilation of a projective isometric ${\sigma}$-representation of S is established as a projective unitary ${\rho}$-representation of G for a suitable unitary operator (in some algebra)-valued multiplier ${\rho}$ associated with the multiplier ${\sigma}$ which is explicitly constructed.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.2
• /
• pp.49-61
• /
• 2009

Finite Field multiplication operation is one of the most important operations in the finite field arithmetic. Recently, Fan and Dai introduced a Shifted Polynomial Basis(SPB) and construct a non-pipeline bit-parallel multiplier for $F_{2^n}$. In this paper, we propose a new bit-parallel shifted polynomial basis type I and type II multipliers for $F_{2^n}$ defined by an irreducible trinomial $x^{n}+x^{k}+1$. The proposed type I multiplier has more efficient the space and time complexity than the previous ones. And, proposed type II multiplier have a smaller space complexity than all previously SPB multiplier(include our type I multiplier). However, the time complexity of proposed type II is increased by 1 XOR time-delay in the worst case.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.2
• /
• pp.69-75
• /
• 2023

Finite field arithmetic operations play an important role in a variety of applications, including modern cryptography and error correction codes. In this paper, we propose an efficient multiplication algorithm over finite fields using the Montgomery multiplication algorithm. Existing multipliers can be implemented using AND and XOR gates, but in order to reduce time and space complexity, we propose an algorithm using NAND and NOR gates. Also, based on the proposed algorithm, an efficient semi-systolic finite field multiplier with low space and low latency is proposed. The proposed multiplier has a lower area-time complexity than the existing multipliers. Compared to existing structures, the proposed multiplier over finite fields reduces space-time complexity by about 71%, 66%, and 33% compared to the multipliers of Chiou et al., Huang et al., and Kim-Jeon. As a result, our multiplier is proper for VLSI and can be successfully implemented as an essential module for various applications.

• Journal of the Korean Mathematical Society
• /
• v.45 no.6
• /
• pp.1535-1548
• /
• 2008

The analogues of Marcinkiewicz multiplier theorem and Littlewood-Paley theorem are proved for p-Faber series in weighted Smirnov spaces defined on bounded and unbounded components of a rectifiable Jordan curve.