• 제목/요약/키워드: Efficient Implementation

Search Result 2,934, Processing Time 0.034 seconds

Efficient Masking Methods Appropriate for the Block Ciphers ARIA and AES

  • Kim, Hee-Seok;Kim, Tae-Hyun;Han, Dong-Guk;Hong, Seok-Hie
    • ETRI Journal
    • /
    • v.32 no.3
    • /
    • pp.370-379
    • /
    • 2010
  • In this paper, we propose efficient masking methods for ARIA and AES. In general, a masked S-box (MS) block can be constructed in different ways depending on the implementation platform, such as hardware and software. However, the other components of ARIA and AES have less impact on the implementation cost. We first propose an efficient masking structure by minimizing the number of mask corrections under the assumption that we have an MS block. Second, to make a secure and efficient MS block for ARIA and AES, we propose novel methods to solve the table size problem for the MS block in a software implementation and to reduce the cost of a masked inversion which is the main part of the MS block in the hardware implementation.

The efficient division and implementation technique of Bluetooth Baseband (Bluetooth Baseband의 효율적인 분할 및 구현기법)

  • 김현미;진군선;임재윤
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.186-189
    • /
    • 2003
  • This paper discussed whole concept of bluetooth baseband and studied its detail algorithm. Important blocks, access code, security and clock management, are implemented and verified to hardware and firmware according to Specification ver.1.1. Then implementation results are compared and examined. Finally, this paper suggested the efficient system implementation method. By using test board, it could confirm that suggested implementation communicated smoothly.

  • PDF

A Strategic Implementation of e-SCM(Supply Chain Management) for the Development of e-Business (e-Business활성화를 위한 e-SCM의 전략적 구축)

  • Lee, Shin-Kyuo
    • The Journal of Information Technology
    • /
    • v.9 no.1
    • /
    • pp.65-79
    • /
    • 2006
  • e-Marketplace is a business concept which is importantly considered in the area of marketing. e-Marketplace provides the public field in which multi-purchasers can efficiently trade with multi-suppliers. Supply Chain Management(SCM) is being widely acknowledged by the development of information technology. SCM is well known as one of the key issues lately. The complexity of supply chains and the associated potential opportunities for gaining a competitive edge by designing a product and process to support supply chain management can be significant. In order to achieve successful implementation of supply chain management system, companies should understand some barriers in implementation and set up effective and integrated information system. Standardization of logistics is needed through the unification of EDI, Bar Code, Pallet and so on. It's effect is magnified on Efficient Consumer Response such as efficient store assortment, efficient replenishment, efficient promotion and efficient product introduction. International logistics management is the integration of key business processes from original suppliers to end user that provides products, services and information that add value for customers. e-Logistics is being used in managing the international logistics. In this study, three basic e-SCM models for the strategic implementation of supply chain management are suggested. Among them, the virtual company can be the best one we can develop in order to cope with the individualized customer needs.

  • PDF

An Efficient Implementation of Tornado Code for Fault Tolerance

  • Lei, Jian-Jun;Kwon, Gu-In
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.13-18
    • /
    • 2009
  • This paper presents the implementation procedure of encoding and decoding algorithms for Tornado code that can provide fault tolerance for storage and transmission system. The degree distribution satisfying heavy tail distribution is produced. Based on this distribution, a good random irregular bipartite graph is attained after plenty of trails. Such graph construction is proved to be efficient, and the experiments also demonstrate that the implementation obtains good performance in terms of decoding overhead.

  • PDF

The Synthesizing Implementation of Iterative Algorithms on Processor Arrays (순환 알고리즘의 Processor Array에로의 합성 및 구현)

  • 이덕수;신동석
    • Journal of the Korean Institute of Navigation
    • /
    • v.14 no.4
    • /
    • pp.31-39
    • /
    • 1990
  • A systematic methodology for efficient implementation of processor arrays from regular iterative algorithms is proposed. One of the modern parallel processing array architectures is the Systolic arrays and we use it for processor arrays on this paper. On designing the systolic arrays, there are plenty of mapping functions which satisfy necessary conditions for its implementation to the time-space domain. In this paper, we sue a few conditions to reduce the total number of computable mapping functions efficiently. As a results of applying this methodology, efficient designs of systolic arrays could be done with considerable saving on design time and efforts.

  • PDF

EFFICIENT PARALLEL GAUSSIAN NORMAL BASES MULTIPLIERS OVER FINITE FIELDS

  • Kim, Young-Tae
    • Honam Mathematical Journal
    • /
    • v.29 no.3
    • /
    • pp.415-425
    • /
    • 2007
  • The normal basis has the advantage that the result of squaring an element is simply the right cyclic shift of its coordinates in hardware implementation over finite fields. In particular, the optimal normal basis is the most efficient to hardware implementation over finite fields. In this paper, we propose an efficient parallel architecture which transforms the Gaussian normal basis multiplication in GF($2^m$) into the type-I optimal normal basis multiplication in GF($2^{mk}$), which is based on the palindromic representation of polynomials.

Efficient Data Transmission Method for UPnP Based Robot Middleware (UPnP 기반 로봇 미들웨어의 효율적 데이터 전송)

  • Kim, Kyung-San;Ahn, Sang-Chul;Kwon, Yong-Moo;Ko, Hee-Dong;Kim, Hyoung-Gon
    • The Journal of Korea Robotics Society
    • /
    • v.4 no.1
    • /
    • pp.68-73
    • /
    • 2009
  • The UPnP is middleware architecture that supports dynamic distributed computing environment. It has many good features for possible use as middleware in robot system integration. There is a need for bulky binary data transmission between distributed robot S/W components. Since the UPnP utilizes SOAP protocol for message transmission, however, it is not efficient to send bulky binary data. In order to overcome this weak point, this paper proposes UPnP-MTOM, MTOM (Message Transmission Optimization Mechanism) implementation over UPnP, as an efficient way for bulky binary data transmission with UPnP messages. This paper presents our implementation method and experimental results of the UPnP-MTOM implementation.

  • PDF

An efficient circuit design algorithm considering constraint (제한조건을 고려한 효율적 회로 설계 알고리즘)

  • Kim, Jae Jin
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.1
    • /
    • pp.41-46
    • /
    • 2012
  • In this paper, An efficient circuit design algorithm considering constraint is proposed. The proposed algorithm sets up in time constraint and area constraint, power consumption constraint for a circuit implementation. First, scheduling process for time constraint. Select the FU(Function Unit) which is satisfied with time constraint among the high level synthesis results. Analyze area and power consumption of selected FUs. Constraint set for area and power constraint. Device selection to see to setting condition. Optimization circuit implementation in selected device. The proposed algorithm compared with [7] and [8] algorithm. Therefore the proposed algorithm is proved an efficient algorithm for optimization circuit implementation.

On the Implementation of an Optimal Basis Identification Procedure for Interior Point Method (내부점 선형계획법에서의 최적기저 추출방법의 구현)

  • 임성묵;박순달
    • Korean Management Science Review
    • /
    • v.17 no.2
    • /
    • pp.1-12
    • /
    • 2000
  • In this study, we deals with the implementation of an optimal basis identification procedure for interior point methods. Our implementation is based on Megiddo’s strongly polynomial algorithm applied to Andersen and Ye’s approximate LP construction. Several techniques are explained such as the use of effective indicator for obtaining optimal partition when constructing the approximate LP, the efficient implementation of the problem reduction technique proposed by Andersen, the crashing procedure needed for fast dual phase of Megiddo’s algorithm and the construction of the stable initial basis. By experimental comparison, we show that our implementation is superior to the crossover scheme implementation.

  • PDF