Attack of multiplicative inverse without using extended Euclid's algorithm

Abstract

The multiplicative cipher is one of the substitution cipher types so it is modified in this paper by extend the mod scale with 190 instead of 26, then utilized to do encryption for a plaintext. Therefore it produces a variation of symbols with more randomized cipher text so that it is enhanced. Then the major work in the paper is to attack the produced cipher text by search about the key inverse which found by an invented and effective equation, instead of the tradition Euclid's algorithm therefore successful attack was done.