“…Among different arithmetic operation, FF inversion is one of the most important and computationally complex operations. Several attempts have been made to fasten the inverse operation [3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22] using squarer and quad circuits on FPGA platforms. There are two useful approaches for finding an inversion over GF (2 m ) which includes Extended Euclidean Algorithm (EEA) [14,23] and Fermat's Little Theorem (FLT) [24].…”