• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.11
• /
• pp.196-201
• /
• 2016

Digital watermarking is a technique used to hide information within digital media. Digital watermarking techniques can be classified as either robust watermarking or fragile watermarking. Robust watermarking techniques are generally used for the purpose of copyright protection. In addition, fragile watermarking techniques are used for the authentication and integrity verification of a digital image. Therefore, fragile watermarks should be easily breakable for trivial tampering of a watermarked image. This paper proposes an efficient fragile watermarking method for image tamper detection in the spatial domain. In the proposed method, a hash code and symmetric key encryption algorithm are used. The proposed method of inserting a watermark by dividing the original image into many blocks of small sizes is not weak against attacks, such as cut and paste. The proposed method can detect the manipulated parts of a watermarked image without testing the entire block of the image.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.171-181
• /
• 2012

This paper defines the AES password algorithm used as a symmetric-key-based password algorithm, and proposes the design of parallel password algorithm to utilize the resources of multi-core processor as much as possible. The proposed parallel password algorithm was confirmed for parallel execution of password computation by allocating the password algorithm according to the number of cores, and about 30% of performance increase compared to AES password algorithm. The encryption/decryption performance of the password algorithm was confirmed through binary comparative analysis tool, which confirmed that the binary results were the same for AES password algorithm and proposed parallel password algorithm, and the decrypted binary were also the same. The parallel password algorithm for multi-core environment proposed in this paper can be applied to authentication/payment of financial service in PC, laptop, server, and mobile environment, and can be utilized in the area that required high-speed encryption operation of large-sized data.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.99-114
• /
• 2012

Proxy Mobile IPv6 (PMIPv6) has received considerable attention between telecommunications and the Internet communities and does not require active participation of the Mobile Node (MN) by way of network-based mobility management. The PMIPv6 domain is studying establishment in progress to support extensively a number of MN by using a low handover latency. In this research, we are propose a novel 3S scheme for building Scalable and Secure and Seamless PMIPv6 domains. In the proposed scheme, all of Mobility Access Gateway (MAG) are acting as the Local Mobility Anchor (LMA) and composing a virtual ring with another MAG. General hashing is used in the efficient distribution-mapping between each MN and the MN's LMA of all MAGs. And, MAG and MN are authenticated using the symmetric key. Through mathematical analysis, we verifies the safety, scalability, and seamless service for 3S. Also, we're propose a handover procedure of 3S and show better than the existing schemes in terms of handover latency.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.23-29
• /
• 2015

The baby-step giant-step algorithm seeks b in a discrete logarithm problem when a,c,p of $a^b{\equiv}c$(mod p) are already given. It does so by dividing p by m block of $m={\lceil}{\sqrt{p}}{\rceil}$ length and letting one giant walk straight toward $a^0$ with constant m strides in search for b. In this paper, I basically reduce $m={\lceil}{\sqrt{p}}{\rceil}$ to p/l, $a^l$ > p and replace a giant with an adult who is designed to walk straight with constant l strides. I also extend the algorithm to allow $2^k$ adults to walk simultaneously. As a consequence, the proposed algorithm quarters the execution time of the basic adult-walk method when applied to $2^k$, (k=2) in the range of $1{\leq}b{\leq}p-1$. In conclusion, the proposed algorithm greatly shorten the step number of baby-step giant-step.

• School Mathematics
• /
• v.13 no.3
• /
• pp.405-422
• /
• 2011

In this study, we consider the meaning of one-to-one correspondence through theoretical background under operation of matrix. On algebraic point of view, its significance is 'through one-to-one correspondence from a set with given structure, become a methods in order to induce an algebraic system in to a new set.' That is a key idea making isomorphic structure. Such process experiences necessity of mathematical fact, as well as the deep understanding of one-to-one correspon -dence. Also that becomes a base for develop a various mathematical concepts, such as matrix, exponential laws, symmetric difference, permutation and so on. This study help teachers and students to understand of mathematical concepts meaningfully and to facilitate teacher's professional development.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2010.08a
• /
• pp.157-157
• /
• 2010

Vertical-structure light-emitting diodes (V-LEDs) by laser lift-off (LLO) have been exploited for high-efficiency GaN-based LEDs of solid-state lightings. In V-LEDs, emitted light from active regions is reflected-up from reflective ohmic contacts on p-GaN. Therefore, silver (Ag) is very suitable for reflective contacts due to its high reflectance (>95%) and surface plasmon coupling to visible light emissions. In addition, low contact resistivity has been obtained from Ag-based ohmic contacts annealed in oxygen ambient. However, annealing in oxygen ambient causes Ag to be oxidized and/or agglomerated, leading to degradation in both electrical and optical properties. Therefore, preventing Ag from oxidation and/or agglomeration is a key aspect for high-performance V-LEDs. In this work, we demonstrate the enhanced thermal stability of Ag-based Ohmic contact to p-GaN by reducing the thermal compressive stress. The thermal compressive stress due to the large difference in CTE between GaN ($5.6{\times}10^{-6}/^{\circ}C$) and Ag ($18.9{\times}10^{-6}/^{\circ}C$) accelerate the diffusion of Ag atoms, leading to Ag agglomeration. Therefore, by increasing the additional residual tensile stress in Ag film, the thermal compressive stress could be reduced, resulting in the enhancement of Ag agglomeration resistance. We employ the thin Ni layer in Ag film to form Ni/Ag mutli-layer structure, because the lattice constant of NiO ($4.176\;{\AA}$ is larger than that of Ag ($4.086\;{\AA}$). High-resolution symmetric and asymmetric X-ray diffraction was used to measure the in-plane strain of Ag films. Due to the expansion of lattice constant by oxidation of Ni into NiO layer, Ag layer in Ni/Ag multi-layer structure was tensilely strained after annealing. Based on experimental results, it could be concluded that the reduction of thermal compressive stress by additional tensile stress in Ag film plays a critical role to enhance the thermal stability of Ag-based Ohmic contact to p-GaN.

• Journal of KIISE:Software and Applications
• /
• v.35 no.2
• /
• pp.128-136
• /
• 2008

Recognition of parallel structure at early stage of sentence parsing can reduce the complexity of parsing. In this paper, we propose an unsupervised language-independent probabilistic model for recongition of parallel noun structures. The proposed model is based on the idea of swapping constituents, which replies the properties of symmetry (two or more identical constituents are repeated) and of reversibility (the order of constituents is inter-changeable) in parallel structures. The non-symmetric patterns that cannot be captured by the general symmetry rule are resolved additionally by the modifier information. In particular this paper shows how the proposed model is applied to recognize Korean parallel noun phrases connected by "wa/kwa" particle. Our model is compared with other models including supervised models and performs better on recongition of parallel noun phrases.

• Journal of Internet Computing and Services
• /
• v.20 no.6
• /
• pp.119-127
• /
• 2019

This paper proposes a new authentication model to solve the problem of personal information takeover and personal information theft by service providers using centralized servers for user authentication and management of personal information. The centralization issue is resolved by providing user authentication and information storage space through a decentralize platform, blockchain, and ensuring confidentiality of information through user-specific symmetric key encryption. The proposed model was implemented using the public-blockchain Ethereum and the web-based wallet extension MetaMask, and users access the Ethereum main network through the MetaMask on their browser and store their encrypted personal information in the Smart Contract. In the future, users will provide their personal information to the service provider through their Ethereum Account for the use of the new service, which will provide user authentication and personal information without subscription or a new authentication process. Service providers can reduce the costs of storing personal information and separate authentication methods, and prevent problems caused by personal information leakage.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.47-52
• /
• 2008

A radio-frequency identification(RFID) tag is a small, inexpensive microchip that emits an identifier in response to a query from a nearby reader. The price of these tags promises to drop to the range of $0.05 per unit in the next several years, offering a viable and powerful replacement for barcodes. The challenge in providing security for low-cost RFID tags is that they are computationally weak devices, unable to perform even basic symmetric-key cryptographic operations. Security researchers often therefore assume that good privacy protection in RFID tags is unattainable. In this paper, we explore a notion of minimalist cryptography suitable for RFID tags. We consider the type of security obtainable in RFID devices with a small amount of rewritable memory, but very limited computing capability. Our aim is to show that standard cryptography is not necessary as a starting point for improving security of very weak RFID devices. Our contribution is threefold: 1. We propose a new formal security model for authentication and privacy in RFID tags. This model takes into account the natural computational limitations and the likely attack scenarios for RFID tags in real-world settings. It represents a useful divergence from standard cryptographic security modeling, and thus a new view of practical formalization of minimal security requirements for low-cost RFID-tag security. 2. We describe protocol that provably achieves the properties of authentication and privacy in RFID tags in our proposed model, and in a good practical sense. Our proposed protocol involves no computationally intensive cryptographic operations, and relatively little storage. 3. Of particular practical interest, we describe some reduced-functionality variants of our protocol. We show, for instance, how static pseudonyms may considerably enhance security against eavesdropping in low-cost RFID tags. Our most basic static-pseudonym proposals require virtually no increase in existing RFID tag resources.

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