Show simple item record

dc.contributor.authorZhang, K
dc.contributor.authorTomlinson, M
dc.contributor.authorAhmed, Mohammed Zaki
dc.contributor.authorMa, X
dc.date.accessioned2018-09-13T08:58:34Z
dc.date.issued2018-07-12
dc.identifier.issn1751-8628
dc.identifier.issn1751-8636
dc.identifier.urihttp://hdl.handle.net/10026.1/12347
dc.descriptioncopyright: © Institution of Engineering and Technology
dc.description.abstract

In this study, random codes are applied to the classical syndrome coding scheme to achieve secrecy of communications. By analysing the effect of the values of the columns of the parity check matrix on the resulting security level of communications, a code design method is presented which constructs a class of random codes, termed random permutation codes, which achieve high security levels and are easily generated. A theoretical analysis method is presented which determines the security level achieved by randomly chosen, linear binary codes, and compared with simulation results obtained by Monte Carlo analysis. The results verify the theoretical approach. In particular, the theoretical method is also suitable for analysis of long codes having a large number of parity check bits which are beyond evaluation by computer simulation. The results show that the security performance of any randomly chosen permutation code is close to that of the best equivocation code having the same code parameters. This has the practical advantage in syndrome coding of being able to use an ephemeral code for each communication session, thereby providing forward secrecy, a desired feature of modern, secure communication systems.

dc.format.extent1555-1562
dc.languageEnglish
dc.language.isoEnglish
dc.publisherInstitution of Engineering and Technology
dc.rightsAttribution 4.0 International
dc.rightsAttribution 4.0 International
dc.rightsAttribution 4.0 International
dc.rightsAttribution 4.0 International
dc.rightsAttribution 4.0 International
dc.rightsAttribution 4.0 International
dc.rightsAttribution 4.0 International
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.titleThe expected security performance of random linear binary codes in syndrome coding
dc.typejournal-article
dc.typearticle
plymouth.issue13
plymouth.volume12
plymouth.publisher-urlhttp://digital-library.theiet.org/content/journals/10.1049/iet-com.2017.1243
plymouth.publication-statusPublished
plymouth.journalIET Communications
dc.identifier.doi10.1049/iet-com.2017.1243
plymouth.organisational-group/Plymouth
plymouth.organisational-group/Plymouth/Faculty of Science and Engineering
plymouth.organisational-group/Plymouth/Faculty of Science and Engineering/School of Engineering, Computing and Mathematics
plymouth.organisational-group/Plymouth/REF 2021 Researchers by UoA
plymouth.organisational-group/Plymouth/REF 2021 Researchers by UoA/UoA12 Engineering
plymouth.organisational-group/Plymouth/Users by role
plymouth.organisational-group/Plymouth/Users by role/Academics
dcterms.dateAccepted2018-04-08
dc.rights.embargodate2021-7-7
dc.identifier.eissn1751-8636
dc.rights.embargoperiodNot known
rioxxterms.versionofrecord10.1049/iet-com.2017.1243
rioxxterms.licenseref.urihttp://creativecommons.org/licenses/by/4.0/
rioxxterms.licenseref.startdate2018-07-12
rioxxterms.typeJournal Article/Review


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution 4.0 International
Except where otherwise noted, this item's license is described as Attribution 4.0 International

All items in PEARL are protected by copyright law.
Author manuscripts deposited to comply with open access mandates are made available in accordance with publisher policies. Please cite only the published version using the details provided on the item record or document. In the absence of an open licence (e.g. Creative Commons), permissions for further reuse of content should be sought from the publisher or author.
Theme by 
Atmire NV