Show simple item record

dc.contributor.authorWu, Xin-Wenen_US
dc.contributor.authorKoh, Soo Ngeeen_US
dc.contributor.authorChui, Chee-Cheonen_US
dc.contributor.editorMichael Gastpar, Robert W. Heath, Jr, and Krishna Narayananen_US
dc.date.accessioned2017-05-03T13:11:21Z
dc.date.available2017-05-03T13:11:21Z
dc.date.issued2010en_US
dc.date.modified2012-09-02T23:14:56Z
dc.identifier.refurihttp://www.isit2010.org/en_US
dc.identifier.doi10.1109/ISIT.2010.5513547en_US
dc.identifier.urihttp://hdl.handle.net/10072/36970
dc.description.abstractA linear feedback shift register (LFSR) is a basic component of a linear scrambler and a stream cipher for a communication system. And primitive polynomials are used as the feedback polynomials of the LFSRs. In a non-cooperative context, the reverse-engineering of a linear scrambler and a stream cipher includes recovering the feedback polynomials and the LFSR's initial states (which are the secret keys in the case of stream ciphers). The problem of recovering the secret keys of stream ciphers has been extensively studied. For example, an effective approach for recovering a secret key is known as the correlation attack in the literature. The problem of reconstructing the feedback polynomials of a stream cipher and a linear scrambler has been studied recently. Both recovering the LFSR initial states by the above-mentioned correlation attack and reconstructing the feedback polynomials are highly dependent on an assumption, that is, they require that the feedback polynomials have sparse multiples of moderate degrees. Hence, in order to build linear scramblers and stream ciphers that are robust against reverse engineering, we should use primitive polynomials which do not have sparse multiples of moderate degrees. In this paper, we study the existence of primitive polynomials which do not have sparse multiples of moderate degrees, and the density of such primitive polynomials among all primitive polynomials. Our results on the existence and density of such primitive polynomials are better than the previous results in the literature.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_US
dc.format.extent142443 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_US
dc.publisherIEEEen_US
dc.publisher.placeUnites Statesen_US
dc.relation.ispartofstudentpublicationNen_US
dc.relation.ispartofconferencenameISIT 2010en_US
dc.relation.ispartofconferencetitle2010 IEEE International Symposium on Information Theory, Proceedingsen_US
dc.relation.ispartofdatefrom2010-06-13en_US
dc.relation.ispartofdateto2010-06-18en_US
dc.relation.ispartoflocationAustin, United Statesen_US
dc.rights.retentionYen_US
dc.subject.fieldofresearchcode280499en_US
dc.titlePrimitive Polynomials for Robust Scramblers and Stream Ciphers Against Reverse Engineeringen_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conference Publications (HERDC)en_US
dc.type.codeE - Conference Publicationsen_US
gro.facultyGriffith Sciences, Griffith School of Engineeringen_US
gro.rights.copyrightCopyright 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_US
gro.date.issued2010
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record