• The Journal of Society for e-Business Studies
• /
• v.9 no.1
• /
• pp.209-220
• /
• 2004

If protocol has fast operations and short key length, it can be efficient user authentication protocol. Lenstra and Verheul proposed XTR. XTR have short key length and fast computing speed. Therefore, this can be used usefully in complex arithmetic. In this paper, to design efficient user authentication protocol we used a subgroup of Galois Field to problem domain. Proposed protocol does not use GF(p/sup 6/) that is existent finite field, and uses GF(p²) that is subgroup and solves problem. XTR-ElGamal based user authentication protocol reduced bit number that is required when exchange key by doing with upside. Also, proposed protocol provided easy calculation and execution by reducing required overhead when calculate. In this paper, we designed authentication protocol with y/sub i/ = g/sup b.p/sup 2(i-1)//ㆍv mol q, 1(equation omitted) 3 that is required to do user authentication.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.1
• /
• pp.108-113
• /
• 2008

A proposed system can decrypt each contents block through a double buffer algorithm which can continually buffer contents by dividing a multimedia contents into some blocks and provides more improved method of encryption than existing system by being not capable of decrypting the whole multimedia contents if one key is exposed. Also, using digital signature and public encryption algorithm for mutual authentication between systems, this paper proposes the system which sends and encrypts symmetric keys for contents encryption through SOAP messages.

• Journal of Microbiology and Biotechnology
• /
• v.13 no.6
• /
• pp.989-992
• /
• 2003

Recombinant human tissue plasminogen activator deletion mutein (Reteplase) is a clinically promising thrombolytic drug. Reteplase cDNA was subcloned into a bacteria expression system, and the resultant recombinant was biologically characterized. The Reteplase was expressed in Escherichia coli as an inclusion body, and the downstream processes of the Reteplase inclusion body included denaturation, renaturation, and purification. A protein disulfide isomerase (PDI) was used to assist the refolding of Reteplase, and it was found to increase the refolding rate from less than 2％ to more than 20％. The refolded Reteplase was purified through two chromatography steps, including lysine-coupled agarose affinity chromatography and then CM-sepharose cation-exchange chomatography. The purity of r-PA was analyzed by Western bolt analysis, and N-terminal amino acid and amino acid composition analyses confirmed the end-product. Reteplase showed higher thrombolytic potency in an animal thrombus model.

• ETRI Journal
• /
• v.34 no.1
• /
• pp.102-105
• /
• 2012

To serve the growing demand of the bidirectional information exchange, we propose a single relay selection (RS) scheme for physical-layer network coding (PNC) in a bidirectional cooperative network consisting of two sources and multiple relays. This RS scheme selects a single best relay by maximizing the bottleneck of the capacity region of both information flows in the bidirectional network. We show that the proposed RS rule minimizes the outage probability and that it can be used as a performance benchmark for any RS rules with PNC. We derive a closed-form exact expression of the outage probability for the proposed RS rule and show that it achieves full diversity gain. Finally, numerical results demonstrate the validity of our analysis.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.1
• /
• pp.33-42
• /
• 1999

지금까지의 bitonic sorting 에 대한 연구는 N 개의 key를 정렬하기 위해서는 N/2(or N)개의 프로세서가 필요하였다. 여기서는 프로세서의 수가 정렬하고자 하는 key 수에 독립적이고 또한 N/2개 이하인 경우를 고려하였다. 따라서 본 연구에서는 공유 메모리 병렬 컴퓨터 환경에서 N 개의 Key를 고정도니 수의 프로세서를 사용하여 O(log2N) 시간에 정렬 할 수 있는 두 종류의 범용 bitonic sorting 알고리즘을 구현하였다. 첫째로, VITURAL-GPBS 알고리즘은 하나의 프로세서를 사용하여 여러 개의 프로세서가 하는 역할을 모방하므로써 정렬을 수행하도록 하였다. 둘째로, VIRTUAL-GPBS 알고리즘보다 좀 더 효율적이고 빠른 FAST-GPBS 알고리즘을 소개하였다. 두 알고리즘의 주요 차이점은 FAST-GPBS 알고리즘에서는 각각의 프로세서에 배정된 여러 개의 key를 각 프로세서 내에서 가장 빠른 순차 정렬 알고리즘을 사용하면서 먼저 지역적으로 정렬을 함으로써 VIRTUAL-GPBS 보다 효율이 50% 이상 향상된 정렬을 수행할 수 있도록 하였다. FAST-GPBS 알고리즘은 compare-exchange 대신 merge-split 작업을 함으로써 컴퓨터의 사용 효율을 향상시킬 수 있다.

• Journal of Microbiology and Biotechnology
• /
• v.24 no.6
• /
• pp.788-794
• /
• 2014

An extracellular ${\beta}$-glucosidase from Aspergillus niger Au0847 was purified to homogeneity by precipitation with ammonium sulfate, anion exchange, and gel filtration. The purified protein was composed of two subunits with molecular masses of 110 and 120 kDa. Au0847 ${\beta}$-glucosidase exhibited relatively high thermostability and pH stability, and its highest activity was obtained at $65^{\circ}C$ and pH 4.6, respectively. As a potential metalloprotein, its enzymatic activity was potently stimulated by manganese ion and DTT. The ${\beta}$-glucosidase displayed avid affinity and high catalytic efficiency for geniposide. Au0847 ${\beta}$-glucosidase has potential value as an industrial enzyme for the hydrolysis of geniposide to genipin.

• Journal of information and communication convergence engineering
• /
• v.12 no.1
• /
• pp.19-25
• /
• 2014

The wireless sensor networking standard DASH7 operates in low-power communication with a better transmission quality in active RFID networks. The DASH7 security standard supports public key cryptography. At present, the DASH7 standard uses the message authentication code in the network layer for authentication and integrity. However, its security standard is still in an incubation stage with respect to the implementation of a crypto exchange over a DASH7 network. Effective key management is an important factor for privacy and security. If organizations are not careful about where and how keys are stored, they leave the encrypted data vulnerable to theft. In this regard, we present a key management system designed for efficient key management through public key infrastructure authentication as well as a non-repudiation feature for the DASH7 standard. We analyze the performance of the proposed system on a basis of various performance criteria such as latency and throughput.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.3
• /
• pp.59-65
• /
• 2023

As research on blockchain applications in various fields is actively increasing, management of private keys that prove users of blockchain has become important. If you lose your private key, you lose all your data. In order to solve this problem, previously, blockchain wallets, private key recovery using partial information, and private key recovery through distributed storage have been proposed. In this paper, we propose a safe private key backup and recovery method using Shamir's Secrete Sharing (SSS) scheme and biometric information, and evaluate its safety. In this paper, we propose a safe private key backup and recovery method using Shamir's Secrete Sharing (SSS) scheme and biometric information, and evaluate its safety against robustness during message exchange, replay attack, man-in-the-middle attack and forgery and tampering attack.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2442-2454
• /
• 2012

To ensure the security of wireless sensor networks, it is important to have a robust key management scheme. In this paper, we propose a Quorum-based key management scheme. A specific sensor, called as key distribution server (KDS), generates a key matrix and establishes a quorum system from the key matrix. The quorum system is a set system of subsets that the intersection of any two subsets is non-empty. In our scheme, each sensor is assigned a subset of the quorum system as its pre-distributed keys. Whenever any two sensors need a shared key, they exchange their IDs, and then each sensor by itself finds a common key from its assigned subset. A shared key is then generated by the two sensors individually based on the common key. By our scheme, no key is needed to be refreshed as a sensor leaves the network. Upon a sensor joining the network, the KDS broadcasts a message containing the joining sensor ID. After receiving the broadcast message, each sensor updates the key which is in common with the new joining one. Only XOR and hash operations are required to be executed during key update process, and each sensor needs to update one key only. Furthermore, if multiple sensors would like to have a secure group communication, the KDS broadcasts a message containing the partial information of a group key, and then each sensor in the group by itself is able to restore the group key by using the secret sharing technique without cooperating with other sensors in the group.

• Journal of Internet Computing and Services
• /
• v.8 no.6
• /
• pp.1-8
• /
• 2007

The Mobile Ad-hoc network does environmental information which an individual collects in nodes which are many as the kernel of the USN technology based on the radio communication. And it is the latest network description delivering critical data to the destination location desiring through a multi-hop. Recently, the Ad-hoc network relative technique development and service are activated. But the security function implementation including an authentication and encoding about the transmitted packets, and etc, is wirelessly the insufficient situation on the Ad-hoc network. This paper provides the security service of key exchange, key management. entity authentication, data enciphering, and etc on the Mobile Ad-hoc network. It implements with the Ad-hoc network security management server system design which processes the security protocol specialized in the Ad-hoc network and which it manages.