• Bulletin of the Korean Chemical Society
• /
• v.25 no.1
• /
• pp.45-50
• /
• 2004

$Cu^{II}$-complexes of N-salicylideneaniline and its derivatives were not light sensitive in most solvents such as acetonitrile. A photo-decomposition occurred upon irradiation in halocarbon solvents such as $CHCl_3$. It has been suggested that such photoreactivity is attributed to the reactivity of charge-transfer to solvent (CTTS) excited state attained upon irradiation. A mechanism has been proposed to account for the results obtained. The complexes have been thermally analysed in nitrogen and static air using thermogravimetry (TG) and derivative thermogravimetry (DTG). The thermal degradation of the complexes proceeds in two or three stages. The kinetic parameters obtained from the Coats-Redfern and Horowitz-Metzger equations show the kinetic compensation effect.

• Review of KIISC
• /
• v.14 no.5
• /
• pp.8-18
• /
• 2004

현재까지 전자투표 프로토콜이 다수 제안되었으나, 선거관리자의 부정 투표, 부정 개표를 투표자 입장에서 막거나 예방할 수 있는 장치들이 부족했다. 이러한 문제들을 단순히 가정(assumption)으로 단정한 후 설계된 프로토콜들은 현실적으로 적용하기에 큰 어려움이 따른다. 어떤 시스템이든 실질적인 서비스가 가능하도록 설계되기 위해서는 현실적인 가정에 근거해야 한다. 본 논문에서 제안하는 시스템은 비현실적인 가정에 의존하지 않고 투표서버와 개표서버의 부정행위를 사전에 예방할 수 있다. 또, 기존 암호 라이브러리를 그대로 사용할 수 있고 국내 PKI와의 연동이 쉬워 "주민투표제"와 전자정부 성격에 부합되는 시스템이다. ElGamal암호 알고리즘, Schnorr 은닉암호와 같이 연산량을 많이 요구하고 암호문이 기하급수적으로 증가되는 알고리즘을 사용하지 않아 계산적으로도 효율적이며, 투표자가 개표결과에 자신의 투표 내용이 올바르게 반영되었는지 확인할 수 있는 안전한 전자투표 시스템이다.자투표 시스템이다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.664-671
• /
• 1999

Itakura and Nakamura proposed the first multisignature scheme based on RSA signature scheme. But if many users sign on one paper, then their scheme has a reblocking problem. In 1991, Ohta and Okamoto proposed a multisignature scheme by using Fiat-Shamir signature scheme. But in this scheme, the group of signers must generate common random number in the first round, and in the second round, they sign the message with common random number. Also L.Harn proposed a multsignature scheme which is based on the ElGamal's. In korea, S.D.Kim et al. at ICEIC'95 conference, proposed an efficient sequential multisignature scheme by using the modified Park-Won scheme. This scheme is not require an additional round to generate common random number, and has fixed signature length. In this paper, we analyze problem of Kim's multisignature scheme, and propose a new multisignature scheme based on ${\gamma}$\ulcorner residuosity problem.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.4
• /
• pp.627-634
• /
• 2010

In this paper we suggest a group key agreement protocol among a group consisting more than 3 PKIs. From an 128 bit message, we produce a group key to any length size using a hash function. With a computer experiment we found that PKI's encryption/decryption time is the most dominant part of this procedure and an 160 bit ECC PKI is the most efficient system for distributing an 128 bit message in practical level. We implement this procedure over an unsecure multi user chatting system which is an open software. And we also show that this suggestion could be practically used in military business without a hardware implementation.

• Annual Conference of KIPS
• /
• 2013.11a
• /
• pp.864-867
• /
• 2013

키 복구 시스템은 1994년 미국 NIST의 키 복구 제품 EES 개발이후 많은 나라에서 활발한 연구가 이루어지고 있는 분야이다. 국내에서도 단일 키 복구 시스템부터 다중 키 복구 시스템을 바탕으로 다양한 키 복구 방식들이 제안되고 있다. 하지만 기존 방식은 단일, 다중 기관시스템에 있어서 낮은 안전성의 문제점을 가지고 있다. 본 논문에서는 기존의 키 복구 시스템을 분석하고 다중 키 복구 기관을 기반으로 키를 N개로 나누어서 분산 보관하며, 키 복구 기관의 기능 상실, 결탁 등 문제에도 키 복구가 가능하도록 설계 하였다. 또한 ElGamal 방식을 이용하여 키 위탁, 키 복구, 합법적인 감청 절차를 제안하였다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.1 no.1
• /
• pp.3-15
• /
• 1991

in 1984 Shamir proposed the concept of ID(identity)-based cryptosystem and digital signature scheme wich does not require any public file for storing the user' s public keys. In this paper, the concept of the ID-based cryptosystem based on discrete logarithm problem using the conven-tional public-key cryptosystems is described, and the implementation method of the ID-based cryptosystem is also presented. The new digital signaturw schme based on the ID-based crypto-system is proposed and possible atacks are considered and analyzed for the security of digital signature scheme. The proposed ID-based schemes are particularrly useful for smart card and personal identification card application.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.417-425
• /
• 2012

In 2010, Sebe et al. proposed an efficient and lightweight mixnet scheme for remote voting systems. The scheme based on a cryptographic secure hash function, does not require complex and costly zero-knowledge proofs of their correct mixing operations, thus they claimed that their scheme is simple and efficient. In this paper, we propose more efficient and fast mixnet scheme than Sebe et al.'s scheme under the same assumption.

• International Journal of Computer Science & Network Security
• /
• v.21 no.4
• /
• pp.289-300
• /
• 2021

Non-abelian group based Cryptography is a field which has become a latest trend in research due to increasing vulnerabilities associated with the abelian group based cryptosystems which are in use at present and the interesting algebraic properties associated that can be thought to provide higher security. When developing cryptographic primitives based on non-abelian groups, the researchers have tried to extend the similar layouts associated with the traditional underlying mathematical problems and assumptions by almost mimicking their operations which is fascinating even to observe. This survey contributes in highlighting the different analogous extensions of traditional assumptions presented by various authors and a set of open problems. Further, suggestions to apply the Hamiltonian Cycle/Path Problem in a similar direction is presented.

• BMB Reports
• /
• v.37 no.3
• /
• pp.370-375
• /
• 2004

There has been increasing interest in the value of using soybean to delay or reduce the tumor incidence. This study was undertaken to investigate the possible protective effects of soybean against hepatocarcinogenesis induced by DL-ethionine. Accordingly, we measured biochemical changes occurring in serum and liver of rats treated with DL-ethionine in the presence or absence of soybean. Male albino rats were fed a control diet containing the hepatocarcinogen, DL-ethionine, or the control diet plus soybean 30%, or the control diet plus soybean plus DL-ethionine 0.25% for three months and then returned to a control diet for up to nine months. Rats fed a control diet plus DL-ethionine showed a gradual decrease in liver DNA, RNA, total protein, and liver weight and enzyme activites of liver transaminases (GOT and GPT) and alkaline phosphatase over the 7-month study period. This was followed by a large increase in the liver parameters at the end of the $9^{th}$ month, except for 5'-nucleotidase and glucose-6-phosphatase that showed a large decrease. On the other hand, a gradual increase in the serum enzyme activities of GOT, GPT, 5-nucleotidase, alkaline phosphatase, and in the albumin/globulin (A/G) ratio is observed in the group of rats fed a control diet plus DL-ethionine compared to the control group over 8 months, and this was followed by a large increase in all serum parameters studied at nine-months. The administration of 30% soybean to the rat diet in addition to DL-ethionine maintained all parameters studied at near control values until the end of the $9^{th}$ month. This study suggests that soybean has a protective effect against the hepatocarcinogenesis induced by DL-ethionine.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.45-52
• /
• 2002

In this contributions, we propose a new MSB(most significant bit) algorithm based on AOP(All One Polynomial) and two parallel semi-systolic architectures to computes $AB^2$over finite field $GF(2^m)$. The proposed architectures are based on standard basis and use the property of irreducible AOP(All One Polynomial) which is all coefficients of 1. The proposed parallel semi-systolic architecture(PSM) has the critical path of $D_{AND2^+}D_{XOR2}$ per cell and the latency of m+1. The modified parallel semi-systolic architecture(WPSM) has the critical path of $D_{XOR2}$ per cell and has the same latency with PSM. The proposed two architectures, PSM and MPSM, have a low latency and a small hardware complexity compared to the previous architectures. They can be used as a basic architecture for exponentiation, division, and inversion. Since the proposed architectures have regularity, modularity and concurrency, they are suitable for VLSI implementation. They can be used as a basic architecture for algorithms, such as the Diffie-Hellman key exchange scheme, the Digital Signature Algorithm(DSA), and the ElGamal encryption scheme which are needed exponentiation operation. The application of the algorithms can be used cryptosystem implementation based on elliptic curve.