• Title/Summary/Keyword: binary sequence

Search Result 278, Processing Time 0.02 seconds

On a Multiple-cycle Binary Sequence Genrator Based on S-box (S-box 형태의 다 수열 발생기에 관한 연구)

  • Lee, Hun-Jae
    • 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.

  • PDF

Study on the Generation of Inaudible Binary Random Number Using Canonical Signed Digit Coding (표준 부호 디지트 코딩을 이용한 비가청 이진 랜덤 신호 발생에 관한 연구)

  • Nam, MyungWoo;Lee, Young-Seok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.8 no.4
    • /
    • pp.263-269
    • /
    • 2015
  • Digital watermarking is imperceptible and statistically undetectable information embeds into digital data. Most information in digital audio watermarking schemes have used binary random sequences. The embedded binary random sequence distorts and modifies the original data while it plays a vital role in security. In this paper, a binary random sequence to improve imperceptibility in perceptual region of the human auditory system is proposed. The basic idea of this work is a modification of a binary random sequence according to the frequency analysis of adjacent binary digits that have different signs in the sequence. The canonical signed digit code (CSDC) is also applied to modify a general binary random sequence and the pair-matching function between original and its modified version. In our experiment, frequency characteristics of the proposed binary random sequence was evaluated and analyzed by Bark scale representation of frequency and frequency gains.

A New Construction of Quaternary LCZ Sequence Set Using Binary LCZ Sequence Set (이진 낮은 상관 구역 수열군을 이용한 새로운 4진 낮은 상관 수열군의 생성법)

  • Jang, Ji-Woong;Kim, Sang-Hyo;Lim, Dae-Woon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1C
    • /
    • pp.9-14
    • /
    • 2009
  • In this paper, using the binary (N,M,L,1) low correlation zone(LCZ) sequence set with specific property, we propose the construction method of a quaternary LCZ sequence set with parameters (2N,2M,L,2). The binary LCZ sequence using this method must have period $N{\equiv}3$ mod 4, balance property, and specific correlation property. The proposed method is modified from the construction method of binary LCZ sequence set by using binary LCZ sequence with specific condition proposed by Kim, Jang, No, and Chung[4].

New Construction Method for Quaternary Aperiodic, Periodic, and Z-Complementary Sequence Sets

  • Zeng, Fanxin;Zeng, Xiaoping;Zhang, Zhenyu;Zeng, Xiangyong;Xuan, Guixin;Xiao, Lingna
    • Journal of Communications and Networks
    • /
    • v.14 no.3
    • /
    • pp.230-236
    • /
    • 2012
  • Based on the known binary sequence sets and Gray mapping, a new method for constructing quaternary sequence sets is presented and the resulting sequence sets' properties are investigated. As three direct applications of the proposed method, when we choose the binary aperiodic, periodic, and Z-complementary sequence sets as the known binary sequence sets, the resultant quaternary sequence sets are the quaternary aperiodic, periodic, and Z-complementary sequence sets, respectively. In comparison with themethod proposed by Jang et al., the new method can cope with either both the aperiodic and periodic cases or both even and odd lengths of sub-sequences, whereas the former is only fit for the periodic case with even length of sub-sequences. As a consequence, by both our and Jang et al.'s methods, an arbitrary binary aperiodic, periodic, or Z-complementary sequence set can be transformed into a quaternary one no matter its length of sub-sequences is odd or even. Finally, a table on the existing quaternary periodic complementary sequence sets is given as well.

Periodic Binary Sequence Time Offset Calculation Based on Number Theoretic Approach for CDMA System (CDMA 시스템을 위한 정수론 접근 방법에 의한 주기이진부호의 사건?? 계산)

  • 한영열
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.5
    • /
    • pp.952-958
    • /
    • 1994
  • In this paper a method calculates the time offset between a binary sequence and its shifted sequence based on the number theoretic approach is presented. Using this method the time offset between a binary sequence and its shifted sequence can be calculated. It has been recongnized that the defining the reference (zero-offset) sequence is important in synchronous code division multiple access(CDMA) system since the same spreading sequence are used by the all base station. The time offset of the sequence with respect to the zero offset sequence are used to distinguish signal received at a mobile station from different base stations. This paper also discusses a method that defines the reference sequence.

  • PDF

Binary random sequence generation by use of random sampling of M-sequence

  • Hiroshi Harada;Hiroshi Kashiwagi;Satoshi Honda;Kazuo Oguri
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1987.10a
    • /
    • pp.832-835
    • /
    • 1987
  • This paper proposes a new method of generating binary random sequences using a randomly sampled M-sequence. In this paper two methods of sampling are proposed. Expected values of the autocorrelation function of the sequence generated by these methods are calculated theoretically. From the results of computer simulation, it is shown that using these methods, we can get binary random sequences which have good random properties.

  • PDF

A Study on Binary Direct-Sequence Spread Spectrum Multiple Access Communications over Rayleigh Fading Channels (Rayleigh 페이팅 채널에서의 Binary 직접 시퀀스 확산 대역 다중 접근 통신에 관한 연구)

  • 허문기;박상규
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.12
    • /
    • pp.1910-1917
    • /
    • 1989
  • This paper shows the performances of asynchronous binary direct-sequence spread-spectrum multiple access communication systems with Rayleigh fading and White Gaussian noise. The performance measures considered are worst-case bit error probability and average SNR depending on code sequences and chip waveforms. The code sequences used are m-sequence and Gold sequence with period 31.The chip waveforms employed are rectangular, sinusoidal and something other chip waveforms.

  • PDF

Construction Method of Binary Low Correlation Zone Sequence Set Using Gray Mapping (Gray 사상을 이용한 이진 낮은 상관구역 수열군의 생성법)

  • Jang, Ji-Woong;Kim, Young-Sik;Lim, Dae-Woon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.2C
    • /
    • pp.169-174
    • /
    • 2009
  • In this paper, we propose a new construction method of binary low correlation zone (LCZ) sequence set. New construction method applies Gray mapping to conventional quaternary LCZ sequence set that has specific property. The period of new binary sequence set is twice as that of used sequence set in construction, and maximum magnitude of correlation value within the LCZ and cardinality of new set is also twice as those of used quaternary sequence set. But the LCZ size is the same with that of used sequence set. If the used Quaternary sequence set is optimal, the constructed binary sequence set is optimal with high probability.

Binary Sequence Generator with a Large Number of Output Sequences (다수열 출력 이진 수열 발생기)

  • 이훈재;문상재
    • 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.

A Proposal on a Multiple-Cycle Binary Sequence Generator with a ST-LFSR

  • Lee, Hoon-Jae;Park, Hee-Bong
    • 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.

  • PDF