Title page for ETD etd-09012005-115040

Document Type Master's Dissertation
Author Kruger, David
URN etd-09012005-115040
Document Title Adaptive homophonic coding techniques for enhanced e-commerce security
Degree MEng (Data Security)
Department Electrical, Electronic and Computer Engineering
Advisor Name Title
Prof W T Penzhorn Committee Chair
  • computer security
  • electronic commerce
Date 2002-10-09
Availability unrestricted
This dissertation considers a method to convert an ordinary cipher system, as used to secure e-commerce transactions, into an unconditionally secure cipher system, i.e. one that generates ciphertext that does not contain enough statistical information to break the cipher, irrespective of how much ciphertext is available. Shannon showed that this can be achieved by maximizing the entropy of the message sequence to be encrypted. This, in turn, achieved by means of homophonic coding. Homophonic coding substitutes characters in the message source with randomly chosen codewords. It offers the advantage that it enables protection against known- and chosen plaintext attacks on cipher algorithms since source statistics are randomly changed before encryption. The disadvantage of homophonic substitution is that it will in general increase the length of the message sequence. To compensate for this, homophonic coding is combined with the data compression algorithm known as arithmetic coding. It is shown that the arithmetic coding algorithm can be adapted to perform homophonic coding by dyadically decomposing the character probabilities in its probability estimation phase. By doing this, a faster version of arithmetic coding, known as shift-and-add arithmetic coding can be implemented. A new method of statistical modelling, based on an Infinite Impulse Response filtering method is presented.

A method to adapt the well-known Lempel-Ziv- Welch compression algorithm to perform homophonic coding is also presented. The procedure involves a bit-wise exclusive-or randomization operation during encoding. The results show that the adapted algorithms do indeed increase the entropy of the source sequences by no more than 2 bits/symbol, and even offers compression in some cases.

2002, University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria.

Please cite as follows:

Kruger, D 2002, Adaptive homophonic coding techniques for enhanced e-commerce security, MEng dissertation, University of Pretoria, Pretoria, viewed yymmdd < http://upetd.up.ac.za/thesis/available/etd-09012005-115040/ >


  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  dissertation.pdf 1.79 Mb 00:08:16 00:04:15 00:03:43 00:01:51 00:00:09

Browse All Available ETDs by ( Author | Department )

If you have more questions or technical problems, please Contact UPeTD.