paper

Orthogonal and Symplectic Black Box Groups, Revisited

arXiv:math/0110234

Abstract

We propose a simple one sided Monte-Carlo algorithm to distinguish, to any given degree of certainty, between certain symplectic and orthogonal groups over fields of odd order. The algorithm does not use an order oracle and works in polynomial time.

23 pp, LaTeX2e, requires packages amssymb, amsmath

Orthogonal and Symplectic Black Box Groups, Revisited · wovepaper