• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.62 no.4
• /
• pp.198-203
• /
• 2013

There are conditions that can be unbalanced three phase currents in a large generator by untransposed lines, unbalanced loads, unsymmetrical faults, and open phases. The unbalanced conditions can producing negative sequence components of current that induce two times frequence current in the surface of the rotor, the retaining rings, the slot wedges in the field windings. These rotor currents make the rotor rapidly overheat, so the rotor can cause substantial damage in a very short time. This paper presents the digital negative sequence relay algorithm for unbalanced protection in a generator. The proposed algorithm was tested by using collected current signals on PSCAD/EMTDC considering a hydro turbine based generator control system. It can be seen that the proposed relaying by negative sequence current is useful for detection of unbalanced state of large generator.

• ETRI Journal
• /
• v.32 no.2
• /
• pp.222-229
• /
• 2010

A conventional pseudorandom sequence generator creates only 1 bit of data per clock cycle. Therefore, it may cause a delay in data communications. In this paper, we propose an efficient implementation method for a pseudorandom sequence generator with parallel outputs. By virtue of the simple matrix multiplications, we derive a well-organized recursive formula and realize a pseudorandom sequence generator with multiple outputs. Experimental results show that, although the total area of the proposed scheme is 3% to 13% larger than that of the existing scheme, our parallel architecture improves the throughput by 2, 4, and 6 times compared with the existing scheme based on a single output. In addition, we apply our approach to a $2{\times}2$ multiple input/multiple output (MIMO) detector targeting the 3rd Generation Partnership Project Long Term Evolution (3GPP LTE) system. Therefore, the throughput of the MIMO detector is significantly enhanced by parallel processing of data communications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.11
• /
• pp.2507-2513
• /
• 2010

In this paper, we show that the shrinking generator with two LFSR whose characteristic polynomials are primitive is an interleaving generator and analyze phase shifts in shrunken sequence. Also for a given intercepted sequence of shrunken sequence, we propose. the method of reconstructing some deterministic bits of the shrunken sequence using phase shifts.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2283-2291
• /
• 2010

The shrinking generator which is one of clock-controlled generator is a very simple generator with good cryptographic properties. A nonlinear sequence generator based on two 90/150 maximum length cellular automata can generate pseudorandom sequences at each cell of cellular automata whose characteristic polynomials are same. The nonlinear sequence generated by cellular automata has a larger period and a higher linear complexity than shrunken sequence generated by LFSRs. In this paper we analyze shrunken-interleaved sequence based on 90/150 maximum length cellular automata. We show that the sequence generated by nonlinear sequence generator based on cellular automata belongs to the class of interleaved sequence. And we give an effective algorithm for reconstructing unknown bits of output sequence based on intercepted keystream bits.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.7 no.3
• /
• pp.11-22
• /
• 1997

The number of output sequence was proposed as a characteristic of binary sequence generators for cryptographic application, but in general most of binary sequence generators have single number of output sequence. In this paper, we propose two types of binary sequence generators with a large number of output sequences. The first one is a Switched-Tap LFSR (STLFSR) and it applies to the generalized nonlinear function and the Geffe's generator as example. The other is a generalized memory sequence generator(GMEM-BSG) which is an improved version of the Golic's memory sequence generator (MEM-BSG) with a large number of output sequences, and its period, linear complexity, and the number of output sequence are derived.

• Proceedings of the KIPE Conference
• /
• 2012.07a
• /
• pp.154-155
• /
• 2012

The dynamic voltage restorer (DVR) is an effective protection device for wind turbine generator based on doubly-fed induction generator (DFIG) operated under the unbalanced voltage dip conditions. The compensating voltages of DVR depend on the voltage dips and on the influence of the zero sequence components. If the $Y_0/{\Delta}$ step-up transformers are used, there are no zero sequence components on the DFIG side. However, if the $Y_0/Y_0$ step-up transformers are used, the zero sequence components will appear during faults. The zero sequence components result in the high insulation costs and the asymmetric of the terminal voltages. This paper proposes a method for controlling zero sequence components in DVR to protect DFIG under unbalanced voltage dips. Simulation results are presented to verify the effectiveness of the proposed control method.

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

A Research of binary random sequence generator that uses a linear shift register had been studied since the 1970s. These generators were used in stream cipher. In general, the binary random sequence generator consists of linear shift registers that generate sequences of maximum period and a nonlinear filter function or a nonlinear combination function to generate a sequence of high linear complexity. Therefore, To generate a sequence that have long period as well as high linear complexity becomes an important factor to estimate safety of stream cipher. Usually, the maximum period of the sequence generated by a linear feedback shift register with L resistors is less than or equal to $2^L$-1. In this paper, we propose new binary random sequence generator that consist of L registers and 2 sub-characteristic polynomials. According to an initial state vector, the least period of the sequence generated by the proposed generator is equal to or ions than it of the sequence created by the general linear feedback shift register, and its linear complexity is increased too.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1307-1329
• /
• 2022

This paper proposes an improved Pseudorandom Sequence Generator (PRSG) based on the concept of modular arithmetic systems with non-integral numbers. The generated random sequence use in various cryptographic applications due to its unpredictability. Here the mathematical model is designed to solve the problem of the non-uniform distribution of the sequences. In addition, PRSG has passed the standard statistical and empirical tests, which shows that the proposed generator has good statistical characteristics. Finally, image encryption has been performed based on the sort-index method and diffusion processing to obtain the encrypted image. After a thorough evaluation of encryption performance, there has been no direct association between the original and encrypted images. The results show that the proposed PRSG has good statistical characteristics and security performance in cryptographic applications.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.5
• /
• pp.67-72
• /
• 2002

The number of keystream cycle sequences has been proposed as a characteristic of binary sequence generators for cryptographic applications, but in general most binary sequence generators have the only one-cycle sequence. In this paper, we propose a switching-tap LFSR as a basic function of a multiple-cycle binary sequence generator and the improved Rueppel's multiple-cycle generator. Finally we analyze its period, linear complexity, and the number of its keystream cycle sequences.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1474-1481
• /
• 2000

The number of keystream cycle sequences has been proposed as a characteristic of binary sequence generator for cryptographic application, but in general the most of binary sequence generators have a single cycle. On the other hand, S-box has been used to block cipher for a highly nonlinear element and then we apply it to the stream cipher with a high crypto-degree. In this paper, we propose a multiple-cycle binary sequence generator based on S-box which has a high nonlinearity containing SAC property and analyze its period, linear complexity, randomness and the number of keystream cycle sequences.