• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.10-14
• /
• 2012

When tag privacy is required in radio frequency identification (ID) system, a reader needs to identify, and optionally authenticate, a multitude of tags without revealing their IDs. One approach for identification with lightweight tags is that each tag performs pseudo-random function with his unique embedded key. In this case, a reader (or a back-end server) needs to perform a brute-force search for each tag-reader interaction, whose cost gets larger when the number of tags increases. In this paper, we suggest a simple and efficient identification technique that reduces readers computation to $O$(${\sqrt{N}}$ log$N$) without increasing communication cost. Our technique is based on the well-known "meet-in-the-middle" strategy used in the past to attack symmetric ciphers.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.21-29
• /
• 2001

We show that image make converts of multiplex resolution using wavelet transform algorithm. To evaluate the robustness. we have measured comparison or similarity using various sequences which is inserted important coefficient of middle frequency band. The wavelet transform is advantage that it has a special quality of frequency domain and a special quality of spatial domain. Watermark is used pseudo random number, gaussian sequence, chaos sequence and sobel sequence. As result of experiments, it is to certify that The chaos sequence similarity is higher than other sequence. So the chaos sequence will be used for watermark sequence.

• Communications of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.967-979
• /
• 2019

Chaotic dynamical systems, preferably on a Cantor-like space with some arithmetic operations are considered as good pseudo-random number generators. There are many definitions of chaos, of which Devaney-chaos and pos itive topological entropy seem to be the strongest. Let $A=\{0,1,{\dots},p-1\}$. We define a continuous map on $A^{\mathbb{Z}}$ using addition with a carry, in combination with the shift map. We show that this map gives rise to a dynamical system with positive entropy, which is also Devaney-chaotic: i.e., it is transitive, sensitive and has a dense set of periodic points.

• Journal of Korea Multimedia Society
• /
• v.24 no.3
• /
• pp.406-415
• /
• 2021

The worldwide spread of the Internet and the digital information revolution have resulted in a rapid increase in the use and transmission of multimedia information due to the rapid development of communication technologies. It is important to protect images in order to prevent problems such as piracy and illegal distribution. To solve this problem, I propose a new digital color image encryption algorithm in this paper. I design a new pseudo-random number generator based on 1D five-neighborhood maximum length cellular automata (FN-MLCA) to change the pixel values of the plain image into unpredictable values. And then I use a 3D chaotic cat map to effectively shuffle the positions of the image pixel. In this paper, I propose a method to construct a new MLCA by modeling 1D FN-MLCA. This result is an extension of 1D 3-neighborhood CA and shows that more 1D MLCAs can be synthesized. The safety of the proposed algorithm is verified through various statistical analyses.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.8
• /
• pp.95-101
• /
• 2009

Random numbers are used in many sorts of applications. Some applications, like simple software simulation tests, communication protocol verifications, cryptography verification and so forth, need various levels of randomness with various process speeds. In this paper, we propose a fast pseudorandom generator module for embedded systems. The generator module is implemented in hardware which can run in two modes, one of which can generate random numbers with higher randomness but which requires six cycles, the other providing its result within one cycle but with less randomness. An ASIP (Application Specific Instruction set Processor) was designed to implement the proposed pseudorandom generator instruction sets. We designed a processor based on the MIPS architecture,, by using LISA, and have run statistical tests passing the sequence of the Diehard test suite. The HDL models of the processor were generated using CoWare's Processor Designer and synthesized into the Dong-bu 0.18um CMOS cell library using the Synopsys Design Compiler. With the proposed pseudorandom generator module, random number generation performance was 239% faster than software model, but the area increased only 2.0% of the proposed ASIP.

• Communications for Statistical Applications and Methods
• /
• v.15 no.4
• /
• pp.563-585
• /
• 2008

This paper presents how to improve the efficiency and accuracy in the pricing and sensitivity evaluation for derivatives, since the need for the evaluation of complicated derivatives is increased. The Monte Carlo(MC) simulation using the quasi random number instead of pseudo random number can improve the elapsed time and accuracy for the valuation of European-type derivatives. However, the quasi MC simulation method has its limit for applying it in the multi-dimensional case such as American-type and path-dependent options due to the increased correlation between dimensions as the dimension of random numbers is increased. In order to complement this problem, we develop a modified method in which correlation values are controlled to be below a pre-specified value. Thus, this method is applicable for the pricing of either derivatives ill which underlying assets or risk factors are several or derivatives having path-dependent or early redemption property. Furthermore, we illustrate that it is important to take an appropriate grid interval for the use of finite difference method(FDM) by applying the FDM to one example of non-symmetrical butterfly spreads.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.595-606
• /
• 2011

This paper proposes a robust watermarking scheme for GIS digital map by using the geometric properties of polyline and polygon, which are the fundamental components in vector data structure. In the proposed scheme, we calculate the lengths and the perimeters of all polylines and polygons in a map and cluster them to a number of groups. Then we embed the binary watermark by changing the mean of lengths and perimeters in an embedding group. For improving the safety and robustness, we permute the binary watermark through PRNS(pseudo-random number sequence) processing and embed it repeatedly in a model. Experimental results verified that our scheme has a good invisibility, safety and robustness to various geometric attacks and also our scheme needs not the original map in the extracting process of watermark.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.112-121
• /
• 2003

Information Protection and cryptography technology is developed with if but solved problem of real time processing and secret maintain. Therefore this paper is Proposed new PRN-SEED(Pseudo-Random Number-SEED) for the increasing secret rate and processing rate perform performance analysis with existed other cryptography algorithms. Proposed new PRN-SEED crypto-algorithm increase in the processing rate than existed algorithms use bit and byte mixed operation with RNG(Random Number Generator). PRN-SEED that performs simultaneous operations have higher 1.03 in the processing rate and 2 in the cryptosystem performance than existed cryptosystems. Implementation for PRN-SEED use Synopsys Design Analyser Ver. 1999.10, samsung KG75 library and Synopsys VHDL Debegger. As a simulation result, symmetric cryptosystem DES operate 416Mbps at the 40MHz and Rijndael operate 612Mbps at the 50MHz. PRN-SEED cryptosystem have gate counting 10K and operate 430Mbps at the 40MHz and 630Mbps at the 50MHz.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.6
• /
• pp.367-378
• /
• 2006

A mobile phone has became as a payment tool in e-commerce and on-line banking areas. This trend of a payment system using various types of mobile devices is rapidly growing, especially in the Internet transaction and small-money payment. Hence, there will be a need to define its standard for secure and safe payment technology. In this thesis, we consider the service types of the current mobile payments and the authentication method, investigate the disadvantages, problems and their solutions for smart and secure payment. Also, we propose a novel authentication method which is easily adopted without modification and addition of the existed mobile hardware platform. Also, we present a simple implementation as a demonstration version. Based on virtual machine (VM) approach, the proposed model is to use a pseudo-random number which is confirmed by the VM in a user's mobile phone and then is sent to the authentication site. This is more secure and safe rather than use of a random number received by the previous SMS. For this payment operation, a user should register the serial number at the first step after downloading the VM software, by which can prevent the illegal payment use by a mobile copy-phone. Compared with the previous SMS approach, the proposed method can reduce the amount of packet size to 30% as well as the time. Therefore, the VM-based method is superior to the previous approaches in the viewpoint of security, packet size and transaction time.

• Journal of Korean Society of Forest Science
• /
• v.87 no.3
• /
• pp.366-371
• /
• 1998

To investigate the structure of Korean native species, Abies koreana forest in subalpine zone of Mt. Halla, 20 plots ($10{\times}10m$) set up with random sampling method were surveyed. The forest on subalpine zone in Mt. Halla was Abies koreana - Taxus cuspidata - Sasa quelpaertensis community. High positive correlations were shown between Quercus ${\times}$ grosseserrata and Carpinus laxiflora; Carpinus laxiflora and Acer pseudo-sieboldianum, Ilex crenata; Taxus cuspidata and Rhododendron mucronulatum var. ciliatum, Prunus padus, and high negative correlations were shown between Abies koreana and Quercus ${\times}$ grosseserrata; Abies koreana and Acer pseudo-sieboldianum; Sasa quelpaertensis and Prunes sargentii. Vigor of Abies koreana was depressed, 8.11% of total number of Abies koreana investigated were dead. DBH of dead individuals ranged mainly 10-30 cm.