| http://www.w3.org/ns/prov#value | - A method as claimed in claim 9 wherein the secret number comprises a Diffie-Hellman value gn mod p, where p is a prime number and g is a generator for a Diffie-Hellman key exchange protocol and n is a positive integer less than p???1. 11.
|
