• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.471-485
• /
• 2023

As data sharing increases explosively, such information encoded in QR code is completely public as private messages are not securely protected. This paper proposes a new 'PROMISE' framework for hiding information based on the QR code projection matrix by using image segmentation without modifying the essential QR code characteristics. Projection matrix mapping, matrix scrambling, fusion image segmentation and steganography with SEL(secret embedding logic) are part of the PROMISE framework. The QR code could be mapped to determine the segmentation site of the fusion image as a binary information matrix. To further protect the site information, matrix scrambling could be adopted after the mapping phase. Image segmentation is then performed on the fusion image and the SEL module is applied to embed the secret message into the fusion image. Matrix transformation and SEL parameters should be uploaded to the server as the secret key for authorized users to decode the private message. And it was possible to further obtain the private message hidden by the framework we proposed. Experimental findings show that when compared to some traditional information hiding methods, better anti-detection performance, greater secret key space and lower complexity could be obtained in our work.

• Bulletin of the Korean Chemical Society
• /
• v.23 no.9
• /
• pp.1247-1252
• /
• 2002

Mass-analyzed threshold ionization (MATI) technique is optimized to generate substantial amount of state-selected molecular ions sufficient for dynamics study. The main strategy is to stabilize intermediate (n = 100- 200) Rydberg states by l,m-mix ing induced by AC field. Electrical jitter inherent in high voltage switching is utilized for this purpose. A related technique to locate the MATI onset is also described.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.637-646
• /
• 2011

Cho and Kim [4] and Kim [6] introduced the concept of the competition index of a digraph. Cho and Kim [4] and Akelbek and Kirkland [1] also studied the upper bound of competition indices of primitive digraphs. In this paper, we study the upper bound of competition indices of strongly connected digraphs. We also study the relation between competition index and ordinary index for a symmetric strongly connected digraph.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7B
• /
• pp.1320-1325
• /
• 2000

A very simple and effective peak power reduction scheme for a downlink OFDM-CDMA system is proposed using the relationship between peak-to-average power ratio (PAPR) and out-of-phase autocorrelation. Since power spectrum and autocorrelation function are Fourier transform pair, the PAPR property of the sequences can be estimated by the out-of-phase autocorrelation function of the spreading sequences. Thus, by scrambling the spread data in the frequency domain, we can reduce the sidelobe energy of autocorrelation, and at last, suppress PAPR in the proposed OFDM-CDMA system.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.943-957
• /
• 2001

In this paper, we propose an efficient encryption algorithm, without exchanging session keys of a symmetric cryptosystem. The proposed scheme, called as the FAKE(Fast Asymmetric Key Encryption), first scrambles an entire input message and then encrypts small parts of the scrambled message using an asymmetric key encryption scheme. We use the all-or-nothing transform based on the hash function as a scrambling function, which was proposed by Shin, et al. Furthermore, the proposed scheme can additionally provide a digital signature service with only small overhead.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.533-536
• /
• 2003

본 논문에서는 전화선을 이용한 고속 홈네트워크인 HomePNA 2.0 시스템에서 HomePNA 2.0 (H2) 프레임을 만들기 위한 프레임 프로세싱 중, 다항식 나누기 연산을 통한 CRC (Cyclic Redundancy Check) 16비트 생성, HCS (Header Check Sequence) 8비트 생성 및 혼화(Scrambling) 처리에 있어서 입력 8 비트를 동시에 병렬 처리함으로써 기존의 1 비트 입력을 LFSR (Linear Feedback Shift Register)를 사용한 다항식 나누기 연산을 수행했을 때보다 빠른 속도로 H2 프레임을 구현하고자 하는 고속 처리 기법을 제시하고 이의 성능을 검증하였다.

• Journal of the Optical Society of Korea
• /
• v.2 no.1
• /
• pp.38-41
• /
• 1998

The method of using fiber speckle patterns can be applied to the multiplexing of volume holograms. Fiber speckle patterns enable various multiplexing techniques such as shift, angular, and mode-scrambling methods Hybrid methods involving more than one multiplexing technique are also possible. Some images are stored and retrieved with one or two of multiplexing methods, and the experimental results are discussed.

• The Korean Journal of Ecology
• /
• v.21 no.6
• /
• pp.739-750
• /
• 1998

Forest-edge communities dominated by heliophytic scrambling species were first studied using the Zurich-Montpellier school's method in South Korea. Mallotetum japonicae, Clerodendretum trichotomae, Akebietum quinatae, Lonicero-Puerarietum lobatae, Spiraetum salicifoliae, dioscoreo-Actinidietum argutae, Sorbarietum stellipilae, Tripterygietum regelii were distinguished and described. Most syntaxa are suggested as now. The order Dioscoreo-Puerarietalia lobatae of the Rosetea multiflorae is representative of the Korean mantle vegetation, which subordinates the Lonicero-Puerarion lobatae and the Dioscoreo-Actinidion argutae. synecological characteristics of all syntaxa were briefly noted.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1992.11a
• /
• pp.55-70
• /
• 1992

기존의 음성 정보 보호 방식의 단점인 비화의 감소, 키 수의 제한, 상관 관계를 이용한 제3자의 해독 둥의 문제점을 해결할 수 있는 호핑 필터를 이용한 이차원 진폭 스크램블링은 현대 아날로그 음성 신호에 있어서 강력한 비화 방식이다. 본 논문에서는 KAISER WINDOW FIR 필터를 이용하여 호핑 필터를 구성하였으며, 이차원진폭 스크램블링 알고리즘의 최대 단점인 동기(synchronization)문제를 해결하기 위하여 variable delay를 이용한 알고리즘을 제안하였다. 또한, 시뮬레이션을 통하여 디지탈 신호에도 응용·고찰하였다.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.391-392
• /
• 2007

Changeable biometries has been suggested as a solution to the problems of enhancing privacy. In this paper, we proposed changeable biometrics for face recognition using on ICA based approach. ICA coefficient vector extracted from an input face image. The vector is scrambled randomly and a new face template is generated by addition of a couple of scrambled coefficients. When a transformed template is compromised, it is replaced by a new scrambling rule and addition.