Multiples of Primitive Polynomials and Their Products Over GF(2).

Date of Submission

December 2002

Date of Award

Winter 12-12-2003

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)

A standard model of nonlinear combiner generator for stream cipher system combines the outputs of several independent Linear Feedback Shift Register ( LFSR ) sequences using a Nonlinear Boolean Function to produce the key stream. Given such a model, cryptanalytic attacks have been proposed by finding the sparse multiples of the connection polynomials corresponding to the LFSRS. Analysis of sparse multiples of a primitive polynomial or product of primitive polynomials helps in identifying the the robustness of the steam ciphers based on nonlinear combiner model. In this direction, recently few works are published on t-nomial multiples of primitive polynomials and degree distribution of these multiples. We present new enumeration results for multiples of product of primitive polynomials and provide some results on degree distribution of these multiples. Further we provide a randomized algorithm for finding sparse multiples of primitive polynomials and their products.

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:28843058

Control Number

ISI-DISS-2002-85

Creative Commons License

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

DOI

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

This document is currently not available here.

Share

COinS