Natural representations of black box groups encrypting SL2(Fq)

Abstract

Given a global exponent E for a black box group Y encrypting SL2(F), where F is an unknown finite field of unknown odd characteristic, we construct, in probabilistic time polynomial in E, the isomorphisms \[ Y SL2(K), \] where K is a black box field encrypting F. Our algorithm makes no reference to any additional oracles. We also give similar algorithms for black box groups encrypting PGL2(F), PSL2(F).

0

Discussion (0)

Sign in to join the discussion.

Loading comments…