Font Size: a A A

Based On The Serial Correlation Attacks Burst Communication Research

Posted on:2010-02-14Degree:MasterType:Thesis
Country:ChinaCandidate:D W LiuFull Text:PDF
GTID:2208360275983080Subject:Cryptography
Abstract/Summary:PDF Full Text Request
Burst communication has strong ability of anti-interference.How to use error control codes to design the system that has low complexity and satisfy the low BER(Bit Error Rate) in burst communication,which has become the important trend in communication research.As simplex code, m sequence has such characters: good randomness, low complexity of coding . And truncated simplex code even has flexible code rate,so it is fit for burst communication.For error decoding of m sequence,this paper apply the fast correlation attack algorithm to restore the initial state of m sequence.Simulation by computer,it shows good performance.We deeply investigate the fast correlation attack, especially apply fast correlation attack algorithm B to the burst communication. The research includes the following topics:We firstly survey the research background and stress the concept of the burst communication.And the main research contents of this thesie are pointed out.Then we introduce the theory of anti-interference technology and sequence coding.We survey two fast correlation attack algorithm and stress the algorithm B.In this part we give the detailed steps of algorithm B and explains the algorithm B formula.Then we apply the algorithm B to the burst communication.Design the burst signal format according to the technical specification.The burst signal is divided into two parts,one is the synchronation sequence,which has the local autocorrelation.The other part is the truncated m sequence,which has 8 segments.This m sequence's character polynomial is f ( x ) = 1+ x 3 + x25.And simulation by computer,when the channel is AWGN and the truncate length is 2800,it can restore the initial state of m sequence in succefully with -12.5dB.Then we analyse the complexity of algorithm B and simulate it in fixed point .Fixed-point simulation by C,we need convert all the double type into integer. According to the character of algorithm B,we proceed the solution in finite word effect. And the result of simulation can show we the feasibility of fixed point proceed.It shows that the fixed-point simulation has 1.5dB performance worse than float-point simulation.In the end, this thesis talks about the conpect of FPGA,and impletement the critical part by FPGA,including the cut sequence part,the frame part and the decode part.
Keywords/Search Tags:Burst Comunication, Stream Ciphers, Fast Correlation Attack, Fixed-Point Simulation, FPGA
PDF Full Text Request
Related items