Search | Korea Science

김남연;고대곤;유기영
- Journal of KIISE:Computer Systems and Theory
- /
- v.30 no.1
- /
- pp.50-58
- /
- 2003
Among finite field arithmetic operations, the $AB^2$ operation is known as an efficient basic operation for public key cryptosystems over $GF(2^m)$,Division/Inversion is computed by performing the repetitive AB$^2$ multiplication. This paper presents two new $AB^2$algorithms and their systolic realizations in finite fields $GF(2^m)$.The proposed algorithms are based on the MSB-first scheme using standard basis representation and the proposed systolic architectures for $AB^2$ multiplication have a low hardware complexity and small latency compared to the conventional approaches. Additionally, since the proposed architectures incorporate simplicity, regularity, modularity, and pipelinability, they are well suited to VLSI implementation and can be easily applied to inversion architecture. Furthermore, these architectures will be utilized for the basic architecture of crypto-processor.
PDF KSCI

Kim, Jong Bae
- KIPS Transactions on Software and Data Engineering
- /
- v.4 no.4
- /
- pp.201-208
- /
- 2015
This paper proposes a method for detecting the direction indicator shown in the road surface efficiently from the black box system installed on the vehicle. In the proposed method, the direction indicators are detected by inverse perspective mapping(IPM) and bag of visual features(BOF)-based NN classifier. In order to apply the proposed method to real-time environments, the candidated regions of direction indicator in an image only performs IPM, and BOF-based NN is used for the classification of feature information from direction indicators. The results of applying the proposed method to the road surface direction indicators detection and recognition, the detection accuracy was presented at least about 89%, and the method presents a relatively high detection rate in the various road conditions. Thus it can be seen that the proposed method is applied to safe driving support systems available.
https://doi.org/10.3745/KTSDE.2015.4.4.201 인용 PDF KSCI

Choi, Young-Min;Kwon, Yong-Jin
- Journal of KIISE:Computing Practices and Letters
- /
- v.7 no.6
- /
- pp.696-702
- /
- 2001
In this paper, we design IDEA cipher algorithm which is cryptographically superior to DES. To improve the encryption throughput, we propose an efficient design methodology for high-speed implementation of multiplicative inverse modulo $2^{15}$+1 which requires the most computing powers in IDEA. The efficient hardware architecture for the multiplicative inverse in derived from applying of Fermat's Theorem. The computing powers for multiplicative inverse in our proposal is a decrease 50% compared with the existing method based on Extended Euclid Algorithm. We implement IDEA by applying a single iterative round method and our proposal for multiplicative inverse. With a system clock frequency 20MGz, the designed hardware permits a data conversion rate of more than 116 Mbit/s. This result show that the designed device operates about 2 times than the result of the paper by H. Bonnenberg et al. From a speed point of view, out proposal for multiplicative inverse is proved to be efficient.
PDF

이찬호;이종호
- Journal of the Institute of Electronics Engineers of Korea SD
- /
- v.40 no.12
- /
- pp.80-86
- /
- 2003
Elliptic curve cryptosystem(ECC) offers the highest security per bit among the known publick key system. The benefit of smaller key size makes ECC particularly attractive for embedded applications since its implementation requires less memory and processing power. In this paper, we propose a new multiplier structure with configurable output sizes and operation cycles. The number of output bits can be freely chosen in the new architecture with the performance-area trade-off depending on the application. Using the architecture, a 193-bit normal basis multiplier and inversion unit are designed in GF(2$^{m}$ ). It is implemented using HDL and 0.35${\mu}{\textrm}{m}$ CMOS technology and the operation is verified by simulation.
PDF KSCI