• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.901-904
• /
• 2002

정보의 암호화와 인증, 디지털 서명등에 효율적인 공개키 암호 시스템의 주 연산은 모듈라 멱승 연산이며 이는 모듈라 곱셈의 연속적인 반복 수행으로 표현될 수 있다. 본 논문에서는 Montgomery 모듈라 곱셈 알고리즘을 사용하여 모듈라 곱셈을 효율적으로 수행하기 위한 모듈라 멱승 연산기를 구현하였으며 Montgomery 모듈라 곱셈시 발생하는 케리 진파 문제를 해결하기 위하여 CPA을 대신하는 CSA를 사용함으로써 멱승 연산시 발생하는 지연시간을 최소화시키는 결과가 얻어짐을 보였다. 본 논문에서는 Montgomery 모듈라 멱승 연산기 구현을 위하여 VHDL 구조적 모델링을 통하여 Synopsys사의 VSS와 Design analyzer를 이용한 논리 합성을 하였고 Mentor Graphics사 Model sim 및 Xilinx사 Design manager의 FPGA 시뮬레이션을 수행하여 성능을 검증 하였다.

• Journal of IKEEE
• /
• v.14 no.2
• /
• pp.64-68
• /
• 2010

This paper proposes efficient log and exponent calculation methods using a dual phase instruction set without additional ALU unit for a mobile enviroment. Using the Dual Phase Instruction set, it extracts exponent and mantissa from expression of floating point and calculates 24bit single precision floating point of log approximation using the Taylor series expansion algorithm. And with dual phase instruction set, it reduces instruction excution cycles. The proposed Dual Phase architecture reduces the performance degradation and maintain smaller size.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.658-660
• /
• 2003

경매 프로토콜의 우수성은 보안성, 효율성, 안정성의 측면에 있다. 기존에 제안된 경매 프로토콜은 보안을 강화함으로 인해 많은 계산량과 메시지 전승이 요구되어 높은 트래픽을 발생한다. 또한 경매의 규모가 커짐에 따라 Auctioneer의 부담이 가중된다. 본 논문에서는 다항함수의 특성과 개인 정보 분할을 통해 기존의 보안성을 유지하면서도 효율성을 높인 경매 프로토콜 PAP를 제안하고자 한다. 효율성을 높이기 위해 곱연산을 피하고 xor연산을 이용하여 계산량을 줄이고. 안전성을 높이기 위해 다항함수(Polynomial)의 기본 성질을 이용해서 Bidder들의 정보를 분할한다. 제안한 경매 프로토콜은 계산량을 줄이면서도 Bidder들의 정보는 보호된다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.2 s.344
• /
• pp.84-95
• /
• 2006

In H/W implementation for the finite field the use of normal basis has several advantages, especially, the optimal normal basis is the most efficient to H/W implementation in $GF(2^m)$. In this paper, we propose a new, simpler, parallel multiplier over $GF(2^m)$ having a Gaussian normal basis of type k, which performs multiplication over $GF(2^m)$ in the extension field $GF(2^{mk})$ containing a type-I optimal normal basis. For k=2,4,6 the time and area complexity of the proposed multiplier is the same as tha of the best known Reyhani-Masoleh and Hasan multiplier.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.5 s.311
• /
• pp.44-59
• /
• 2006

This paper describes the efficient implementation of DNA sequence generate system with genetic algorithm for reducing computation time of NACST. The proposed processor is based on genetic algerian with fitness functions which would suit the point of reference for generated sequences. In order to implement efficient hardware structure, we used the pipelined structure. In addition our design was applied the parallelism to achieve even better simulation time than the sequence generator system which is designed on software. In this paper, our hardware is implemented on the FPGA board with xc2v6000 devices. Through experiment, the proposed hardware achieves 467 times speed-up over software on a PC and sequence generate performance of hardware is same with software.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.758-762
• /
• 2008

Embedded systems usually utilize Flash Memories with very nice characteristics of non-volatility, low access time, low power and so on. For the multimedia database systems, R-tree is an indexing tree with nice characteristics for multimedia access. MR-tree, which is an upgraded version of R-tree, has shown better performance in searching, inserting and deleting operations than R-tree. Flash memory has sectors and blocks as a unit of read, write and delete operations. Especially, the delete is done on a unit of 512 byte blocks with very large operation time and it is also known that read and write operations on a unit of block matches caching nature of MT-tree. Our research optimizes MR-tree operations in a unit of Flash memory blocks. Such an adjusting leads in better indexing performance in database accesses. With MR-tree on a 512B block units we achieved fast search time of database indexing with low height of MR-tree as well as faster update time of database indexing with the best fit of flash memory blocks. Thus MR-tree with optimized operations shows good characteristics to be a database index schemes on any systems with flash memory.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1996.11a
• /
• pp.160-164
• /
• 1996

Montgomery 알고리듬은 모듈라 연산을 고속으로 수행하는 방법이다. 그러나 이는 연산할 수를 n-residue로 변환하는 전처리 단계가 필요하다. 이러한 residue 변환에 필요한 오버헤드로 인해 한번의 곱셈에는 비효율적이다. 본 논문에서는 Montgomery 알고리듬을 사용하여 한번의 곱셈을 효율적으로 수행하는 방법을 제안한다.

• Journal of the Korean Society for information Management
• /
• v.13 no.1
• /
• pp.173-185
• /
• 1996

In this paper, we propose four optimizing methods for effectively processing queries in the Booleam information retrieval system ; (i) the short-circuit evaluation scheme used for optimizing logical expressions in programming lan-guages is applied to Boolean queries.(II) use the difference of the number of index word frequencies appearing in the related documents. (IIi) reduce the number of operators in the queries by applying the distribution law in the set theory. (iv) evaluate only once for the repeated expressions in the query. These methods have been implemented and tested in KRISTAL-II system on the UNIX workstation environment.

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

In this paper, we propose an efficient finite field computation method for Rainbow algorithm, which is the only multivariate quadratic-equation based digital signature among the current US NIST PQC standardization Final List algorithms. Recently, Chou et al. proposed a new efficient implementation method for Rainbow on the Cortex-M4 environment. This paper proposes a new multiplication method over the finite field that can reduce the number of XOR operations by more than 13.7% compared to the Chou et al. method. In addition, a multiplicative inversion over that can be performed by a 4x4 matrix inverse instead of the table lookup method is presented. In addition, the performance is measured by porting the software to which the new method was applied onto RaspberryPI 3B+.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.1
• /
• pp.27-35
• /
• 2004

Software documents consist of a number of objects and relationships between them, and structure of documents can be changed frequently. In the existing software version management models, changes in one object may be propagated to other objects unnecessarily. In this paper, we propose an efficient version management model for software objects based on history of operations applied to software objects. Operations applied to objects are recorded in the operation history, and those are used to retrieve versions of a document. Because versions of objects are stored and retrieved using the operation delta, it is not required to compare versions of a document to extract delta during check-in process. In addition, it can manage changes of structure of objects efficiently because it supports not only object creation, deletion, and update operation but also object move operation.