Elgamal Demonstration Project

To familiarize high school students with concepts in computer science and cryptography, I wrote an Elgamal demo for a programmable calculator that is compulsory in most highschools. When students experimented with the program, they found out that a repeated Pollard's Rho computation with the same input, very often completes in exactly the same amount of iterations. We found that this is no coincidence. With a random starting point, the number of iterations is most often equal to the size of the dominant cycle in the random graph.

Daľšie informácie: Bezadis UPJŠ