Abstract: Methods and systems for performing secure quantum key distribution (QKD) over noisy channels are disclosed. A first computing device generates a challenge set using a secret seed, applies the challenges to its CRP, and receives an ordered set n responses, where n has the same number of bits as the key. It then sends only those responses in positions that correspond to is in the key to the second computing device. Those responses are sent under a QKD protocol such as BB84. The second computing device generates the same challenges and recovers the same responses with a mirror CRP mechanism. It also receives the subset of responses from the first computing device. Generated responses that match received responses correspond to is in the key, and Os are assigned to all other positions.

Abstract: Systems and methods for the generation and use of session keys supporting secure communications between a client and server device are disclosed. The client hashes each of a series of passwords a first number of times. The hashed passwords are sent to a server. The server applies the hashed password to an array of PUF devices, and receives an initial response bitstream which is stored. The client later hashes each of the series of passwords a second number of times, which is less than the first number, and these are sent to the server. The server continues to hash the second message digest, generate PUF responses, and compare the result to the initially stored responses. For each password, the number of hashes necessary to achieve a match is a partial session key. Latency is improved by an array of separately addressable PUFs, each producing a partial session key.

Abstract: Systems and methods for the generation and use of session keys supporting secure communications between a client and server device are disclosed. The client hashes each of a series of passwords a first number of times. The hashed passwords are sent to a server. The server applies the hashed password to an array of PUF devices, and receives an initial response bitstream which is stored. The client later hashes each of the series of passwords a second number of times, which is less than the first number, and these are sent to the server. The server continues to hash the second message digest, generate PUF responses, and compare the result to the initially stored responses. For each password, the number of hashes necessary to achieve a match is a partial session key. Latency is improved by an array of separately addressable PUFs, each producing a partial session key.