Mosquito
Joan Daemen and Paris Kitsos submitted the MOSQUITO algorithm to the eSTREAM project in 2005. They aimed to create a dedicated self-synchronizing stream cipher for hardware efficiency. Standard block ciphers used in CFB mode proved very inefficient for single-bit self-synchronizing encryption. The designers believed a specialized approach would solve this performance gap. Their document published that year outlined these specific goals clearly.
Antoine Joux and Frédéric Muller demonstrated fatal flaws in the cipher during 2006. Their conference paper stated that all dedicated Self-Synchronizing Stream Ciphers of the KNOT-MOSQUITO family were subject to differential chosen ciphertext attacks. This finding revealed an extreme difficulty in designing resistant systems against such attacks. Previous results on HBB, KNOT, and SSS supported their conclusion about inherent structural weaknesses. The cryptographic community recognized these vulnerabilities as immediate threats to the original design.
A modified version named MOUSTIQUE advanced to Phase 3 of the evaluation process. It stood alone as the only self-synchronizing cipher remaining at that stage. Observers noted that reaching the third phase represented a significant advance in stream cipher development. This progression marked the algorithm's survival despite earlier critiques from researchers like Joux and Muller. The eSTREAM project continued its rigorous assessment of this unique candidate system.
Käsper et al successfully broke the MOUSTIQUE variant after it reached the final phases. This event left secure design for efficient self-synchronizing stream ciphers as an open research problem. No other algorithms survived the scrutiny required by the eSTREAM project standards. The failure highlighted the persistent challenges in balancing speed with robust security guarantees. Researchers now face the task of solving what remains unsolved regarding this specific class of encryption.
The specification details eight registers of varying lengths within the MOSQUITO cipher structure. One register called CCSR holds exactly 128 bits while others range down to just 3 bits. The first register measures 53 bits and the second measures 12 bits before dropping to 3 bits. Bits shift through these registers during each clock cycle operation. A bit of encrypted text enters the zero position of the CCSR register to maintain synchronization.
Common questions
When did Joan Daemen and Paris Kitsos submit the MOSQUITO algorithm to the eSTREAM project?
Joan Daemen and Paris Kitsos submitted the MOSQUITO algorithm to the eSTREAM project in 2005. Their document published that year outlined specific goals for a dedicated self-synchronizing stream cipher.
Who demonstrated fatal flaws in the MOSQUITO cipher during 2006?
Antoine Joux and Frédéric Muller demonstrated fatal flaws in the cipher during 2006. Their conference paper stated that all dedicated Self-Synchronizing Stream Ciphers of the KNOT-MOSQUITO family were subject to differential chosen ciphertext attacks.
What happened to the MOUSTIQUE variant after it reached Phase 3 of the evaluation process?
Käsper et al successfully broke the MOUSTIQUE variant after it reached the final phases. This event left secure design for efficient self-synchronizing stream ciphers as an open research problem with no other algorithms surviving the scrutiny required by the eSTREAM project standards.
How many registers does the specification detail within the MOSQUITO cipher structure?
The specification details eight registers of varying lengths within the MOSQUITO cipher structure. One register called CCSR holds exactly 128 bits while others range down to just 3 bits.