Development of New Algorithm for Finding Inverse of Modular Multiplication

The output of division of two integers in most of the cases is not integer in traditional arithmetic. However, in modular arithmetic, (c/d) mod p is either integer if d and p are relatively prime. . Basic Arrays and their Properties are analyzed first, The available algorithms are analyzed and MMI algorithm is proposed. The comparative Analysis of NEA vs. XEA are mad and complexity Analysis of MMI Algorithm is also made.