Disclosed is a method that includes receiving, at a scheduling server, a request for a first particle of a pair of quantum entangled particles and a second particle of the pair of quantum entangled particles, evaluating the request based on one or more parameters to yield a schedule and communicating instructions from the scheduling server to an entangled particle production system to deliver, according to the schedule, the first particle to a first node and to deliver the second particle to a second node according to the request. In this manner, respective particles of a quantum entangled pair can be delivered to the appropriate nodes for use in a communication.

A system for quantum key synchronization within a server-cluster is provided. The system may include a plurality of silicon-based servers encapsulated in quantum cases. Each quantum case may include a quantum tunneling transmitter module, a quantum random number generator and a quantum entanglement module. The quantum cases may communicate with each other via the quantum tunneling transmitter module or any other suitable manner. The quantum cases may only communicate with cases with which they are entangled. Therefore, in the event of a compromise on one of the servers, the quantum entanglement module, included in the case that encapsulates the compromised server, may become disentangled, and therefore not be able to communicate with the other servers included in the cluster using an internal communications protocol.

According to an embodiment, a quantum cryptographic device includes a memory and one or more processors coupled to the memory. The one or more processors are configured to: tabulate information on an application key transmitted and received by using a quantum cryptographic key and output an application-key information tabulation result; calculate a unit price of the application key based on the application-key information tabulation result; and display information that is display information including the unit price of the application key.

A set of users who may authenticate is predefined and is associated, each, with a reference secret share. A first subset of users who has, each, to authenticate is predefined. The device defines a second subset of the users who has, each, to authenticate while further satisfying, each, to be physically proximate to the device and an authentication condition(s). The second user subset is comprised within the first user subset comprised within the user set. The device verifies whether each user of the second user subset satisfies to be physically proximate to the device and the authentication condition(s), if yes, requests, to each user device, the secret share and receives, from each user device relating to at least the first user subset, the secret share. The device reconstructs a secret with each received secret share, verifies whether the reconstructed matches the reference and, if yes, authenticates the user set.

A method creates and distributes cryptographic keys for securing communication at two terminals. Signals for creating correlated values in the two terminals are distributed via a first communication channel burdened with error, and the correlated values are present as keys. A checksum is formed on the basis of the first key present in the first terminal and the checksum is transferred to the second terminal via a second communication channel. A second checksum is formed on the basis of the second key present, and information derived from the two checksums is transferred via the second communication channel to a server. Based on the information derived from the checksums, the server determines a correction value, which, when applied to one or both keys, brings the keys into correspondence. The correction value is transferred to one or both terminals via the second communication channel and is applied to one or both keys.

A quantum computing-threat-resistant system for cryptography key exchange comprises a linear-space computing module, a manifold computing module, and a Banach-space computing module. The system implements the technologies of homotopy morphing and key cloaking for facilitating the key-exchanging processes to perform quantum computing-threat-resistant operations in a mathematics space which is different from the spaces that generic quantum attacks work on, and then retrieve the original key in a Hilbert space after the processes of key exchange. The system not only avoids quantum attacks on key-exchanging processes, but also avoids the defects of current PQC solutions, the vulnerability of the main streamed symmetric & asymmetric encryption systems, and the limitation of quantum key operation in a Hilbert space. Both legacy key solution and quantum key solution are provided and implemented without requiring expensive devices.

A path computation engine, PCE, (100) for an optical communications network comprising a plurality of nodes and a plurality of links. The PCE comprises a processor and memory comprising instructions executable by the processor whereby the PCE is operative to: receive a request to configure a quantum key, Qkey, path from a first node to a second node in the optical communications network for a quantum key distribution, QKD, signal for a quantum key for a secure data transmission signal; calculate a feasible Qkey path from the first node to the second node that is logically different to a traffic path from the first node to the second node for the secure data transmission signal, wherein the Qkey path is feasible if an optical signal power originating from the secure data transmission signal within the Qkey path, caused by optical interference of the secure data transmission signal with the QKD signal, is below a predetermined threshold value; and generate a control signal comprising instructions arranged to configure said feasible Qkey path.

According to one embodiment, an information processing method includes a monitoring step and a key provision step. The monitoring step includes monitoring an operation state of an information processing device including a key generating unit that generates key information shared among a plurality of devices using a quantum key distribution technique. The key provision step includes providing the generated key information when the operation state satisfies a predetermined condition and stopping the provision of the generated key information when the operation state does not satisfy the condition.

A set of users who may authenticate is predefined and is associated, each, with a reference secret share. A first subset of users who has, each, to authenticate is predefined. The device defines a second subset of the users who has, each, to authenticate while further satisfying, each, to be physically proximate to the device and an authentication condition(s). The second user subset is comprised within the first user subset comprised within the user set. The device verifies whether each user of the second user subset satisfies to be physically proximate to the device and the authentication condition(s), if yes, requests, to each user device, the secret share and receives, from each user device relating to at least the first user subset, the secret share. The device reconstructs a secret with each received secret share, verifies whether the reconstructed matches the reference and, if yes, authenticates the user set.

Aspects of the subject disclosure may include, for example, determining that quantum entanglement be established between first and second nodes of a service provider network including a software defined network (SDN) that facilitates delivery of a service to a subscriber and identifying a path between the first node and the second node based on pre-provisioned information supplied by the SDN. A path length of the path is estimated based on the pre-provisioned information supplied by the SDN, and a repeater node is selected responsive to the path length exceeding a threshold, wherein the path includes a first segment having a segment length that does not exceed the threshold. A quantum entanglement state is shared between the first and second nodes based on transportation of a first photon of a first entangled pair of photons via the first segment. Other embodiments are disclosed.