• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.109-116
• /
• 2018

This paper describes an area-efficient design of SHA-256 hash function that is widely used in various security protocols including digital signature, authentication code, key generation. The SHA-256 hash processor includes a padder block for padding and parsing input message, so that it can operate without software for preprocessing. Round function was designed with a 16-bit data-path that processed 64 round computations in 128 clock cycles, resulting in an optimized area per throughput (APT) performance as well as small area implementation. The SHA-256 hash processor was verified by FPGA implementation using Virtex5 device, and it was estimated that the throughput was 337 Mbps at maximum clock frequency of 116 MHz. The synthesis for ASIC implementation using a $0.18-{\mu}m$ CMOS cell library shows that it has 13,251 gate equivalents (GEs) and it can operate up to 200 MHz clock frequency.

• Journal of IKEEE
• /
• v.22 no.4
• /
• pp.886-895
• /
• 2018

This paper describes a hardware design of the Secure Hash Algorithm-3 (SHA-3) hash functions that are the latest version of the SHA family of standards released by NIST, and an implementation of ARM Cortex-M0 interface for security SoC applications. To achieve an optimized design, the tradeoff between hardware complexity and performance was analyzed for five hardware architectures, and the datapath of round block was determined to be 1600-bit on the basis of the analysis results. In addition, the padder with a 64-bit interface to round block was implemented in hardware. A SoC prototype that integrates the SHA-3 hash processor, Cortex-M0 and AHB interface was implemented in Cyclone-V FPGA device, and the hardware/software co-verification was carried out. The SHA-3 hash processor uses 1,672 slices of Virtex-5 FPGA and has an estimated maximum clock frequency of 289 Mhz, achieving a throughput of 5.04 Gbps.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.3
• /
• pp.533-544
• /
• 2021

Using Shor algorithm, factoring and discrete logarithm problem can be solved effectively. The public key cryptography, such as RSA and ECC, based on factoring and discrete logarithm problem can be broken in polynomial time using Shor algorithm. NIST has been conducting a PQC(Post Quantum Cryptography) standardization process to select quantum-resistant public key cryptography. The multivariate quadratic based signature scheme, which is one of the PQC candidates, is suitable for IoT devices with limited resources due to its short signature and fast sign and verify process. We analyzes classic attacks and quantum attacks for Rainbow which is the only multivatiate quadratic based signature scheme to be finalized up to the round 3. Also we compute the attack complexity for the round 3 Rainbow parameters, and analyzes the security level of Rainbow, one of the PQC standardization candidates.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.12
• /
• pp.673-681
• /
• 2004

As the use of digital videos is getting popular, there is an increasing demand for efficient browsing and retrieval of video. To support such operations, effective video indexing should be incorporated. One of the most fundamental steps in video indexing is to parse video stream into shots and scenes. Generally, it takes long time to parse a video due to the huge amount of computation in a traditional single computing environment. Previous studies had widely used Round Robin scheduling which basically allocates tasks to each slave for a time interval of one quantum. This scheduling is difficult to adapt in a heterogeneous environment. In this paper, we propose two different parallel parsing algorithms which are Size-Adaptive Round Robin and Dynamic Size-Adaptive Round Robin for the heterogeneous distributed computing environments. In order to show their performance, we perform several experiments and show some of the results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.3 s.357
• /
• pp.41-50
• /
• 2007

In this paper, a new Dual Round-Robin (DRR) based iterative SLIP (iSLIP) scheduling scheme, called DiSLIP is proposed for IP switching systems. By using DRR followed by iSLIP, DiSLIP can exploit desynchronization effect of DRR and high performance of iSLIP, while the drawbacks of two schemes are minimized. 'Through computer simulation, we verify the switch throughput and total waiting time of the proposed scheme under nonuniform and correlated self-similar traffic. Moreover, the proposed scheme can considerably reduce the complexity of parallel matching logics compared to iSLIP. From the result, we observe that the proposed scheme outperforms DRR on throughput as well as iSLIP schemes on complextiy.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.5
• /
• pp.143-149
• /
• 2009

The hash function ARIRANG is one of the 1st round SHA-3 candidates. In this paper, we present preimage attacks on ARIRANG with step-reduced compression functions. Our attack finds a preimage of the 33-step OFF(Original FeedForward1) variants of ARIRANG, and a preimage of the 31-step MFF(Middle FeedForward1) variants of ARIRANG. Its time complexity is about $2^{241}$ for ARIRANG-256 and $2^{481}$ for ARIRANG-512, respectively.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.5
• /
• pp.27-33
• /
• 2011

At FDTC'05 and CISC-W'10, the authors showed that if they decrease the number of rounds of AES and Triple-DES by using the fault injections, it is possible to recover the secret key of the target algorithms, respectively. In this paper, we propose a key recovery attack on HMAC by using the main idea of these attacks. This attack is applicable to HMAC based on MD-family hash functions and can recover the secret key with the negligible computational complexity. Particularly, the attack result on HMAC-SHA-2 is the first known key recovery attack result on this algorithm.

• Journal of the KSME
• /
• v.34 no.8
• /
• pp.587-604
• /
• 1994

이 글에서는 폐기물의 분류 및 정의, 수거.운반 기술, 전처리 기술에서부터 중간처리기술로서 소각 및 기타 퇴비화, 메탄발효, 열분해, 고체연료, 사료화, 알콜발효, 식용작물재배 기술 그리고 최종처분기술로서 매립기술 및 해양티기 등 폐기물 처리기술의 전반을 포괄적으로 살펴보았다. 폐기물은 마치 인간의 삶을 대변이나 하듯이 복잡다다한 성분을 포함하고 있어서 중간처리 및 최종처분기술의 개발에만 노력을 기울일 수는 없으며, 정확한 분류와 수거 및 운반 체계의 최 적화, 그리고 수거된 폐기물의 선별을 포함하는 전처리 조작등이 폐기물 구성성분의 특성에 맞는 처리기술과 함께 유기적으로 연계되도록 해야 하며, 이를 위한 총체적 폐기물관리시스템의 토 착화는 아무리 강조해도 지나치지 않는다. 아울러 폐기물 처리의 공학적인 측면이외에도 국민의 절대적인 협조와 정책적인 뒷받침이 선행될 때만이 이 땅에서 폐기물처리로 인한 문제가 사라질 수 있을 것이며, 환경기술을 또다른 국제무역장벽의 하나로 구체화하려는 그린라운드(G.R.; green round)에 적극적으로 대웅하여 폐기물처리기술을 포함한 여타 환경기술을 세계화하고 수출하는 계기도 마련되어지리라 판단된다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.511-514
• /
• 2006

ABCD는 FGCS'2004에 이장두 등에 의하여 제안된 블록 암호이다. ABCD는 256비트의 평문을 입력받아 128비트의 키를 사용하여 256비트의 암호문을 출력하는 블록암호이다. ABCD는 지금가지 분석 결과가 알려져 있지 않으며, 본 논문에서는 $7{\times}2^{8}$의 선택 평문을 이용하여, 공격복잡도 $2^{54}$을 갖는 전체 라운드 포화공격을 소개한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.709-711
• /
• 2004

본 논문에서는 인스턴트 메신저 서비스를 통해 접근할 수 있는 홈 네트워크 관리 시스템의 설계와 구현에 대해 기술한다. 본 논문의 홈 네트워크는 UPnP를 사용하여 구축하며 인스턴트 메신저 서비스를 사용하여 외부에서 접근할 수 있도록 구현한다. 제안된 시스템은 UPnP를 사용함으로써 복잡한 네트워크 설정을 직접 할 필요가 없고 인스턴트 메신저 서비스를 사용하여 접근하므로 고정 IP를 가질 필요가 없다. 외부에서 시스템에 접속한 사용자는 메신저 서비스를 완전히 종료하지 않는 이상 백그라운드에서 동작하는 메신저 클라이언트를 통해 현재 홈 네트워크의 상황을 지속적으로 전달받을 수 있다. 이 시스템은 메신저서비스를 사용할 수 있는 어떠한 플랫폼에서도 동일하게 접근할 수 있다.