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.
Supported in part by NSF Career Award CCR-0093029
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
I. Anshel, M. Anshel and D. Goldfeld. An Algebraic Method for Public-Key Cryptography. Mathematical Research Letters, 6 (1999), pp. 287–291.
M. Bellare and P. Rogaway, “Random oracles are practical: a paradigm for designing efficient protocols”, 1st ACM Conference on Computer and Communications Security, 1993, 62–73.
D. Boneh. The Decision Diffie-Hellman Problem. Third Algorithmic Number Theory Symposium. LNCS 1423, pp. 48–63, Springer 1998.
D. Boneh, H. Shacham, and B. Lynn. Short signatures from the Weil pairing. Asiacrypt’ 2001. LNCS 2248, pp. 514–532, Springer-Verlag 2001.
S. Brands. An efficient off-line electronic cash system based on the representation problem. Technical Report CS-R9323, CWI (Centre for Mathematics and Computer Science), Amsterdam, 1993.
J.L. Carter and M.N. Wegman, Universal classes of hash functions, Journal of Computer and System Sciences 18:143–154, 1979.
R. Gennaro, D. Micciancio. Cryptanalysis of a Pseudorandom Generator based on Braid Groups. CRYPTO’2001 rump session, August 2001.
O. Goldreich, L. Levin. Hard-core Predicates for any One-way Function. 21st STOC, pp. 25–32, 1989.
S. Goldwasser, S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences 28:270–299, April 1984.
K.H. Ko, S.J. Lee, J.H. Cheon, J.W. Han, J. Kang, C. Park. New Public-Key Cryptosystem Using Braid Groups. CRYPTO’2000, LNCS 1880, pp. 166–183, Springer 2000.
E. Lee, S.J. Lee, S.G. Hahn. Pseudorandomness from Braid Groups. CRYPTO’2001, Springer 2001.
T. Okamoto, D. Pointcheval The Gap problem: a new class of problems for the security of cryptographic primitives Public Key Cryptography, PKC 2001, LNCS 1992, Springer-Verlag 2001.
E. R. Verheul Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems Eurocrypt’2001. LNCS 2045, p. 195–210
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gennaro, R., Micciancio, D. (2002). Cryptanalysis of a Pseudorandom Generator Based on Braid Groups. In: Knudsen, L.R. (eds) Advances in Cryptology — EUROCRYPT 2002. EUROCRYPT 2002. Lecture Notes in Computer Science, vol 2332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46035-7_1
Download citation
DOI: https://doi.org/10.1007/3-540-46035-7_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43553-2
Online ISBN: 978-3-540-46035-0
eBook Packages: Springer Book Archive