Key Generation Center

The system collects three sources of entropy: the cursor's X coordinate, its Y coordinate, and the current time in milliseconds. The more chaotic the mouse movement, the higher the quality of the entropy.

For each of the three values, the system determines whether it is odd (parity = 1) or even (parity = 0).

Examples: X=125 → odd → 1; Y=84 → even → 0; Time=1623456789 → odd → 1

The three parity bits (X, Y, time) are added modulo 2 (the XOR operation).

XOR works as follows: the result is 1 if the number of ones (odd values) is odd.

• 0+0+0 = 0 → even number of ones → bit = 0
• 1+0+1 = 2 → even number of ones → bit = 0
• 1+1+1 = 3 → odd number of ones → bit = 1
• 1+0+0 = 1 → odd number of ones → bit = 1

The result of the XOR operation becomes one bit of the future cryptographic key. This operation repeats for each new cursor position at fixed time intervals.

Bits are sequentially collected into key cells. Once enough bits have been gathered (16 in this simulation), the full cryptographic key is formed.

A key generated this way has high cryptographic strength, since it cannot be predicted without knowing the exact cursor trajectory and the timing of each sample.