Show simple item record

dc.contributor.supervisorAhmed, Mohammed Zaki
dc.contributor.authorAl-Hassan, Salah Yousif Radhi
dc.contributor.otherSchool of Engineering, Computing and Mathematicsen_US
dc.date.accessioned2015-11-06T10:29:22Z
dc.date.available2015-11-06T10:29:22Z
dc.date.issued2015
dc.date.issued2015
dc.identifier10358535en_US
dc.identifier.urihttp://hdl.handle.net/10026.1/3765
dc.description.abstract

Since the definition of the wiretap channel by Wyner in 1975, there has been much research to investigate the communication security of this channel. This thesis presents some further investigations into the wiretap channel which improve the reliability of the communication security. The main results include the construction of best known equivocation codes which leads to an increase in the ambiguity of the wiretap channel by using different techniques based on syndrome coding. Best known codes (BKC) have been investigated, and two new design models which includes an inner code and outer code have been implemented. It is shown that best results are obtained when the outer code employs a syndrome coding scheme based on the (23; 12; 7) binary Golay code and the inner code employs the McEliece cryptosystem technique based on BKC0s. Three techniques of construction of best known equivocation codes (BEqC) for syndrome coding scheme are presented. Firstly, a code design technique to produce new (BEqC) codes which have better secrecy than the best error correcting codes is presented. Code examples (some 50 codes) are given for the case where the number of parity bits of the code is equal to 15. Secondly, a new code design technique is presented, which is based on the production of a new (BEqC) by adding two best columns to the parity check matrix(H) of a good (BEqC), [n; k] code. The highest minimum Hamming distance of a linear code is an important parameter which indicates the capability of detecting and correcting errors by the code. In general, (BEqC) have a respectable minimum Hamming distance, but are sometimes not as good as the best known codes with the same code parameters. This interesting point led to the production of a new code design technique which produces a (BEqC) code with the highest minimum Hamming distance for syndrome coding which has better secrecy than the corresponding (BKC). As many as 207 new best known equivocation codes which have the highest minimum distance have been found so far using this design technique.

en_US
dc.description.sponsorshipMinistry of Higher Education and Scientific Research, Kurdistan Regional Government, Erbil-Iraqen_US
dc.language.isoenen_US
dc.publisherPlymouth Universityen_US
dc.subjectSyndrome Coding Scheme
dc.subjectBest Known Equivocation Codes
dc.subjectWiretap Channelen_US
dc.titleAsymmetric Encryption for Wiretap Channelsen_US
dc.typeThesis
plymouth.versionFull versionen_US
dc.identifier.doihttp://dx.doi.org/10.24382/1614


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record


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