http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
ON A CHARACTERIZATION OF T_FUNCTIONS WITH ONE CYCLE PROPERTY
이민섭 충청수학회 2008 충청수학회지 Vol.21 No.2
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.
ON SECURE BINARY SEQUENCES GENERATED BY A FUNCTION f(x) = x + (g(x)² v C) mod 2ⁿ
이민섭 충청수학회 2009 충청수학회지 Vol.22 No.4
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)² v C) mod 2ⁿ is a permutation with a single cycle of length 2n if both the least significant bit and the third significant bit in the constant C are 1, where g(x) is a T-function.
On a characterization of secure trinomials on Z2n
이민섭 충청수학회 2016 충청수학회지 Vol.29 No.4
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 Z2n which generates an n-bit word sequence without consecutive elements of period 2n.