Finding the Approximate Generator Polynomial and Corresponding Initial Sequence of a Given Binary String Using Simulated Annealing.

Author (Researcher Name)

Deepak Kumar Dalai, Indian Statistical InstituteFollow

Date of Submission

December 2003

Date of Award

Winter 12-12-2004

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science

Department

Applied Statistics Unit (ASU-Kolkata)

Supervisor

Maitra, Subhamoy (ASU-Kolkata; ISI)

Abstract (Summary of the Work)

In LFSR based cryptosystem binary sequence generated by a generator poly- nomial. Since our real channel is not noise free, at the recciver end the receiver gets corrupted data i.e. some bits altered due to noise. so, to decode the mes- sage we need the actual polynomial and the initial sequence. From which we will get back the generated sequence. Here, we try to obtain the original generator polynomial and the initial sequence using simulated annealing.

Comments

ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843160

Control Number

ISI-DISS-2003-107

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/6279

Recommended Citation

Dalai, Deepak Kumar, "Finding the Approximate Generator Polynomial and Corresponding Initial Sequence of a Given Binary String Using Simulated Annealing." (2004). Master’s Dissertations. 142.
https://digitalcommons.isical.ac.in/masters-dissertations/142