in the yellow paper you said that "A critical difference between the proposed Quantum Encryption Key Generator (QEKG) and
currently utilized encryption techniques, such as elliptic curve cryptography, is that the QEKG
generates four independent streams of fundamentally random sets of numbers with certain
intrinsic mathematical properties and adjustable entropy as a consequence of the quantum
nature of the generator. " How does it is work exactly?
Using the quantum entanglement device that we designed to generate pairs of public and private keys of arbitrary length requires several orders of magnitude less CPU usage comparing to any sufficiently secure math algorithm, especially for longer keys. The device measures a time difference of detecting individual photons between 4 detectors. By defining the coincidence window we extract sequences of random numbers which we then converted to key pairs. There are several ways to utilize these random keys on a pair of communicating clients using simple computations, such as multidimensional cellar automata or training a cryptographic deep neural network.
The device is also designed to produce long strings of random numbers (in addition to keys that derived from the timestamp comparisons) which belongs to Z4 group, that can be used in conjunction or reparably from timestamps. These vector had such property that if you from a column vector using 4 streams the sum of all 4 column values must always be 1. This can be used for mutual authentication, since the values of each row cannot be predicted, any deviation from it will invalidate the transaction resulting in new encryption keys being generated due to a very low computational overhead, unique encryption keys can be generated for each transaction, so that even if somebody later obtains actual keys for a pacific transaction (for example if keys were stored on a client computer) they cannot be used to decrypt any other transaction (or any other data block for which this type of encryption is used).