Fair-coin-flip

Alice slide to pick the number of digits for your primes.

Then click here to generate primes of digits.

n = is the product of Alice's primes which is now given to Bob

Bob, choose a positive integer less than n to use as your root.

Slide to choose a root, and then, click here to send its square to Alice x2 =

Bob's chosen square is a = .

Alice using her prime factors of n is able to solve a = x2 (mod n) for the four possible values of x.

Alice, choose one of these square roots to send back to Bob

or or or

(Note: two of these are simply negations of each other)

Since Alice chose a root of a that Bob did not know, Bob now knows all roots and is able to factor n quickly, so Bob wins the coin flip.

Since Alice chose a root of a that Bob already knew, Bob does not have enough information to factor n quickly, so Alice wins the coin flip.

Alice's prime factors were p = , q =

Bob's root was x =