The Emergence of Picard Jacobians in Cryptography

Abstract

In this paper we present a new family of Jacobian Varieties defined over finite fields that provides many elements whose group structure is suitable for cryptosystems based on the intractability of the discrete logarithm problem. Their security against several know attacks and the efficiency (and effectiveness) of the most important algorithms of the corresponding cryptosystems are discussed.