Extending and applying garners law for four different modulator representation of codes used in cryptography

الملخص

The scientist Garner introduced three laws and a method to convert
modular arithmetic representation of any decimal code to its
corresponding conventional representation of decimal code by using
three different modules; he does not talk about the possibility of using
this method to four different modules or more.
Without extending Garner’s laws more than three laws, it is impossible to
this method to be applicable to more than three different modules. In this
paper we extend Garner’s laws and an application is presented using four
different modules to prove and support the correctness of our
extension.