Implementation of aes algorithm using GF (3n) modulo system

Publications

Implementation of aes algorithm using GF (3n) modulo system

Year : 2017

Publisher : Institute of Advanced Scientific Research, Inc.inquiry@i-asr.org

Source Title : Journal of Advanced Research in Dynamical and Control Systems

Document Type :

Abstract

For the most part there are unbounded quantities of routes in number framework. In any case, machines include them two’s though humans include them tens. It is as of now demonstrated that for the base number of calculations to be accessible for a number, a base-e number framework is picked. As the whole number estimation of e is nearest to 3, we take a shot at the number system with base 3. As a rule there exists a framework which can change over a ternary number into parallel and afterward double to polynomial shape and after that send the scrambled information to the authority of information. In this paper, we examine an approach which can change over a ternary number specifically into polynomial shape, skirting the progression of transformation to transitional parallel frame. We actualize AES calculation utilizing the proposed ternary framework as a swap for GF(2n).