Time-based OTP Demo

Theoretical Basis

This demo uses a custom mathematical OTP generation algorithm:

$$OTP = S^C \pmod{M}$$

Where:

• $S$ (Secret): A random seed generated by the server.
• $C = \lfloor \frac{T - T_0}{I} \rfloor$: Number of intervals $I$ passed since start $T_0$.
• $M = 999983$: A large prime number used for the modulus.

The server validates the code within a window of $[C-1, C, C+1]$ to account for network latency.