A Method for Strict Remote User Identification Using non - Reversible Galois Field Transformations

¹ Department of Mathematics and Engineering Science, Hellenic Military Academy, Vari - 16673, Greece
² Department of Computer Engineering, Igor Sikorsky Kyiv Polytechnic Institute | National Technical University of Ukraine, Peremohy pr., Kiev 252056, KPI 2003, Ukraine

^* Nikolaos G. Bardis: bardis@ieee.org.org

Abstract

This article proposes an approach that accelerates the realization of strict remote user identification using non reversible Galois field transformation. The proposed approach is based on using finite field arithmetic to replace the usual modular arithmetic. The application of this efficient method that was developed using Galois Fields, renders feasible an exponential reduction of the computation time required for classical zero knowledge identification methods, such as FFSIS, Schnorr and Guillou & Quisquater. The new method for user registration and identification procedure for obtaining access to the system, are illustrated. It is shown, both theoretically and experimentally that the proposed method attains a per order acceleration of the execution time required for the user identification by 2 – 3 orders of magnitude, via a hardware implementation.