Short answers, pulled from the story.
A Costa Rican software company named TecApro submitted the FROG algorithm to the Advanced Encryption Standard competition in 1998. The submission came from three authors: Georgoudis, Leroux and Chaves.
FROG broke the pattern of fixed mathematical operators by using the secret key as executable instructions instead of mere data. An expanded version of the key functioned as a program within the system that acted as an interpreter applied to plaintext.
David Wagner published his analysis of the security flaws in the FROG algorithm in proceedings of the 2nd AES candidate conference in 1999. He worked with Niels Ferguson and Bruce Schneier on this publication.
The reference C implementation of the FROG algorithm contains only about 150 lines of code. Developers could write an assembly routine with just 22 machine instructions to perform full encryption and decryption.
The FROG algorithm suffered from very slow key setup times and relatively low encryption speeds compared to competing algorithms submitted for the standard. Researchers noted these limitations alongside security flaws where specific keys allowed attackers to break the cipher.