Implementation of FFSIS authentication schemes by multiplying without carries

Saydreza Mahmaly

In article the new variant of zero-knowledge FFSIS (Feige Fiat Shamir Identification Scheme) implementation fitted to identification of remote abonents of multiuser systems or tample-resistant devices is presented. The proposed FFSIS modification consist of using of mathematical operation of multiplication without carry on Galois fields instead of modular multiplication. It allows to speed up of identification process for software and hardware implementation. The technology of multiplication without carry using for FFSIS implementation is set forth clearly. A numerical example for FFSIS procedure based on Galois field multiplication is given. An analytical comparison of the FFSIS processing time of both the proposed and known variants is presented, that demonstrates the improvements attained.

Full text (pdf)