Orange

Florian Bourse

Jacques Traore

Olivier Sanders

A cryptographic method including: generating by a first device having a datum x an RSA module N; computing by the first device a number C=gh1, g being an element of sub-group G of order b, h1 being an element of sub-group H of order f, and a, b, d, f being integers, b and f being mutually prime, and x and y being less than d/a; sending C to a second device having datum y; computing by the second device D=C(gh3)h2, u and v being random numbers and h2 and h3 being elements of H, and a first fingerprint (gh3); sending to the first device, D and the first fingerprint; computing by the first device (D)', f′=1/f; obtaining based on (D)′ a second fingerprint; and determining whether x is greater than or equal to y or x is less than y by comparing the first and the second fingerprints.

Growing community of inventors

Chatillon, France

Florian Bourse