• Journal of the Korean Society for information Management
• /
• v.31 no.2
• /
• pp.79-97
• /
• 2014

This study was to evaluate the quality of academic information services provided by Naver Academic Information Service, Google Scholar, and MS Academic Search. This academic information services were evaluated in terms of the contents, service, and effectiveness. 135 four year college students were recruited for the survey. The results showed that the Google Scholar in contents section had higher score than Naver and MS Academic Search. In regard to service, Google Scholar had higher score in retrieval section while Naver had higher score in design section respectively. Finally, both Google Scholar and Naver in the access section had higher score than MS Academic Search.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2154-2162
• /
• 2009

This paper describes a scalar multiplier for Elliptic curve cryptography for smart card security. The scaler multiplier has 163-bits key size which supports the specifications of smart card standard. To reduce the computational complexity of scala multiplication on finite field, the non-adjacent format (NAF) conversion algorithm which is based on complementary recoding is adopted. The scalar multiplier core synthesized with a 0.35-${\mu}m$ CMOS cell library has 32,768 gates and can operate up to 150-MHz@3.3-V. It can be used in hardware design of Elliptic curve cryptography processor for smartcard security.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.3-10
• /
• 2002

For efficient implementation of scalar multiplication in Kobliz elliptic curves, Frobenius endomorphism is useful. Instead of binary expansion of scalar, using Frobenius expansion of scalar we can speed up scalar multiplication and so fast scalar multiplication is closely related to the expansion length of integral multipliers. In this paper we propose a new idea to reduce the length of Frobenius expansion of integral multipliers of scalar multiplication, which makes speed up scalar multiplication. By using the element whose norm is equal to a prime instead of that whose norm is equal to the order of a given elliptic curve we optimize the length of the Frobenius expansion. It can reduce more the length of the Frobenius expansion than that of Solinas, Smart.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.2
• /
• pp.111-119
• /
• 2023

In this paper, we investigate the feasibility of functional programming in the Scala language. The main issue is to what extent Scala is able to handle major properties of functional programming such as lambda expression, high-order functions, generic types, algebraic data types, and monads. For this purpose, we implement an interpreter of an imperative language. In this implementation, the same functional programming techniques are applied to both Haskell and Scala languages, and then these two versions of implementations are compared and analyzed. The abstract syntax tree of an imperative language is expressed as algebraic data types with generics and enum classes in Scala, and the state transition of imperative languages is implemented by using state monad. Extension and given, new features of Scala, are used as well.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.105-105
• /
• 2021

본 연구에서는 2차원 비선형 천수모형과 수심평균된 스칼라 이송모형을 해석하는 수치모형에 대해 기술하였다. 수치모형의 정확성을 보장함과 동시에 안정성을 높이기 위해 유한체적법, 플럭스 재구성 및 minmod 제한자를 사용하였다. 비선형 천수방정식의 이송항과 바닥 경사항은 계산된 수심의 양수 보존과 흐름의 정상 상태를 보장하기 위한 second order well-balanced positivity preserving central-upwind method를 이용하여 수치적으로 이산화되었다. 마찬가지로, 이송-확산 방정식 내 이송항은 동일한 2차 풍상차분법을 통해 수치적으로 풀이하였다. 격자점 경계면에서의 불연속으로 인한 수치진동을 방지하기 위해 이송항의 계산에 포함된 보존항의 차이로 인해 발생하는 스칼라의 수치확산을 최소화하기 위해 무차원의 비소산함수를 도입하였다. 또한, 확산항은 유한차분법을 이용하여 이산화하였다. 제안된 수치모형은 시간미분항의 계산을 위해 오일러 기법을 적용하여 계산된 수심 및 스칼라의 양수 보존여부와 함께 정지된 흐름의 정상 상태의 보존여부를 확인하였다. 제안된 수치모형의 해석 정확성을 평가하기 위해 1, 2차원 공간 내 다양한 흐름 조건에서의 해석해를 이용한 3개의 벤치마크 테스트를 수행하였다. 평균 제곱근 오차(Root Mean Squared Error, RMSE)를 산정하여 수치모형의 성능을 정량적으로 평가하였으며, 비소산함수를 적용함에 따라 스칼라의 수치확산이 감소하게 되었음을 확인하였다. 또한, 세 차례의 벤치마크 테스트 결과는 공통적으로 수치모형에 의해 계산된 결과값이 비소산함수를 고려함에 따라 해석해와 잘 일치함을 확인하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1212-1217
• /
• 2004

The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication, which is performed in the upper level of GF multiplication and GF division, has been the double-and-add algorithm, which is recently challenged by NAF(Non-Adjacent Format) algorithm. In this paper, we propose a more efficient and novel scalar multiplication method than existing double-and-add by applying redundant receding which originates from radix-4 Booth's algorithm. After deriving the novel quad-and-add algorithm, we created a new operation, named point quadruple, and verified with real application calculation to utilize it. Derived numerical expressions were verified using both C programs and HDL (Hardware Description Language) in real applications. Proposed method of elliptic curve scalar point multiplication can be utilized in many elliptic curve security applications for handling efficient and fast calculations.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.5
• /
• pp.169-177
• /
• 2003

We establish the security requirements and derive a generic condition of elliptic curve scalar multiplication to resist against DPA and Goubin’s attack. Also we show that if a scalar multiplication algorithm satisfies our generic condition, then both attacks are infeasible. Showing that the randomized signed scalar multiplication using Ha-Moon's receding algorithm satisfies the generic condition, we recommend the randomized signed scalar multiplication using Ha-Moon's receding algorithm to be protective against both attacks. Also we newly design a random recoding method to Prevent two attacks. Finally, in efficiency comparison, it is shown that the recommended method is a bit faster than Izu-Takagi’s method which uses Montgomery-ladder without computing y-coordinate combined with randomized projective coordinates and base point blinding or isogeny method. Moreover. Izu-Takagi’s method uses additional storage, but it is not the case of ours.

• Journal of the Korean Society for information Management
• /
• v.27 no.3
• /
• pp.307-323
• /
• 2010

The amount of online scholarly information rapidly expands in numerous resources, while user behavior demands single search box interface like Google Scholar. Despite scholarly values of e-resources libraries provide, users consider Google Scholar as the most efficient research tool attracted by its speed, simplicity, ease of use, and convenience. Characteristics of Metasearch System compared with Google Scholar are analyzed from perspectives of the interface and e-resource. Based on usage statistics of Metasearch System along with a link resolver in one academic library, e-resource accessibility patterns and information seeking behaviors of subject-specific areas are investigated for electronic information services.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.121-129
• /
• 2007

Scalarization is a process that a parallel construct like an array statement of Fortran 90 or FORALL of HPF is converted into sequential loops that maintain the correct semantics. Most compilers of HPF, recognized as a standard data parallel language, convert a HPF program into a Fortran 77 program inserted message passing primitives. During scalariztion, a parallel construct FORALL should be translated into Fortran 77 DO loops maintaining the semantics of FORALL. In this paper, we propose a scalarization algorithm which converts a FORALL construct into a DO loop with improved performance. For this, we define and use a relation distance vector to keep necessary dependence informations. Then we evaluate execution times of the codes generated by our method and by PARADIGM compiler method for various array sizes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.1
• /
• pp.99-105
• /
• 2021

Today, a superscalar processor is the basic unit or an essential component of a multi-core processor, SoCs, and GPUs. Hence, a high-performance out-of-order superscalar processor must be adopted for these systems to maximize its performance. The superscalar processor fetches, issues, executes, and writes back multiple instructions per cycle by utilizing reorder buffers and reservation stations to dynamically schedule instructions in a pipelined scheme. In this paper, a fully pipelined out-of-order superscalar processor with speculative execution is designed with VHDL and verified with GHDL. As a result of the simulation, the program composed of ARM instructions is successfully performed.