Method of Authentication Based on Polyomials
First Claim
1. A method of authentication based on polynomials for a system (10) comprising a plurality of devices (30) operable to mutually communicate, said method comprising steps of:
- (a) providing (20) each of said plurality of devices (30) with a corresponding identity value (pi;
i=1, n) together with an associated polynomial (P) for generating a polynomial key;
(b) arranging for the plurality of devices (30) to include a verifier device (p1) and a prover device (p2);
(c) arranging for the prover device (p2) to notify its existence to the verifier device (p1);
(d) arranging for the verifier device (p1) to issue a first challenge to the prover device (p2) to encrypt a nonce using the prover (p2) device'"'"'s polynomial (P) key and communicate the encrypted nonce as a response back to the verifier device (p1);
(e) arranging for the verifier device (p1) to receive the encrypted nonce as the response from the prover device (p2) and;
(i) to encrypt the first challenge using the polynomial keys generated from a set of stored device identities;
or(ii) to decrypt the response received from the prover device (p2) using the polynomial keys;
until said verifier device (p1) identifies a match for said response, said match being indicative of authentication.
1 Assignment
0 Petitions
Accused Products
Abstract
There is provided an authentication method for a system (10) comprising several devices (30). The method involves: a) providing each device (30) with an identity value (pi: i=1, . . . , n) and a polynomial (P) for generating a polynomial key; (b) including a verifier device (p1) and a prover device (P2)amongst said devices (30); (c) arranging for the prover device (p2) to notify its existence to the verifier device (P1); (d) arranging for the verifier device (pi) to challenge the prover device (p2) to encrypt a nonce using the prover (P2)device'"'"'s polynomial (P) key and communicate the encrypted nonce as a response to the verifier device (p1); (e) arranging for the verifier device (p1) to receive the encrypted nonce as a further challenge from the prover device (pZ) and: (i ) encrypt the challenge using the polynomial keys generated from a set of stored device identities; or (ii) decrypt the challenge received using the set of polynomial keys; until said verifier device (p1) identifies an authentication match.
-
Citations
12 Claims
-
1. A method of authentication based on polynomials for a system (10) comprising a plurality of devices (30) operable to mutually communicate, said method comprising steps of:
-
(a) providing (20) each of said plurality of devices (30) with a corresponding identity value (pi;
i=1, n) together with an associated polynomial (P) for generating a polynomial key;(b) arranging for the plurality of devices (30) to include a verifier device (p1) and a prover device (p2); (c) arranging for the prover device (p2) to notify its existence to the verifier device (p1); (d) arranging for the verifier device (p1) to issue a first challenge to the prover device (p2) to encrypt a nonce using the prover (p2) device'"'"'s polynomial (P) key and communicate the encrypted nonce as a response back to the verifier device (p1); (e) arranging for the verifier device (p1) to receive the encrypted nonce as the response from the prover device (p2) and; (i) to encrypt the first challenge using the polynomial keys generated from a set of stored device identities;
or(ii) to decrypt the response received from the prover device (p2) using the polynomial keys; until said verifier device (p1) identifies a match for said response, said match being indicative of authentication. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
Specification