• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.149-158
• /
• 2012

Proposed is a hybrid randomizing function using two asymptotically optimal randomizing functions: Elias function and Peres function. Randomizing function is an mathematical abstraction of producing a uniform random bits from a source of randomness with bias. It is known that the output rate of Elias function and Peres function approaches to the information-theoretic upper bound. Especially, for each fixed input length, Elias function is optimal. However, its computation is relatively complicated and depends on input lengths. On the contrary, Peres function is defined by a simple recursion. So its computation is much simpler, uniform over the input lengths, and runs on a small footprint. In view of this tradeoff between computational complexity and output efficiency, we propose a hybrid randomizing function that has strengths of the two randomizing functions and analyze it.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.19-30
• /
• 2013

We study sub-Peres functions that are defined recursively as Peres function for random number generation. Instead of using two parameter functions as in Peres function, the sub-Peres functions uses only one parameter function. Naturally, these functions produce less random bits, hence are not asymptotically optimal. However, the sub-Peres functions runs in linear time, i.e., in O(n) time rather than O(n logn) as in Peres's case. Moreover, the implementation is even simpler than Peres function not only because they use only one parameter function but because they are tail recursive, hence run in a simple iterative manner rather than by a recursion, eliminating the usage of stack and thus further reducing the memory requirement of Peres's method. And yet, the output rate of the sub-Peres function is more than twice as much as that of von Neumann's method which is widely known linear-time method. So, these methods can be used, instead of von Neumann's method, in an environment with limited computational resources like mobile devices. We report the analyses of the sub-Peres functions regarding their running time and the exact output rates in comparison with Peres function and other known methods for random number generation. Also, we discuss how these sub-Peres function can be implemented.

• Proceedings of the Korea Contents Association Conference
• /
• 2012.05a
• /
• pp.267-268
• /
• 2012

본 논문에서는 효과적인 영상암호를 위하여 영상을 여러 단계별 블록화 한 뒤 암호화 과정을 수행한다. 이러한 암호화 과정의 효과적인 연산을 위하여 기본 행렬 변환을 이용한 대수적 연산과 비정칙적 복잡 함수의 무작위적 특이성을 이용한다.

• Geophysics and Geophysical Exploration
• /
• v.8 no.1
• /
• pp.41-49
• /
• 2005

We have developed a random heterogeneous velocity model with bimodal distribution in methane hydrate-bearing Bones. The P-wave well-log data have a von Karman type autocorrelation function and non-Gaussian distribution. The velocity histogram has two peaks separated by several hundred metres per second. A random heterogeneous medium with bimodal distribution is generated by mapping of a medium with a Gaussian probability distribution, yielded by the normal spectral-based generation method. By using an ellipsoidal autocorrelation function, the random medium also incorporates anisotropy of autocorrelation lengths. A simulated P-wave velocity log reproduces well the features of the field data. This model is applied to two simulations of elastic wane propagation. Synthetic reflection sections with source signals in two different frequency bands imply that the velocity fluctuation of the random model with bimodal distribution causes the frequency dependence of the Bottom Simulating Reflector (BSR) by affecting wave field scattering. A synthetic cross-well section suggests that the strong attenuation observed in field data might be caused by the extrinsic attenuation in scattering. We conclude that random heterogeneity with bimodal distribution is a key issue in modelling hydrate-bearing Bones, and that it can explain the frequency dependence and scattering observed in seismic sections in such areas.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1202-1205
• /
• 2010

무작위 SQL 삽입 공격 등을 통해 웹서버 해킹 사례가 꾸준히 증가하고 있으며, 대부분의 해킹된 웹서버는 난독화된 자바 스크립트 코드가 웹페이지에 삽입되어 악성코드 경유/유포지로 악용되고 있다. 본 논문에서는 난독화된 자바 스크립트 복원 및 취약한 ActiveX 생성에 사용되는 주요 함수에 대해 후킹 기술을 적용한 브라우저를 이용해서 난독화된 스크립트를 자동으로 해독하고, 악성코드 경유/유포지로 악용되는 웹 서버를 탐지할 수 있는 기술을 제안한다. 또한 제안 기술을 프로토타입 시스템으로 구현하고, 악성 URL 공유 사이트를 통해 수집한 난독화된 자바 스크립트 샘플 분석을 통해 제안한 기술이 높은 악성코드 경유/유포지 탐지율을 보이는 것을 증명한다.

• Korean Journal of Optics and Photonics
• /
• v.17 no.3
• /
• pp.248-255
• /
• 2006

Most optical security systems use a 4-f correlator, Mach-Zehnder interferometer, or a joint transform correlator(JTC). Of them, the JTC does not require an accurate optical alignment and has a good potential for real-time processing. In this paper, we propose an image encryption system using a position shift property of the JTC in the Fourier domain and a random phase image. Our encryption system uses two keys: one key is a random phase mask and the other key is a position shift factor. By using two keys, the proposed method can increase the security level of the encryption system. An encrypted image is produced by the Fourier transform for the multiplication image, which resulted from adding position shift functions to an original image, with a random phase mask. The random phase mask and position shift value are used as keys in decryption, simultaneously. For the decryption, both the encrypted image and the key image should be correctly located on the JTC. If the incorrect position shift value or the incorrect key image is used in decryption, the original information can not be obtained. To demonstrate the efficiency of the proposed system, computer simulation is performed. By analyzing the simulation results in the case of blocking of the encrypted image and affecting of the phase noise, we confirmed that the proposed method has a good tolerance to data loss. These results show that our system is very useful for the optical certification system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12C
• /
• pp.977-983
• /
• 2010

The output values of chaotic functions look highly unpredictable and random-like. These features are in accord with the requirements for secure cryptosystems. For this reason, many kinds of cryptosystems using chaotic functions have been proposed so far. However, most of those algorithms are not applicable for light cryptosystems because they need a high level of computing ability. In this paper, we propose a new light chaotic cryptosystems which are suitable for the systems with a low level of computing ability. From the simulations, we show the performance of proposed cryptosystems on computational complexity and security level.

• Journal of Korean Society of Transportation
• /
• v.27 no.2
• /
• pp.157-168
• /
• 2009

The random utility theory and the multinomial logit model (including a more recent variant--the mixed multinomial logit) derived from it have constituted a back bone for theoretical and empirical analyses of various travel demand features including mode choice. In their empirical applications, however, it is customary to specify random utilities which are linear in modal attributes such as time and cost, and in socio-economic variables. The linearity helps easy derivation of important information such as value of travel time savings by calculating marginal rate of substitution between time and cost. In this paper the author focuses on the very linearity of the random utilities. Taking into account the fact that the mode chooser is also labour supplier, commodity consumer as well as leisure-seeker, the author sets up a maximization model of the traveller, which encompasses various economic activities of the traveller. The author derive from the model the indifference curve defined on the space of modal attributes, time and cost and investigate under what conditions the random utility of the traveller becomes linear. It turns out that there exist the conditions under which the random utility is really linear in modal attributes, but the property does not hold when the traveller has a corner solution on the space of modal attributes, or when the primary utility function of the traveller is directly affected by labour provided and/or the travel time itself. As a corollary of the analysis, a random utility is suggested, approximated up to the second order of the variables involved for empirical studies of the field.

• Proceeding of EDISON Challenge
• /
• 2015.03a
• /
• pp.156-162
• /
• 2015

나노입자의 특성과 기능은 bulk 물질과 달리, 나노 입자를 이루는 원소의 종류 뿐만아니라 크기와 모양에도 밀접한 연관이 있다. 이를 계산화학적으로 예측할 수 있다면 나노입자의 합성과 응용에 큰 도움이 될 것이다. 본 연구에서는 일정한 크기의 은 나노입자의 구조를 계산한 뒤, 바깥쪽의 두 원자 층을 무작위로 섞은 뒤 다시 구조최적화 계산을 거쳐 다양한 나노입자들의 구조를 찾았다. 이렇게 구해진 구조들의 에너지를 계산하고 원자를 하나 떼어낼 때의 에너지를 계산하여 응집 에너지를 구해 경향성을 분석해 보았다. 더 나아가, 나노입자를 이루는 각 원자 층의 개수가 하나 더 커질 때 필요한 에너지를 계산하여, 원자 하나당 평균을 내어 분석해보았다. 본 연구에서는 병렬화 된 밀도범함수이론 계산 프로그램을 이용해 100개가 넘는 입자의 계산이 가능하다는 것을 확인했고, 은 나노입자의 크기가 증가함에 따라 원자 하나가 추가되는 경우와, 원자 층 하나가 추가되는 경우의 그래프를 보고 경향성을 분석하였다. 이는 다른 화학적 환경에 있는 은 원자의 에너지를 계산하여 각각의 환경에서의 은 나노 입자의 크기를 예측하는 계산하는 데 초석이 될 것이다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.3
• /
• pp.10-19
• /
• 2009

In this paper, an efficient optical watermark method using multiple phase wrapping and real-valued decoding key is proposed. In the embedding process, two zero-padded original images placed in two quadrants on input plane are multiplied with two statistically independent random phase patterns and are Fourier transformed, respectively. Two encoded images are obtained by taking the real-valued data from these Fourier transformed images. And then two phase-encoded patterns, used as a hidden image and a decoding key, are generated by the use of multiple phase wrapping from each of the encoded images. A transmitted image is made from the linear superposition of the weighted hidden images and a cover image. In reconstruction process, the mirror reconstructed images can be obtained at all quadrants by the inverse-Fourier transform of the product of the transmitted image and the decoding key. Computer simulation and optical experiment are demonstrated in order to confirm the proposed method.