Abstract
We show that the decisional version of the Ko-Lee assumption for braid groups put forward by Lee, Lee and Hahn at Crypto 2001 is false, by giving an efficient algorithm that solves (with high probability) the corresponding decisional problem. Our attack immediately applies to the pseudo-random generator and synthesizer proposed by the same authors based on the decisional Ko-Lee assumption, and shows that neither of them is cryptographically secure.
Cite
CITATION STYLE
Gennaro, R., & Micciancio, D. (2002). Cryptanalysis of a pseudorandom generator based on braid groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2332, pp. 1–13). Springer Verlag. https://doi.org/10.1007/3-540-46035-7_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
