Authenticating or signature method with reduced computations

The method implements a first entity "to be authenticated", having a public key v and a secret key s, these keys being related by v = st (mod n) where n is an integer called modulus and t is a parameter, and second entity "authenticator", knowing the public key v. This process includes the exchange of information of the type with zero-knowledge between the prover and the verifier and cryptographic calculations on this information, some calculations being performed modulo n. The method of the invention is characterized in that the modulus n is specific to the authenticated entity which communicates this module to the authenticating entity