Entity

Time filter

Source Type


Jeon Y.-S.,Information Security Research Division | Kim Y.-J.,Sun Moon University | Lee D.-H.,Kyungpook National University
Journal of Circuits, Systems and Computers | Year: 2010

This paper presents a resource-shared 8-bit (RS8) architeture for the AES algorithm, which aims at compacting the hardware architecture and allows hardware resources to be shared efficiently between encryption and decryption without using a memory. The RS8 architecture only requires one combined S-box/S-1-box for encryption, decryption and key expansion. The RS8 architecture implements the multiplicative inverse in the composite field GF((24)2) with resource sharing methods. In addition, the number of XOR gates used by the proposed combined MixColumns/InvMixColumns module is less than half that of the conventional 32-bit architecture. When comparing the RS8 architecture with the conventional 32-bit architecture on a Xilinx Spartan2 FPGA, the number of total equivalent slices is reduced by 51%. Additionally, the highest operation frequency of the RS8 architecture is 66 MHz, and the throughput is 24 Mbps. Therefore, the performance of the RS8 architecture is sufficient for low-area applications such as wireless network devices and radio frequency identification (RFID). © 2010 World Scientific Publishing Company. Source


Kang J.-S.,Kookmin University | Hong D.,Information Security Research Division
Communications in Computer and Information Science | Year: 2011

The objective of the private scalar product protocol is that the participants obtain the scalar product of the private vectors of all parties without disclosure of all the private vectors. Private scalar product protocol is an important fundamental protocol in secure multi-party computation, and it is widely used in privacy-preserving scientific computation, statistical analysis and data mining. Up to now several private scalar protocols have been proposed in order to meet the need for more efficient and more practical solutions. However it seems that these efforts are unsuccessful from the security point of view. In this paper we show that two fast private scalar product protocols, which were recently proposed as very efficient secure protocols, are insecure. © 2011 Springer-Verlag. Source


Bae K.,Kyungpook National University | Moon S.,Kyungpook National University | Choi D.,Information Security Research Division | Choi Y.,Information Security Research Division | And 2 more authors.
Advances in Information Sciences and Service Sciences | Year: 2012

This paper presents a practical differential fault analysis method for the Advanced Encryption Standard (AES) with a reduced round using a semi-invasive fault injection. We adapt the round reduction fault technique on AES in order to skip the last iterations of 'for' loop procedure. We can deduce the AES 128-bit secret key using 2 16 exhaustive searches with two pairs of correct and faulty ciphertexts. We also verified the feasibility of our proposed DFA by a fault injection experiment on an ATmega128 microcontroller chip. Source


Lee S.,Information Security Research Division | Kim G.,Korea Advanced Institute of Science and Technology | Kim S.,Korea Advanced Institute of Science and Technology
Expert Systems with Applications | Year: 2011

As recent Internet threats are evolving more rapidly than ever before, one of the major challenges in designing an intrusion detection system is to provide early and accurate detection of emerging threats. In this study, a novel framework is developed for fully unsupervised training and online anomaly detection. The framework is designed so that an initial model is constructed and then it gradually evolves according to the current state of online data without any human intervention. In the framework, a self-organizing map (SOM) that is seamlessly combined with K-means clustering is transformed into an adaptive and dynamic algorithm suitable for real-time processing. The performance of the proposed approach is evaluated through experiments using the well-known KDD Cup 1999 data set and further experiments using the honeypot data recently collected from Kyoto University. It is shown that the proposed approach can significantly increase the detection rate while the false alarm rate remains low. In particular, it is capable of detecting new types of attacks at the earliest possible time. © 2011 Elsevier Ltd. All rights reserved. Source


Park J.H.,Kyungpook National University | Park E.Y.,Kyungpook National University | Moon S.J.,Kyungpook National University | Choi D.H.,Information Security Research Division | And 2 more authors.
Proceeding - 5th International Conference on Computer Sciences and Convergence Information Technology, ICCIT 2010 | Year: 2010

This paper considers a secure and efficient CRT-RSA scheme resistant to fault attacks. Recently, Boscher et al. proposed a secure CRT-RSA scheme by verifying signature using a public exponent. However, it is almost two times slower compared to the classical CRT-RSA signature when the exponent is expected to be a long number. We present a low-cost and secure CRT-RSA scheme by generating a small exponent for checking the correctness of signature. Furthermore, since our scheme can use fast double exponentiation algorithm based on right-to-left binary method having two exponents, it has low computational load compared to other existing schemes. Source

Discover hidden collaborations