• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.3
• /
• pp.13-22
• /
• 2001

The notion of pseudorandomness plays an important role in modem cryptography as well as computer science. We show a simple and practical construction of a pseudorandom generator based on the intractability of the problem in braid groups. The generator is proved as secure as a hard instance of a variant of the conjugacy problem.