Key Negotiation Process Sample Clauses

Key Negotiation Process. The last phase of proposed protocol is the key negotiation process. Once Xxxxx and Xxx receives, the other party shared key K′(m) and K′(m) respectively. Both Xxxxx and Xxx generate a session key(S ) by applying the XOR operation between the current key(K(m), K(m)) and shared key (K′(m), K′(m)) respectively. S (m) = K(m) ⨁ K′(m) − −− Xxxxx xxx S (m) = K(m) ⨁ K′(m) − −− Xxx xxx The proposed protocol is discussed with an example, Xxxxx and Xxx generate a random key sequence of length m + n = 24 bits where m = 16 bits for key negotiation and n = 8 bits for authentication purpose, decoy sequence length (m + n)/2 = 12 bits for eavesdropping. Both the users generate a hash key of fixed length h = 6 based on the pre-shared key sequence, identity information and nonce. when the hash value is 0,with it generates a Bell state in position {(1,2) and (3,4)} or else in position {(1,3) and (2,4)}. Insertion of Decoy EPR pair depends on two consecutive hash value positions, if H 1 ⨁ H2 = 0, then insert the decoy Pair before the regular pair or else after the regular pair. In our example,H 1 = 1 and H 2 = 1; therefore we insert the decoy pair before the regular EPR pair in the position of {(1,2) and (3,4)}. With the hash value of both users being the same, Xxx applies the bell state measurement on the same position; therefore the qubit sent and received are the same. Xxxxx and Xxx announce the decoy sequences position and compare12 bits to check the presence of XXX as shown as strikethrough in Table 2. Similarly Xxxxx announces the Authenticated position (2,3) and uses 8 bits for the verification of the identity of Xxx. Finally 16 bits are used for key negotiation and generation of secure session key.