| 摘要 |
<p>The invention concerns a set of particular keys designed to prove the authenticity of an entity or the integrity of a message. The proof is established by a set of keys comprising: m (≥1) pairs of private Qi and public Gi = gi2 values; a public module n consisting of the product of f(≥2) prime factors; an exponent v=2k (k > 1), linked by relationships of the type: G¿i .Qi?v 1. mod n or G¿i? QI?v¿ mod n . The set of keys is produced such that: among the m numbers obtained by increasing Q¿i? or its inverse modulo n to modulo n square, k-1 times rank, at least one of them is different from ∓ gi; among the 2m equations: x?2¿ g¿i? mod n, x?2¿ -g¿i? mod n at least one of them has solutions in x in the ring of the modulo n integers.</p> |
