• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.6
• /
• pp.425-429
• /
• 2009

Recently, Chen et al.'s proposed mutual authentication scheme based on the quadratic resiidue, finding the squaring root problem, for avoiding exhaustive search on the server. But, if a malicious reader sends same random value, the tag is traced by an adversary. Moreover, there is realization problem because of its limited ability to compute squaring and hash function. In this paper, we analyze Chen et al.'s scheme and its weakness. Furthermore we present an improved mutual authentication scheme based on the quadratic residue which solves the tracing problem by generating random value on the tag and uses only squaring. We also make the scheme satisfy to forward secrecy without updating and synchronizing and avoid exhaustive search.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.176-186
• /
• 2006

In this paper, we propose an enhanced symbol detector algorithm for 2.45GHz LR-WPAN(Low-Rate Wireless Personal Area Network) receiver. Because the frequency offset of $\pm$80ppm on 2.45GHz band is recommended in IEEE 802.15.4 LR-WPAN(Low-Rate Wireless Personal Area Network) specification, a symbol detector algorithm having stable operation in the channel environment with large frequency offset is required. For robustness to the frequency offset, non-coherent detection-based symbol detector algorithm is typically applied in the LR-WPAN receiver modem. However, the noncoherent symbol detector has increased performance degradation and hardware complexity due to squaring loss of I/Q squaring operation. Therefore we propose a coherent detection-based symbol detector algorithm with frequency offset compensation using a preamble symbol. The proposed algorithm is more suitable for LR-WPAN receiver aimed at low-cost, low-power and low-complexity than the non-coherent symbol detector, since it can reduce performance degradation due to squaring loss of I/Q squaring operation and implementation complexity. Simulation results show that the proposed algorithm has performance improvement of about 1dB in various channel environments.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.6
• /
• pp.906-911
• /
• 2001

In this paper, LPI(low probability of intercept) and AJ(anti jamming) performance of the chirped BPSK system are analyzed. In the chirp method the cyclostationary of the signal is eliminated, since the instantaneous frequency is varied randomly within the whole spread bandwidth. Therefore, chirp method is considered for good LPI system against DAM(delay-and-multiplier) or SC (squaring circuit) interceptor which detects the chip rate or carrier frequency. Longer chirp duration makes the LPI performance better. From the simulation results, the chirp method has better AJ performance than DS(direct sequence) system in the PBNJ(partial band noise jammer) channel. At the same JSR(jammer to signal power ratio) level, chirped BPSK system has more robust AJ performance against MTJ(multi-tone jammer) than PBNJ.

• The KIPS Transactions:PartC
• /
• v.18C no.1
• /
• pp.1-6
• /
• 2011

The performance and practicality of cryptosystem for encryption, decryption, and primality test is primarily determined by the implementation efficiency of the modular exponentiation of $a^b$(mod n). To compute $a^b$(mod n), the standard binary squaring still seems to be the best choice. But, the d-ary, (d=2,3,4,5,6) method is more efficient in large b bits. This paper suggests m-numeral system modular exponentiation. This method can be apply to$b{\equiv}0$(mod m), $2{\leq}m{\leq}16$. And, also suggests the another method that is exit the algorithm in the case of the result is 1 or a.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.4
• /
• pp.189-197
• /
• 2003

The problem of designing a parallel feedforward compensator (PFC) is considered for a class of non-square linear systems such that the closed-loop system is strictly passive. If a given square system has (vector) relative degree one and is weakly minimum phase, the system can be rendered passive by a state feedback. However, when the system states are not always measurable and the given output is considered, passivation (i.e. rendering passive) of a non-minimum phase system or a system with high relative degree cannot be achieved by any other methodologies except by using a PFC. To passivate a non-square system we first determine a squaring gain matrix and design a PFC such that the composite system has relative degree one and is minimum phase. Then the system is rendered strictly passvie by a static output feedback law. Necessary and sufficient conditions for the existence of the PFC and the squaring gain matrix are given by the static output feedback formulation, which enables to utilize linear matrix inequality (LMI). As an application of the scheme, an alternative way of replacing the role of velocity measurements is provided for the PD-control law of a convey-crane system.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.978-980
• /
• 2014

본 연구에서는 스트레스 상태 측정을 위한 심전도 신호 QRS 검출 알고리즘을 제안한다. 심전도 신호의 QRS 검출 과정은 4단계로 wavelet, moving average, squaring, threshold method로 구성된다. wavelet은 기저선 변동과 노이즈를 제거하고 moving average는 전체 신호를 부드럽게 하고 잔여 노이즈를 제거하며 squaring은 신호를 강조하는 역할을 한다. 마지막으로 threshold 기법을 이용해 검출간격을 설정하여 QRS를 검출하였다. 그 결과 Sensitivity는 99.54%, Positive Predictivity는 99.69%, Detection Error는 0.76%를 보였다. 또한, 피험자를 대상으로 게임을 이용해 스트레스 상태 변화에 대한 실험을 하였고, HRV 시간-주파수 파라미터를 분석함으로써 스트레스 상태 변화를 관찰할 수 있었다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.41-47
• /
• 2008

This paper presents a new digit level LSB-first multiplier for computing a modular multiplication and a modular squaring simultaneously over finite field GF($2^m$). To derive $L{\times}L$ digit level architecture when digit size is set to L, the previous algorithm is used and index transformation and merging the cell of the architecture are proposed. The proposed architecture can be utilized for the basic architecture for the crypto-processor and it is well suited to VLSI implementation because of its simplicity, regularity, and concurrency.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.6
• /
• pp.63-70
• /
• 2009

Many research results show that RSA system mounted using conventional binary exponentiation algorithm is vulnerable to some physical attacks. Recently, Schmidt and Hurbst demonstrated experimentally that an attacker can exploit secret key using faulty signatures which are obtained by skipping the squaring operations. Based on similar assumption of Schmidt and Hurbst's fault attack, we proposed new fault analysis attacks which can be made by skipping the multiplication operations or computations in looping control statement. Furthermore, we applied our attack to Montgomery ladder exponentiation algorithm which was proposed to defeat simple power attack. As a result, our fault attack can extract secret key used in Montgomery ladder exponentiation.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.646-649
• /
• 2002

In this paper, a low-voltage CMOS squarer and a four-quadrant analog multiplier are presented. It is based on a source-coupled pair and a scaled-floating voltage generator which are modified to work as a voltage squaring and a sum/difference circuits. The proposed squarer/multiplier have been simulated with HSPICE, where -3㏈ bandwidth of 10MHz is achieved. The power consumption is about 0.6㎽, from a ${\pm}$1.5V supply, and the total harmonic distortion is less than 0.7%, with a 1.2V peak-to-peak 1MHz input signal.

• The Journal of Society for e-Business Studies
• /
• v.8 no.1
• /
• pp.113-119
• /
• 2003

This paper proposes a new multiplicative inverse algorithm for the Galois field GF (2/sup m/) whose elements are represented by optimal normal basis type Ⅱ. One advantage of the normal basis is that the squaring of an element is computed by a cyclic shift of the binary representation. A normal basis element is always possible to rewrite canonical basis form. The proposed algorithm combines normal basis and canonical basis. The new algorithm is more suitable for implementation than conventional algorithm.