Orthogonal and Symplectic Black Box Groups, Revisited

2001/10/21 by Alexandre Borovik, Alexandre V. Borovik, Borovik, Alexandre V. · 1 citation
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Finite Group Theory Research #graph theory and CDMA systems #math.GR #math.PR #msc:20P05

paper · pdf · doi:10.48550/arxiv.math/0110234

23 pp, LaTeX2e, requires packages amssymb, amsmath

arxiv created 2001/10/21 · arxiv updated 2009/11/30

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.

Cited by

• The Andrews-Curtis Conjecture and Black Box Groups

Related

• Construction of Curtis-Phan-Tits system in black box classical groups
• Fifty shades of black
• Gaussian Elimination in Symplectic and split orthogonal groups
• Computations in Classical Groups
• Steinberg presentations of black box classical groups in small characteristics