METHOD, SYSTEM, DEVICE FOR PROVING AUTHENTICITY OF AN ENTITYOR INTEGRITY OF A MESSAGE

摘要

The invention concerns a method whereby the proof is established by: m (> = 1) pairs of private Qi and public Gi = gi2 values; a public module n formed by the product of f(>=2) prime factors; an exponent v = 2k (k > 1), linke d by the relationships of the type: Gi .Qiv .ident. 1. mod n or Gi .ident. Qiv mod n. Among the m numbers obtained by increasing Qi or its inverse modulo n to modulo n square, k-1 times rank, at least one of them is different from .plusmn. gi. Among the 2m equations: x2 .ident. gi mod n, x2 .ident. -gi mod n, at least one of them has solutions in x in the ring of modulo n integers.