• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.2
• /
• pp.331-343
• /
• 2015

Invertible transformations over n-bit words are essential ingredients in many cryptographic constructions. When n is large such invertible transformations are usually represented as a composition of simpler operations such as linear functions, S-P networks, Feistel structures and T-functions. Among them we study T-functions which are probably invertible transformations and are very useful in stream ciphers. In this paper we study the number of single cycle T-functions satisfying some conditions and characterize single cycle T-functions on $(\mathbb{Z}_2)^n$ generated by some elements in $(\mathbb{Z}_2)^{n-1}$.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.4
• /
• pp.573-584
• /
• 2016

Invertible transformations over n-bit words are essential ingredients in many cryptographic constructions. Such invertible transformations are usually represented as a composition of simpler operations such as linear functions, S-P networks, Feistel structures and T-functions. Among them T-functions are probably invertible transformations and are very useful in stream ciphers. In this paper we will characterize a secure trinomial on ${\mathbb{Z}}_{2^n}$ which generates an n-bit word sequence without consecutive elements of period $2^n$.

• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.4
• /
• pp.927-934
• /
• 2011

Invertible transformations over n-bit words are essential ingredients in many cryptographic constructions. When n is large (e.g., n = 64) such invertible transformations are usually represented as a composition of simpler operations such as linear functions, S-P networks, Feistel structures and T-functions. Among them we study T-functions which are probably invertible and are very useful in stream ciphers. In this paper we study some conditions on a T-function h(x) such that f(x) = x + h(x) has a single cycle on ${\mathbb{Z}}_{2^n}$.

• Korean Journal of Mathematics
• /
• v.15 no.2
• /
• pp.101-114
• /
• 2007

For an $m$ by $n$ nonnegative real matrix A, the maximal column rank of A is the maximal number of the columns of A which are linearly independent. In this paper, we analyze relationships between ranks and maximal column ranks of matrices over nonnegative reals. We also characterize the linear operators which preserve the maximal column rank of matrices over nonnegative reals.

• Journal of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.571-594
• /
• 2022

Let D be an integral domain with quotient field K, Pic(D) be the ideal class group of D, and X be an indeterminate. A polynomial overring of D means a subring of K[X] containing D[X]. In this paper, we study almost Dedekind domains which are polynomial overrings of a principal ideal domain D, defined by the intersection of K[X] and rank-one discrete valuation rings with quotient field K(X), and their ideal class groups. Next, let ℤ be the ring of integers, ℚ be the field of rational numbers, and 𝔊f be the set of finitely generated abelian groups (up to isomorphism). As an application, among other things, we show that there exists an overring R of ℤ[X] such that (i) R is a Bezout domain, (ii) R∩ℚ[X] is an almost Dedekind domain, (iii) Pic(R∩ℚ[X]) = $\oplus_{G{\in}G_{f}}$ G, (iv) for each G ∈ 𝔊f, there is a multiplicative subset S of ℤ such that RS ∩ ℚ[X] is a Dedekind domain with Pic(RS ∩ ℚ[X]) = G, and (v) every invertible integral ideal I of R ∩ ℚ[X] can be written uniquely as I = XnQe11···Qekk for some integer n ≥ 0, maximal ideals Qi of R∩ℚ[X], and integers ei ≠ 0. We also completely characterize the almost Dedekind polynomial overrings of ℤ containing Int(ℤ).