• Title/Summary/Keyword: Hardware Resources

Search Result 442, Processing Time 0.024 seconds

A Cryptoprocessor for AES-128/192/256 Rijndael Block Cipher Algorithm (AES-128/192/256 Rijndael 블록암호 알고리듬용 암호 프로세서)

  • 안하기;박광호;신경욱
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.3
    • /
    • pp.427-433
    • /
    • 2002
  • This paper describes a design of cryptographic processor that implements the AES(Advanced Encryption Standard) block cipher algorithm "Rijndael". To achieve high throughput rate, a sub-pipeline stage is inserted into the round transformation block, resulting that the second half of current round function and the first half of next round function are being simultaneously operated. For area-efficient and low-power implementation, the round block is designed to share the hardware resources in encryption and decryption. An efficient scheme for on-the-fly key scheduling, which supports the three master-key lengths of 128-b/192-b/256-b, is devised to generate round keys in the first sub-pipeline stage of each round processing. The cryptoprocessor designed in Verilog-HDL was verified using Xilinx FPGA board and test system. The core synthesized using 0.35-${\mu}{\textrm}{m}$ CMOS cell library consists of about 25,000 gates. Simulation results show that it has a throughput of about 520-Mbits/sec with 220-MHz clock frequency at 2.5-V supply.-V supply.

SPN Block cipher SSB having same structure in encryption and decryption (암호와 복호가 동일한 SPN 블록 암호 SSB)

  • Cho, Gyeong-Yeon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.4
    • /
    • pp.860-868
    • /
    • 2011
  • Feistel and SPN are the two main structures in a block cipher. Feistel is a symmetric structure which has the same structure in encryption and decryption, but SPN is not a symmetric structure. In this paper, we propose a SPN block cipher so called SSB which has a symmetric structure in encryption and decryption. The proposed SSB is composed of the even numbers of N rounds. Each round consists of a round key addition layer, a subsitution layer, a byte exchange layer and a diffusion layer. The subsitution layer of the odd round is inverse function of one of the even round. And the diffusion layer is a MDS involution matrix. The differential and linear attack probability of SSB is $2^{-306}$ which is same with AES. The proposed symmetric SPN block cipher SSB is believed to construct a safe and efficient cipher in Smart Card and RFID environments which is in limited hardware and software resources.

Convergence of MPLS applied SDN to Optimize IPTV Broadcast Transmission for IPv6 and IPv4 (IPv6와 IPv4 환경에서 IPTV 전송 최적화 위한 SDN을 응용한 MPLS)

  • Hwang, Seong-Kyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.4
    • /
    • pp.819-824
    • /
    • 2015
  • SDN (Software Defined Network) technology, hardware and network control functions should be separated independently of existing switches or routers and data transfer functions and are also refers to a separate network architecture that can develop and run. When planning a network and designed to reflect the network control function by applying the SDN may reflect the resources efficiently. In this study, one people suggest Applications SDN, which offer an absolutely necessary part of a coded program that combines the benefits of the existing IOS (Combined Benefits) applying the model to complete the Controller part through the MPLS IOS. The OpenFlow Controller is a command to the router LER(Label Edge Router), and transmits the packet in accordance with the command to the destination according to the EXP bit. To configure TCP / IP to the IOS through the optimized coding. Using the OpenFlow protocol controller transmits an encapsulation header as defined in the MPLS packet.

Online Games Traffic Multiplexing: Analysis and Effect in Access Networks

  • Saldana, Jose;Fernandez-Navajas, Julian;Ruiz-Mas, Jose;Casadesus, Luis
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.11
    • /
    • pp.2920-2939
    • /
    • 2012
  • Enterprises that develop online games have to deploy supporting infrastructures, including hardware and bandwidth resources, in order to provide a good service to users. First Person Shooter games generate high rates of small UDP packets from the client to the server, so the overhead is significant. This work analyzes a method that saves bandwidth, by the addition of a local agent which queues packets, compresses headers and uses a tunnel to send a number of packets within a multiplexed packet. The behavior of the system has been studied, showing that significant bandwidth savings can be achieved. For certain titles, up to 38% of the bandwidth can be saved for IPv4. This percentage increases to 54% for IPv6, as this protocol has a bigger overhead. The cost of these bandwidth savings is the addition of a new delay, which has an upper bound that can be modified. So there is a tradeoff: the greater the added delays, the greater the bandwidth savings. Significant reductions in the amounts of packets per second generated can also be obtained. Tests have been deployed in an emulated scenario matching an access network, showing that if the number of players is big enough, the added delays can be acceptable in terms of user experience.

Deterministic Real-Time Task Scheduling (시간 결정성을 보장하는 실시간 태스크 스케줄링)

  • Cho, Moon-Haeng;Lee, Soong-Yeol;Lee, Won-Yong;Jeong, Geun-Jae;Kim, Yong-Hee;Lee, Cheol-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.1
    • /
    • pp.73-82
    • /
    • 2007
  • In recent years, embedded systems have been expanding their application domains from traditional applications (such as defense, robots, and artificial satellites) to portable devices which execute more complicated applications such as cellular phones, digital camcoders, PMPs, and MP3 players. So as to manage restricted hardware resources efficiently and to guarantee both temporal and logical correctness, every embedded system use a real-time operating system (RTOS). Only when the RTOS makes kernel services deterministic in time by specifying how long each service call will take to execute, application programers can write predictable applications. Moreover, so as for an RTOS to be deterministic, its scheduling and context switch overhead should also be predictable. In this paper, we present the complete generalized algorithm to determine the highest priority in the ready list with 22r levels of priorities in a constant time without additional memory overhead.

Real-time Image Scanning System for Detecting Tunnel Cracks Using Linescan Cameras

  • Jeong, Dong-Hyun;Kim, Young-Rin;Cho, I-Sac;Kim, Eun-Ju;Lee, Kang-Moon;Jin, Kwang-Won;Song, Chang-Geun
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.6
    • /
    • pp.726-736
    • /
    • 2007
  • In this paper, real-time image scanning system using linescan cameras is designed. The system is specially designed to diagnose and analyse the conditions of tunnels such as crack widths through the captured images. The system consists of two major parts, the image acquisition system and the image merging system. To save scanned image data into storage media in real-time, the image acquisition system has been designed with two different control and management modules. The control modules are in charge of controlling the hardware device and the management modules handle system resources so that the scanned images are safely saved to the magnetic storage devices. The system can be mounted to various kinds of vehicles. After taking images, the image merging system generates extended images by combining saved images. Several tests are conducted in laboratory as well as in the field. In the laboratory simulation, both systems are tested several times and upgraded. In the field-testing, the image acquisition system is mounted to a specially designed vehicle and images of the interior surface of the tunnel are captured. The system is successfully tested in a real tunnel with a vehicle at the speed of 20 km/h. The captured images of the tunnel condition including cracks are vivid enough for an expert to diagnose the state of the tunnel using images instead of seeing through his/her eyes.

  • PDF

A Web-based Microcontroller Remote Laboratory for Sharing Resources (자원공유를 위한 웹기반 마이크로콘트롤러 원격 실험실)

  • Moon, Il-Hyeon;Han, Sae-Ron;Cho, Kwan-Sun;Ahn, Dal;Lim, Jong-Sik;Jeon, Heung-Gu
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.5
    • /
    • pp.1184-1192
    • /
    • 2008
  • There have been a large number of trials of the experimental education in engineering using virtual laboratories implemented in virtual space, namely on the Web. Although virtual education is regarded as an effective educational means that overcomes the limit of time and space and bring high teaming effects, the problem of lack of reality must be solved. The present study proposed and implemented a real-time remote laboratory as a solution for the problem of lack of reality in virtual education. The remote laboratory provides functions with which learners can perform experiments by remote-controlling circuits and equipment related to experiments and practices on the Web and gets data and image information, so through it learners can make realistic experiments at any time and in any place. The remote laboratory module based on Internet open sources such as JAVA Web start technology, FTP technology and Telnet technology in server-client environment can be implemented at low cost, and is effectively applicable to engineering experiment education in various areas related to real-time hardware control.

Load Distribution Method based on Transcoding Time Estimation on Distributed Transcoding Environments (분산 트랜스코딩 환경에서 트랜스코딩 시간 예측 기반 부하 분산 기법)

  • Kim, Jong-Woo;Seo, Dong-Mahn;Jung, In-Bum
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.4
    • /
    • pp.195-204
    • /
    • 2010
  • Due to improved wireless communication technologies, it is possible to provide multimedia streaming service for mobile device clients like PDAs and cellphones. Wireless networks are serviced on low bandwidth channels and mobile devices work on limited hardware specifications. In these conditions, transcoding technologies are needed to adapt the media for streaming services to given mobile environments. To transcode from the source media to the target media for corresponding grades, transcoding servers perform transcoding jobs as exhausting their resources. Since various transcoding loads occur according to the target transconding grades, an effective transcoding load balancing policy is required among transcoding servers. In addition to transcoding process, servers should maintain QoS streams for mobile clients for total serviced times. It requires real-time requirements to support QoS for various mobile clients. In this paper, a new transcoding load distribution method is proposed. The proposed method can be driven for fair load balance between distributed transcoding servers. Based on estimated transcoding time, movie information and target transcoding bit-rate, it provides fair transcoding load distribution and also performs admission control to support QoS streams for mobile clients.

Performance Optimization Technique for Overlay Multicast Trees by Local Transformation (로컬 변환에 의한 오버레이 멀티캐스트 트리의 성능 최적화 기법)

  • Kang, Mi-Young;Kwag, Young-Wan;Nam, Ji-Seung;Lee, Hyun-Ok
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.8
    • /
    • pp.59-65
    • /
    • 2007
  • Overlay Multicast is an effective method for efficient utilization of system resources and network bandwidth without a need for hardware customization. Multicast tree reconstruction is required when a non-leaf node leaves or fails. However frequent multicast tree reconstruction introduces serious degradation in performance. In this paper, we propose a tree performance optimization algorithm to solve this defect by using information(RTCP-probing) that becomes a periodic feedback to a source node from each child node. The proposed model is a mechanism performed when a parent node seems to cause deterioration in the tree performance. We have improved the performance of the whole service tree using the mechanism and hence composing an optimization tree. The simulation results show that our proposal stands to be an effective method that can be applied to not only the proposed model but also to existing techniques.

8.3 Gbps pipelined LEA Crypto-Processor Supporting ECB/CTR Modes of operation (ECB/CTR 운영모드를 지원하는 8.3 Gbps 파이프라인 LEA 암호/복호 프로세서)

  • Sung, Mi-Ji;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.12
    • /
    • pp.2333-2340
    • /
    • 2016
  • A LEA (Lightweight Encryption Algorithm) crypto-processor was designed, which supports three master key lengths of 128/ 192/256-bit, ECB and CTR modes of operation. To achieve high throughput rate, the round transformation block was designed with 128 bits datapath and a pipelined structure of 16 stages. Encryption/decryption is carried out through 12/14/16 pipelined stages according to the master key length, and each pipelined stage performs round transformation twice. The key scheduler block was optimized to share hardware resources that are required for encryption, decryption, and three master key lengths. The round keys generated by key scheduler are stored in 32 round key registers, and are repeatedly used in round transformation until master key is updated. The pipelined LEA processor was verified by FPGA implementation, and the estimated performance is about 8.3 Gbps at the maximum clock frequency of 130 MHz.