A fast method for finding separable Goppa polynomials used in post-quantum McEliece-based cryptography

This paper introduces a simple and efficient method for generating Goppa polynomials used in post-quantum cryptography based on any variant of the McEliece algorithm, and presents an application for user identification that combines cryptography and iris biometrics.