RO  EN
IMI/Publicaţii/QRS/Ediţii/QRS v.13, n.2 (14), 2005/

Computing in GF(pm) and in gff(nm) using Maple

Authors: C. Koscielny

Abstract

It is mentioned in [1] that the author intends to show how to construct strong ciphers using SMG(pm)}. But in order to implement such cryptosystems, an effective tool for computing in GF(pm) and SMG(pm), in the form of an appropriate hardware or soft- ware, is needed. The operation of this hardware or software ought to be de_ned by means of the detailed algorithms. Thus, to get ready the execution of his intention, the author describes in the paper these algorithms, which are represented as routines, written in the comprehensive Maple interpreter, intelligible both for mathematicians and programmers as well. The routines may be used either immediately as elements of encrypting/decrypting procedures in the Maple programming environment or can be easily translated into any compiled programming language (in this case encryption/decryption can be performed at least 100 times faster than in the Maple environment). Aside from that on the basis of the mentioned routines any VLSI chip as the encrypting/decrypting ardware for SMG(pm)− and GF(pm)−based cryptosystems can be produced.

C. Koscielny
Academy of Management in Legnica
Faculty of Computer Science
ul. Reymonta 21
59-220 Legnica
Poland
E-mail:



Fulltext

Adobe PDF document – 0.25 Mb