Key Reconciliation, Linear Codes, and New Algorithms
Aiden A. Bruen, Mario Professor Forcinito, James Professor McQuillan · 2021
In this chapter, the authors show how to construct new hash functions derived from linear codes in connection with the algorithms. The new checking hash function discussed has been used as “information reconciliation” in quantum cryptography and in other key-exchange protocols. The ancient difficulty for establishing a common cryptographic secret key between two communicating parties Alice and Bob is nicely summarized by the catch-22 dictum of Lomonaco [Lom99], to wit: “in order to communicate in secret one must communicate in secret.” In order to verify that the secret key possessed by Alice is indeed exactly equal to the secret key possessed by Bob, the authors design a new kind of hash function customized for this purpose based on the theory of error-correcting codes.