Hill’s Cipher: Analysis of the Cryptographic Computational Times in the Eventuality of a Brute-Force Attack

For the present article, I use a symmetrical cryptographic method based on symbols transposition: Hill's cipher. This consists in a symmetrical approach based on modulo m arithmetic. The theory says that one has to choose a prime number as the length of the modulo-m space used. Nevertheless, based on my conclusions here, this choice is not mandatory. As a proof of concept for the supportive case study, I chose a computational medium based on a system-on-chip solution offered by Texas Instruments, namely Beagleboard. The main purpose is to emphasize the original concepts that I introduced along my PhD thesis, 'self-recognition' and 'symmetrical copy'. The data restoration operation that accompanies the set of compression/ decompression operations that I proposed requires the generation of a file called 'symmetrical copy'. The overall details of the above mentioned new concepts can be found in my PhD thesis - “Real-time compression/decompression algorithms applied to embedded systems”. That very practical context is one of the possible situations within which Hill's cipher still suits.

No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from RAISA. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Romanian Association for Information Security Assurance, if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.