• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.4
• /
• pp.885-892
• /
• 2010

In this paper we study the structures and properties of a single cycle T-finction, whose theory has been lately proposed by Klimov and Shamir. Any cryptographic system based on T-functions may be insecure. Some of the TSC-series stream ciphers have been successfully attacked by some attacks. So it is important to analyze every aspect of a single cycle T-function. We study some properties on a single cycle T-function and we show some examples are single cycle T-functions by these properties, whose proof is easier than existing methods.

• 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.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}$.

• Journal of the Chungcheong Mathematical Society
• /
• v.21 no.2
• /
• pp.259-268
• /
• 2008

To the design of secret key, there are two types of basic approaches called the tame approach and the wild approach. In the tame approach we try to use only simple primitives such as linear feedback shift registers and to prove mathematical theorems about their cryptographic properties. In the wild approach we try to use crazy compositions of operations which mix a variety of domains in a nonlinear and nonalgebraic way. There are several papers which try to bridge this gap by considering semi-wild constructions. A T-function on n-bit words plays an important role in semi-wild constructions. In this paper we study the invertibility and the period of some T-functions. Especially we characterize some polynomials which has a single cycle property.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.4
• /
• pp.789-797
• /
• 2009

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 will study T-functions which are probably invertible transformation and are very useful in stream ciphers. In this paper we will show that $f(x)=x+(g(x)^2{\vee}C)$ mod $2^n$ is a permutation with a single cycle of length $2^n$ if both the least significant bit and the third significant bit in the constant C are 1, where g(x) is a T-function.

• 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 applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.247-255
• /
• 2011

Invertible functions with a single cycle property have many cryptographic applications. The main context in which we study them in this paper is pseudo random generation and stream ciphers. In some cryptographic applications we need a generator which generates binary sequences of period long enough. A common way to increase the size of the state and extend the period of a generator is to run in parallel and combine the outputs of several generators with different period. In this paper we will characterize a secure quadratic polynomial on $\mathbb{Z}_{2^n}$, which generates a binary sequence of period long enough and without consecutive elements.

• Journal of the Korean Regional Science Association
• /
• v.34 no.1
• /
• pp.49-60
• /
• 2018

The purpose of the study is to analyze the housing problems of single-person household in 20-35 age group. Using the survey of Household's Consumption in 2014, we estimated the housing demand function of young single-person household in Seoul. As a result, the coefficient of the permanent income for young single-person household housing was significantly lower than other groups and the housing demand was also lower than others. Since current income isn't come up to permanent income enough, the housing consumption of young single-person household shrinks. It implies the role of the housing financial market is less activated. That is, the difficulty of realization of permanent income and lack of housing finance are the main cause of the imbalance of housing demand of one young person. Therefore, it implies that in order to alleviate the housing problem of the young single-person household, a policy to balance the permanent income with the housing demand is needed.

• Computers and Concrete
• /
• v.21 no.3
• /
• pp.291-298
• /
• 2018

In this study, the flexural fatigue performance of concrete beams made with 100% Coarse Recycled Concrete Aggregates (RCA) and 100% Coarse Natural Aggregates (NA) were statistically commanded. For this purpose, the experimental fatigue test results of earlier researcher were investigated using two parameter Weibull distribution. The shape and scale parameters of Weibull distribution function was evaluated using seven numerical methods namely, Graphical method (GM), Least-Squares (LS) regression of Y on X, Least-Squares (LS) regression of X on Y, Empherical Method of Lysen (EML), Mean Standard Deviation Method (MSDM), Energy Pattern Factor Method (EPFM) and Method of Moments (MOM). The average of Weibull parameters was used to incorporate survival probability into stress (S)-fatigue life (N) relationships. Based on the Weibull theory, as single and double logarithm fatigue equations for RCA and NA under different survival probability were provided. The results revealed that, by considering 0.9 level survival probability, the theoretical stress level corresponding to a fatigue failure number equal to one million cycle, decreases by 8.77% (calculated using single-logarithm fatigue equation) and 6.62% (calculated using double logarithm fatigue equation) in RCA when compared to NA concrete.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.1
• /
• pp.61-68
• /
• 2021

In the past, radars have been classified into fire control radars, detection radars, tracking radars, and image acquisition radars according to the characteristics of the mission. However, multi-function radars perform various tasks within a single system, such as target detection, tracking, identification friend or foe, jammer detection and response. Therefore, efficient resource management is essential to operate multi-function radars with limited resources. In particular, the target threat for tracking the detected target and the method of selecting the tracking cycle based on this is an important issue. If focus on tracking a threat target, Radar can't efficiently manage the targets detected in other areas, and if you focus on detection, tracking performance may decrease. Therefore, effective scheduling is essential. In this paper, we propose the TaP (Time and Priority) algorithm, which is a multi-functional radar scheduling scheme, and a software design method to construct it.